Home › Talks

Talks

Here is a list of some of my talks and presentations.

  1. Large-Scale Coordination of Warehouse Robots and Drones. The International Conference on Micro, Nano and Smart Systems (IC-MNSS-2024).

  2. Compiling Weighted Constraint Satisfaction Problems to Minimum Weighted Vertex Cover Problems. RV University, Bangalore, India, 2024.

  3. Building Blocks and Architectures: Algorithms, Artificial Intelligence, and Beyond. Indian Institute of Technology, Guwahati, Alumni Association, 2024.

  4. Revisiting FastMap: New Applications. Department of Industrial and Systems Engineering, USC, California, 2024.

  5. Smoothness and Flow Techniques in Intelligent Scheduling. Meta Platforms, Inc., 2023.

  6. Embedding and Search Techniques for Large-Scale Graph Problems. Networking and Cybersecurity Division, Information Sciences Institute, USC, California, 2021.

  7. FastMap and Its Applications. Information Sciences Institute, USC, California, 2021.

  8. Constrained Optimization. AI Futures Symposium on Artificial Intelligence and Data Science, Information Sciences Institute, USC, California, 2021.

  9. FastMap: An Efficient Graph-Embedding Algorithm. Morgan Stanley, 2021.

  10. A Near-Linear-Time Graph-Embedding Algorithm with Applications. Department of Industrial and Systems Engineering, USC, California, 2020.

  11. Compiling Weighted Constraint Satisfaction Problems to Minimum Weighted Vertex Cover Problems. Department of Industrial and Systems Engineering, USC, California, 2020.

  12. The Weighted Constraint Satisfaction Problem: Applications in Physics and Materials Science. USC Quantum Information – Condensed Matter Physics – Biophysics Seminars, 2019.

  13. Inference and Learning in Weighted Constraint Satisfaction Problems: Applications in Materials Science. Center for Integrated Nanotechnologies, Sandia National Laboratories, 2019.

  14. Path Planning Revisited. International School of Engineering, Bangalore, India, 2019.

  15. Quadratic Reformulation of Nonlinear Pseudo-Boolean Functions via the Constraint Composite Graph. The Sixteenth International Conference on the Integration of Constraint Programming, Artificial Intelligence and Operations Research (CPAIOR-2019).

  16. New Algorithms for Single and Multi-Agent Path Finding. University of Memphis, Tennessee, 2018.

  17. Algorithmic Advances in Temporal Reasoning. Information Sciences Institute, USC, California, 2018.

  18. Lifting Techniques for Combinatorial Optimization Problems. Intelligent Systems Division, Information Sciences Institute, USC, California, 2018.

  19. The Constraint Composite Graph and Its Applications. Computer Science Colloquium, USC, California, 2018.

  20. Load Scheduling of Simple Temporal Networks Under Dynamic Resource Pricing. The Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-2018).

  21. The FastMap Algorithm for Shortest Path Computations. The Fifteenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2018).

  22. On the Linear Programming Duals of Temporal Reasoning Problems. The Fifteenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2018).

  23. Coordinating Teams of Agents for High-Level Tasks. Joint USC/ISI/CERDEC Meeting, Information Sciences Institute, USC, California, 2017.

  24. Message Passing for Large Scale Combinatorial Optimization. Computational Condensed Matter Theory Group, Physics Department, USC, California, 2017.

  25. Inaugural Talk: Collaboratory for Algorithmic Techniques and Artificial Intelligence (CATAI). Information Sciences Institute, USC, California, 2017.

  26. New Methods for the Weighted Constraint Satisfaction Problem. Indian Institute of Science, Bangalore, India, 2016.

  27. Some Recent Advances in Optimization and Robotics. Northrop Grumman, California, 2016.

  28. Case Studies in Algorithmic Techniques for AI and Robotics. Zoox Inc., California, 2016.

  29. A New Solver for the Minimum Weighted Vertex Cover Problem. The Thirteenth International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR-2016).

  30. Notes on the Constraint Composite Graph. Natural Language Group, Information Sciences Institute, USC, California, 2015.

  31. Flow-Based Techniques for Temporal Reasoning. Civil and Environmental Engineering Department, USC, California, 2015.

  32. Topics in Constraint Satisfaction and Weighted Constraint Satisfaction. Information Sciences Institute, USC, California, 2014.

  33. On Some Combinatorial Problems with Multiple Agents. Teamcore Research Group, USC, California, 2014.

  34. A Case Study in Automating Collective Construction. Civil and Environmental Engineering Department, USC, California, 2014.

  35. A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints. The Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI-2014).

  36. Identifying Hierarchies for Fast Optimal Search. Presented for Tansel Uras and Sven Koenig at: The Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI-2014).

  37. A Tree-Based Algorithm for Construction Robots. The Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS-2014). Also: The AAAI-2014 Workshop on Artificial Intelligence and Robotics (AIRob-2014).

  38. Smoothness and Tractability in Constraint Satisfaction and Temporal Reasoning. NASA Ames Research Center, California, 2014.

  39. Collective Construction and Spatio-Temporal Reasoning. ANTIDOTE, ONR Principal Investigators’ Meeting, Massachusetts Institute of Technology, 2014.

  40. Simple Temporal Problems with Taboo Regions. Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI-2013).

  41. On the Traveling Salesman Problem with Simple Temporal Constraints. Tenth International Symposium on Abstraction, Reformulation and Approximation (SARA-2013).

  42. Submodular Constraints and Planar Constraint Networks: New Results. Tenth International Symposium on Abstraction, Reformulation and Approximation (SARA-2013).

  43. A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems. Fourteenth International Conference on Principles and Practice of Constraint Programming (CP-2008).

  44. Algorithmic Techniques for Constraint Satisfaction and Weighted Constraint Satisfaction Problems. Computer Science Department, University of West Florida, Florida, 2008.

  45. Lifting Techniques for Weighted Constraint Satisfaction Problems. Tenth International Symposium on Artificial Intelligence and Mathematics (ISAIM-2008).

  46. Algorithmic Techniques in (Soft) Constraint Satisfaction and Temporal Reasoning. Institute for Human and Machine Cognition, Florida, 2007. Also: NASA Ames Research Center, California, 2007.

  47. Contributions to Algorithmic Techniques in Constraint Satisfaction, Temporal Reasoning and Probabilistic Reasoning. Indian Institute of Science, Bangalore, India, 2006.

  48. Simple Randomized Algorithms for Tractable Row and Tree Convex Constraints. Twenty-First National Conference on Artificial Intelligence (AAAI-2006).

  49. Tractable Classes of Metric Temporal Problems with Domain Rules. Twenty-First National Conference on Artificial Intelligence (AAAI-2006).

  50. On the Tractability of Restricted Disjunctive Temporal Problems. Fifteenth International Conference on Automated Planning and Scheduling (ICAPS-2005). Also: Stanford Theory Lunch group meeting.

  51. A Polynomial-Time Algorithm for Simple Temporal Problems with Piecewise Constant Domain Preference Functions. Nineteenth National Conference on Artificial Intelligence (AAAI-2004).

  52. On Disjunctive Representations of Distributions and Randomization. Twenty-Fourth SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence (AI-2004).

  53. Incremental Computation of Resource-Envelopes in Producer-Consumer Models. Ninth International Conference on Principles and Practice of Constraint Programming (CP-2003).

  54. SAT-Based Algorithms for Bayesian Network Inference. Twenty Second SGAI International Conference on Knowledge Based Systems and Applied Artificial Intelligence (ES-2002). Also: Stanford Theory Lunch group meeting.

  55. An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection. Fifth International Symposium on Abstraction, Reformulation and Approximation (SARA-2002).

  56. HCBFS: Combining Structure-Based and TMS-Based Approaches in Model-Based Diagnosis. Thirteenth International Workshop on Principles of Diagnosis (DX-2002).