
2025
-
Polynomial-Size Enumeration Kernelizations for Long Path Enumeration; with Christian Komusiewicz, Frank Sommer; Proceedings of WG 2025. (PDF)
-
On the Strutural Parameterizations of Locating-Dominating Set and Test Cover; with Dipayan Chakraborty, Florent Foucaud, Prafullkumar Tale; Proceedings of CIAC 2025. (PDF)
​
2024
-
Tight (Double) Exponential Bounds for Identification Problems; with Dipayan Chakraborty, Florent Foucaud, Prafullkumar Tale; Proceedings of ISAAC 2024. (PDF)
-
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees; with Ashwin Jacob, Meirav Zehavi; Proceedings of ISAAC 2024. (PDF)
-
Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints; with Susobhan Bandopadhyay, Suman Banerjee, Fahad Panolan; Proceedings of COCOA 2024.
-
Tractability of Packing Vertex-Disjoint A-Paths Under Length Constraints; with Susobhan Bandopadhyay, Aritra Banik, Abhishek Sahu; Proceedings of MFCS 2024.
2023
-
Finding a Highly Connected Steiner Subgraph and its Applications; with Eduard Eiben, M. S. Ramanujan;
Proceedings of MFCS 2023. (PDF)
2022
-
On the Lossy Kernelization for Connected Treedepth Deletion Set; with Eduard Eiben, M. S. Ramanujan;
Proceedings of WG 2022. (PDF)
-
Generalized Noise Role Mining; with Jason Crampton, Eduard Eiben, Gregory Gutin, Daniel Karapetyan;
Proceedings of ACM-SACMAT 2022. (Best paper award)
​
2021
-
Constrained Hitting Set Problem with Intervals; with Ankush Acharyya, Vahideh Keikha, Supantha Pandit;
Proceedings of COCOON 2021.
-
Faster FPT Algorithms for Deletion to Pairs of Graph Classes; with Ashwin Jacob, Venkatesh Raman;
Proceedings of FCT 2021. (Best student paper award)
-
Valued Authorization Policy Existence Problem; with Jason Crampton, Eduard Eiben, Gregory Gutin, Daniel Karapetyan; Proceedings of ACM-SACMAT 2021. (PDF) (Best paper award)
​
2020
-
Parameterized Complexity of Deletion to Scattered Graph Classes; with Ashwin Jacob, Venkatesh Raman;
Proceedings of IPEC 2020.
-
Parameterized Precoloring Extension and List Coloring Problems; with Gregory Gutin, Sebastian Ordyniak, Magnus Wahlstrom; Proceedings of STACS 2020.
2019
-
Bounded and Approximate Strong Satisfiability in Workflows; with Jason Crampton, Gregory Gutin;
Proceedings of ACM-SACMAT 2019; arXiv: abs/1904.07234, 2019.
-
Parameterized Complexity of Conflict-Free Set Cover; with Ashwin Jacob, Venkatesh Raman; Proceedings of CSR 2019.
​
2018
-
Structural Parameterizations of Dominating Set Variants; with Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Venkatesh Raman; Proceedings of CSR 2018.
​
2017
-
FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters; with Venkatesh Raman; Proceedings of FAW 2017.
-
Exact and Parameterized Algorithms for (k,i)-Coloring; with Rian Neogi, Venkatesh Raman, Prafullkumar P. Tale;
Proceedings of CALDAM 2017.
2016
-
Structural Parameterizations of Feedback Vertex Set; Proceedings of IPEC 2016.
-
Kernelization of Cycle Packing with Relaxed Disjointness Constraints; with Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh; Proceedings of ICALP 2016.
​
2015
-
Kernels for Structural Parameterizations of Vertex Cover - case of Small Degree Modulators; with Venkatesh Raman, Saket Saurabh; Proceedings of IPEC 2015.