| 2020 | AAAI | Teaching Undergraduate Artificial Intelligence Classes: An Experiment with an Attendance Requirement. | Sven Koenig, Tansel Uras, Liron Cohen |
| 2020 | SoCS | Toward a String-Pulling Approach to Path Smoothing on Grid Graphs. | Jihee Han, Tansel Uras, Sven Koenig |
| 2019 | IJCAI | Regarding Jump Point Search and Subgoal Graphs. | Daniel Damir Harabor, Tansel Uras, Peter J. Stuckey, Sven Koenig |
| 2019 | SoCS | Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. | Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig |
| 2018 | IJCAI | The FastMap Algorithm for Shortest Path Computations. | Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar |
| 2018 | IJCAI | Understanding Subgoal Graphs by Augmenting Contraction Hierarchies. | Tansel Uras, Sven Koenig |
| 2018 | ISAIM | The FastMap Algorithm for Shortest Path Computations. | Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar |
| 2018 | SoCS | Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs. | Tansel Uras, Sven Koenig |
| 2017 | SoCS | Feasibility Study: Subgoal Graphs on State Lattices. | Tansel Uras, Sven Koenig |
| 2016 | IJCAI | Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding. | Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian, Sven Koenig |
| 2015 | SoCS | Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path Finding. | Liron Cohen, Tansel Uras, Sven Koenig |
| 2015 | SoCS | The Grid-Based Path Planning Competition: 2014 Entries and Results. | Nathan R. Sturtevant, Jason M. Traish, James R. Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin |
| 2015 | SoCS | An Empirical Comparison of Any-Angle Path-Planning Algorithms. | Tansel Uras, Sven Koenig |
| 2014 | AAAI | Identifying Hierarchies for Fast Optimal Search. | Tansel Uras, Sven Koenig |
| 2014 | IROS | A lattice-based approach to multi-robot motion planning for non-holonomic vehicles. | Marcello Cirillo, Tansel Uras, Sven Koenig |
| 2014 | SoCS | Identifying Hierarchies for Fast Optimal Search. | Tansel Uras, Sven Koenig |
| 2012 | AAMAS | Time-bounded adaptive A. | Carlos Hernndez, Jorge A. Baier, Tansel Uras, Sven Koenig |
| 2012 | ETFA | Causality-based planning and diagnostic reasoning for cognitive factories. | Esra Erdem, Kadir Haspalamutgil, Volkan Patoglu, Tansel Uras |
| 2012 | SoCS | Position Paper: Incremental Search Algorithms Considered Poorly Understood. | Carlos Hernndez, Jorge A. Baier, Tansel Uras, Sven Koenig |
| 2012 | SoCS | Paper Summary: Time-Bounded Adaptive A. | Carlos Hernndez, Jorge A. Baier, Tansel Uras, Sven Koenig |
| 2012 | SoCS | Subgoal Graphs for Eight-Neighbor Gridworlds. | Tansel Uras, Sven Koenig, Carlos Hernndez |
| 2011 | ICRA | Combining high-level causal reasoning with low-level geometric reasoning and motion planning for robotic manipulation. | Esra Erdem, Kadir Haspalamutgil, Can Palaz, Volkan Patoglu, Tansel Uras |
| 2010 | AAAI | Genome Rearrangement: A Planning Approach. | Tansel Uras, Esra Erdem |