"Erdős-Gyárfás conjecture on graphs without long induced paths". Frontiers Symposium in Data Science (FS-DSC 2025), 1 February 2025, IISER Thiruvananthapuram, India [slides]
"Switching classes: characterization and computation". 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), 27 August 2024, Bratislava, Slovakia [slides]
"Switching classes: characterization and computation". 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024), 27 August 2024, Bratislava, Slovakia [slides]
"Contracting edges to destroy a pattern: A complexity study". 24TH INTERNATIONAL SYMPOSIUM ON FUNDAMENTALS OF COMPUTATION THEORY, FCT 2023, 18 Septermber 2023, Trier, Germany [slides]
"Subgraph complementation of graphs". The first youth forum of Associations of Asia Pacific Operations Research Societies (APORS). [online; slides]
"Algorithmic lower bounds", Faculty Development Programme on "Recent trends in algorithms"; 25 November 2021; Govt. Engineering College, Palakkad; Online.
"Graph theory and algorithms", Faculty Development Programme on "Fine tune your research planning"; 24 March 2021; Govt. Engineering College, Palakkad; Online.
"Incompressibility of H-free edge modification problems: Towards a dichotomy", ESA 2020; online; 8th September 2020; slides; video.
"Polynomial kernelization of H-free edge modification problems: Towards a dichotomy", IIT Hyderabad, 1st November 2019; Workshop on Graph Modification, Bergen, 23rd January 2020; Max Plank Institute for Informatics, Saarbrücken, 30th January 2020
"Tossing a coin over the telephone", National Science Day event, IIT Dharwad (for school students), 28th February 2019 (based on the activity "The Peruvian Coin Flip" in the book CS Unplugged)
"Dichotomy results for the hardness of H-free edge modification problems", Mini-symposium on Modification to Discrete Structures, SIAM Conference on Discrete Mathematics (DM18), University of Colorado Denver, US, 7th June 2018 [slides]