| 2025 | ICCCN | Efficient Privacy-Preserving Network Path Validation. | Weizhao Jin, Erik Kline, T. K. Satish Kumar, Lincoln Thurlow, Srivatsan Ravi |
| 2024 | FlAIRS | Constraint Composite Graph-Based Weighted CSP Solvers: An Empirical Study. | Orazio Rillo, T. K. Satish Kumar |
| 2024 | ICAPS | Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths. | Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Sven Koenig |
| 2024 | ICAPS | Map Connectivity and Empirical Hardness of Grid-based Multi-Agent Pathfinding Problem. | Jingyao Ren, Eric Ewing, T. K. Satish Kumar, Sven Koenig, Nora Ayanian |
| 2024 | ICMLA | FastMapSVM/FastMapSVR for Predictive Tasks on CSPs, SAT, and Weighted CSPs. | Kexin Zheng, Ang Li, T. K. Satish Kumar |
| 2024 | ICTAI | Virtual Network Embedding as Boolean Satisfiability. | Pavel Surynek, Yi Zheng, Erik Kline, Sven Koenig, T. K. Satish Kumar |
| 2024 | SoCS | Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures. | Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernndez Ulloa, Sven Koenig |
| 2024 | SoCS | Solving Facility Location Problems via FastMap and Locality Sensitive Hashing. | Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar |
| 2023 | CP | FastMapSVM for Predicting CSP Satisfiability. | Kexin Zheng, Ang Li, Han Zhang, T. K. Satish Kumar |
| 2023 | FlAIRS | Dynamic FastMap: An Efficient Algorithm for Spatiotemporal Embedding of Dynamic Graphs. | Omkar Thakoor, T. K. Satish Kumar |
| 2023 | ICCCN | Improved Conflict-Based Search for the Virtual Network Embedding Problem. | Yi Zheng, Srivatsan Ravi, Erik Kline, Lincoln Thurlow, Sven Koenig, T. K. Satish Kumar |
| 2023 | ICMLA | A Study of Distance Functions in FastMapSVM for Classifying Seismograms. | Kushal Sharma, Ang Li, Malcolm C. A. White, T. K. Satish Kumar |
| 2023 | SoCS | Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics. | Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernndez Ulloa, Sven Koenig |
| 2022 | CP | Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data. | Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar, T. K. Satish Kumar |
| 2022 | CPAIOR | A FastMap-Based Algorithm for Block Modeling. | Ang Li, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar |
| 2022 | PRIMA | The FastMap Pipeline for Facility Location Problems. | Omkar Thakoor, Ang Li, Sven Koenig, Srivatsan Ravi, Erik Kline, T. K. Satish Kumar |
| 2022 | SoCS | Mutex Propagation in Multi-Agent Path Finding for Large Agents. | Han Zhang, Yutong Li, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig |
| 2022 | SoCS | Anytime Approximate Bi-Objective Search. | Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernndez Ulloa, Sven Koenig |
| 2021 | AAAI | Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. | Jiaoyang Li, Andrew Tinka, Scott Kiesel, Joseph W. Durham, T. K. Satish Kumar, Sven Koenig |
| 2021 | CP | Differential Programming via OR Methods. | Shannon Sweitzer, T. K. Satish Kumar |
| 2021 | FlAIRS | Hysteresis in Combinatorial Optimization Problems. | Yuling Guan, Ang Li, Sven Koenig, Stephan Haas, T. K. Satish Kumar |
| 2021 | SoCS | A Hierarchical Approach to Multi-Agent Path Finding. | Han Zhang, Mingze Yao, Ziang Liu, Jiaoyang Li, Lucas Terr, Shao-Hung Chan, T. K. Satish Kumar, Sven Koenig |
| 2020 | AAAI | Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers. | Ngai Meng Kou, Cheng Peng, Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2020 | CP | Exact Approaches to the Multi-agent Collective Construction Problem. | Edward Lam, Peter J. Stuckey, Sven Koenig, T. K. Satish Kumar |
| 2020 | ISAIM | Hybrid Quantum-Classical Algorithms for Solving the Weighted CSP. | Hong Xu, Kexuan Sun, Sven Koenig, Itay Hen, T. K. Satish Kumar |
| 2020 | ICTAI | Generating the Top $K$ Solutions to Weighted CSPs: A Comparison of Different Approaches. | Ang Li, Yuling Guan, Sven Koenig, Stephan Haas, T. K. Satish Kumar |
| 2020 | PRIMA | Mutex Propagation for SAT-based Multi-agent Path Finding. | Pavel Surynek, Jiaoyang Li, Han Zhang, T. K. Satish Kumar, Sven Koenig |
| 2020 | SoCS | Moving Agents in Formation in Congested Environments. | Jiaoyang Li, Kexuan Sun, Hang Ma, Ariel Felner, T. K. Satish Kumar, Sven Koenig |
| 2020 | SoCS | Decision Tree Learning-Inspired Dynamic Variable Ordering for the Weighted CSP. | Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar |
| 2020 | SoCS | Embedding Directed Graphs in Potential Fields Using FastMap-D. | Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar |
| 2019 | AAAI | Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery. | Hang Ma, Wolfgang Hnig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig |
| 2019 | AAAI | Multi-Agent Path Finding for Large Agents. | Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2019 | CPAIOR | Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. | Ka-Wa Yip, Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2019 | FlAIRS | Top K Hypotheses Selection on a Knowledge Graph. | Kexuan Sun, Krishna Akhil Maddali, Shriraj Salian, T. K. Satish Kumar |
| 2019 | FlAIRS | Automatic Adaptation to Sensor Replacements. | Yuan Shi, T. K. Satish Kumar, Craig A. Knoblock |
| 2019 | SoCS | Extended Abstract: Lifelong Path Planning with Kinematic Constraintsfor Multi-Agent Pickup and Delivery. | Hang Ma, Wolfgang Hnig, T. K. Satish Kumar, Nora Ayanian, Sven Koenig |
| 2019 | SoCS | Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. | Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig |
| 2019 | SoCS | Multi-Agent Path Finding for Large Agents. | Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2019 | SoCS | Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. | Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Bartk, Eli Boyarski |
| 2018 | AAAI | Load Scheduling of Simple Temporal Networks Under Dynamic Resource Pricing. | T. K. Satish Kumar, Zhi Wang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock |
| 2018 | CP | Towards Effective Deep Learning for Constraint Satisfaction Problems. | Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2018 | CPAIOR | A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. | Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar |
| 2018 | FlAIRS | Alert Generation in Execution Monitoring Using Resource Envelopes. | T. K. Satish Kumar, Hong Xu, Zheng Tang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock |
| 2018 | IJCAI | Multi-Agent Path Finding with Deadlines. | Hang Ma, Glenn Wagner, Ariel Felner, Jiaoyang Li, T. K. Satish Kumar, Sven Koenig |
| 2018 | IJCAI | Anytime Focal Search with Applications. | Liron Cohen, Matias Greco, Hang Ma, Carlos Hernndez, Ariel Felner, 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 | ISAIM | The FastMap Algorithm for Shortest Path Computations. | Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar |
| 2018 | ISAIM | A Warning Propagation-Based Linear-Time-and-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. | Hong Xu, Kexuan Sun, Sven Koenig, T. K. Satish Kumar |
| 2018 | ISAIM | The Buss Reduction for the k-Weighted Vertex Cover Problem. | Hong Xu, Xin-Zeng Wu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar |
| 2018 | ISAIM | Constraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems. | Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2018 | ISAIM | On the Linear Programming Duals of Temporal Reasoning Problems. | T. K. Satish Kumar, Zhi Wang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock |
| 2018 | ISAIM | Towards Understanding the Min-Sum Message Passing Algorithm for the Minimum Weighted Vertex Cover Problem: An Analytical Approach. | Masaru Nakajima, Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2018 | ICTAI | Constraint-Based Learning for Sensor Failure Detection and Adaptation. | Yuan Shi, T. K. Satish Kumar, Craig A. Knoblock |
| 2018 | PRIMA | Solving Multiagent Constraint Optimization Problems on the Constraint Composite Graph. | Ferdinando Fioretto, Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2018 | SoCS | Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. | Liron Cohen, Glenn Wagner, David M. Chan, Howie Choset, Nathan R. Sturtevant, Sven Koenig, T. K. Satish Kumar |
| 2018 | SoCS | Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems. | Hong Xu, Cheng Cheng, Sven Koenig, T. K. Satish Kumar |
| 2017 | AAAI | Multi-Agent Path Finding with Delay Probabilities. | Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2017 | CP | A Constraint Composite Graph-Based ILP Encoding of the Boolean Weighted CSP. | Hong Xu, Sven Koenig, T. K. Satish Kumar |
| 2017 | CPAIOR | The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP. | Hong Xu, T. K. Satish Kumar, Sven Koenig |
| 2017 | IJCAI | Summary: Multi-Agent Path Finding with Kinematic Constraints. | Wolfgang Hnig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig |
| 2017 | ICTAI | A Distributed Logical Filter for Connected Row Convex Constraints. | T. K. Satish Kumar, Hong Xu, Zheng Tang, Anoop Kumar, Craig Milo Rogers, Craig A. Knoblock |
| 2017 | SoCS | A Linear-Time and Linear-Space Algorithm for the Minimum Vertex Cover Problem on Giant Graphs. | Hong Xu, T. K. Satish Kumar, Sven Koenig |
| 2016 | AAAI | Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem. | Hang Ma, Craig A. Tovey, Guni Sharon, T. K. Satish Kumar, Sven Koenig |
| 2016 | AAAI | Planning, Scheduling and Monitoring for Airport Surface Operations. | Robert Morris, Corina S. Pasareanu, Kasper Se Luckow, Waqar Malik, Hang Ma, T. K. Satish Kumar, Sven Koenig |
| 2016 | CPAIOR | A New Solver for the Minimum Weighted Vertex Cover Problem. | Hong Xu, T. K. Satish Kumar, 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 |
| 2016 | IROS | Formation change for robot groups in occluded environments. | Wolfgang Hnig, T. K. Satish Kumar, Hang Ma, Sven Koenig, Nora Ayanian |
| 2016 | ISAIM | Kernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems. | T. K. Satish Kumar |
| 2016 | ICTAI | SAGL: A New Heuristic for Multi-Robot Routing with Complex Tasks. | Hong Xu, T. K. Satish Kumar, Dylan Johnke, Nora Ayanian, Sven Koenig |
| 2016 | SoCS | Compliant Conditions for Polynomial Time Approximation of Operator Counts. | Tathagata Chakraborti, Sarath Sreedharan, Sailik Sengupta, T. K. Satish Kumar, Subbarao Kambhampati |
| 2014 | AAAI | A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints. | T. K. Satish Kumar, Duc Thien Nguyen, William Yeoh, Sven Koenig |
| 2013 | AAAI | Simple Temporal Problems with Taboo Regions. | T. K. Satish Kumar, Marcello Cirillo, Sven Koenig |
| 2008 | CP | A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems. | T. K. Satish Kumar |
| 2008 | ISAIM | Lifting Techniques for Weighted Constraint Satisfaction Problems. | T. K. Satish Kumar |
| 2007 | IJCAI | Fast (Incremental) Algorithms for Useful Classes of Simple Temporal Problems with Preferences. | T. K. Satish Kumar |
| 2006 | AAAI | Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints. | T. K. Satish Kumar |
| 2006 | AAAI | Tractable Classes of Metric Temporal Problems with Domain Rules. | T. K. Satish Kumar |
| 2005 | CPAIOR | On the Tractability of Smooth Constraint Satisfaction Problems. | T. K. Satish Kumar |
| 2004 | AAAI | A Polynomial-Time Algorithm for Simple Temporal Problems with Piecewise Constant Domain Preference Functions. | T. K. Satish Kumar |
| 2004 | SGAI | On Disjunctive Representations of Distributions and Randomization. | T. K. Satish Kumar |
| 2003 | CP | Incremental Computation of Resource-Envelopes in Producer-Consumer Models. | T. K. Satish Kumar |