Selected invited talks, public lectures, recordings, and course resources.
2026
• Picking Random at Vertices — Algorithms and Logic Group, UESTC, Chengdu, July 17
• FPT Approximation via Random Walks — Theory Fest, aRtCS, IIT Madras, March 28
• Invited talk — Recent Trends in Logic and Game Theory, Chennai, March 16–18
2025
• Frontiers of Graph Algorithms — IISc Bengaluru, December 8–12
• COCOON 2025 — Chengdu, China, August 15–17
• IWOCA 2025 — Bozeman, USA, July 21–24
• Workshop on Hardness of Approximation in P — Rutgers University, July 21–23
• CIAC 2025 — Rome, Italy, June 10–12 (two presentations)
• Theoretical, Algorithmic, and Spectral Approaches in Graph Theory — IIT (ISM) Dhanbad, May 9–11
• EECS Plenary — Bengaluru, April 3–4
• CSA Seminar — IISc Bengaluru, April 1
2024
• Frontiers of Geometric Algorithms — IISc Bengaluru, December 11–15
• Geometry Meets Graphs — IIT Bombay, September 29
• Science at the Sabha — Chennai, February 18
• STEMS — Chennai Mathematical Institute, February 17
• CALDAM 2024 — Bhilai, February 15–17
• Pingala Interactions in Computing — ACM India, Mysore, February 3–6
• ESA 2022 — Potsdam, Germany
• Perspectives in Mathematical Sciences — Chennai Mathematical Institute, 2022
• WG 2019 — Vall de Núria, Spain
• WALCOM 2019 — Guwahati, India
• SIAM Conference on Discrete Mathematics — Atlanta, USA, 2016
• Simons Institute workshop on Satisfiability Lower Bounds — Berkeley, USA, 2015
• ICERM Semester Program on Network Science and Graph Algorithms — Brown University, USA, 2014
• ADFOCS 2013 — Max Planck Institute for Informatics, Germany
• Tutorial on Parameterized Complexity — DIMACS Workshop on Hardness of Approximation in P, 2025
• The Art and Math of Puzzle Solving — Science at the Sabha 2024
• Coping with Intractability Using Parameters
• Parameterized Complexity — video lecture archive
• Algebraic Graph Algorithms — lecture notes and presentations
• Algorithms for Big Data — Fall 2019 videos
• Algorithms for Big Data — Fall 2020 slides, videos, and references