​
-
On the Lossy Kernelization for Connected Treedepth Deletion Set - Conference talk (online), WG, June 23, 2022.
-
Generalized Noise Role Mining;
- Conference talk (online), ACM-SACMAT, June 8, 2022. -
Valued Authorization Policy Existence Problem; - Conference talk (online), ACM-SACMAT, June 17, 2021.
-
p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms; - Parameterized Complexity Seminar Series (online), November 10, 2020.
-
Tractability of Konig Edge Deletion Problems;
- contributed talk (online), March 29, BCTCS 2021. - contributed talk (online), June 8, 20th Haifa Workshop on Graphs, Combinatorics and Algorithms 2020.
-
Parameterized Pre-coloring Extension and List Coloring Problems;
- a contributed talk (online), April 8, BCTCS 2020. -
Parameterized Complexity of Conflict Free Set Cover;
- Conference talk at Novosibirsk State University, Russia, July 1, CSR 2019. -
Algorithms that exploit some Structures of the Input;
- The Institute of Mathematical Sciences, April 16, Chennai, India, Institute Seminar Day 2018. -
Kernelization of some Generalizations of Cycle Packing;
- The Institute of Mathematical Sciences, October 25, 2017, Chennai, India. - Indian Statistical Institute, January 7, 2020, Kolkata, India. -
Structural Parameterizations of Feedback Vertex Set;
- Algorithms Seminar Series, Department of Informatics, University of Bergen, September 2, 2016, Norway.
- Conference talk at Aarhus University, Denmark, August 24, IPEC 2016. - The Institute of Mathematical Sciences, August 12, 2016, Chennai, India. -
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators; - Chennai Theory Day (CTD) 2016, April 29, Chennai, India.
-
Kernels for Structural Parameterizations of Vertex Cover - case of Small Degree Modulators; - Algorithms Seminar Series, Department of Informatics, University of Bergen, October 2, 2015, Norway. - Conference talk at University of Patras, September 18, 2015, Greece for IPEC 2015.