2023

• Finding a Highly Connected Steiner Subgraph and its Applications; with Eduard Eiben, and M. S. Ramanujan; Proceedings of International Symposium on Mathematical Foundations of Computer Science MFCS 2023.
   

2022

• On the Lossy Kernelization for Connected Treedepth Deletion Set; with Eduard Eiben, and M. S. Ramanujan; Proceedings of International Workshop on Graph Theoretic Concepts in Computer Science WG 2022. (PDF)
   

• Generalized Noise Role Mining; with Jason Crampton, Eduard Eiben, Gregory Gutin, and Daniel Karapetyan; Proceedings of ACM Symposium on Access Control Models and Technologies SACMAT 2022. (Best paper award in SACMAT 2022)

​

2021

• Constrained Hitting Set Problem with Intervals; with Ankush Acharyya, Vahideh Keikha, and Supantha Pandit; Proceedings of International Symposium on Computing and Combinatorics COCOON 2021.
   

• Faster FPT Algorithms for Deletion to Pairs of Graph Classes; with Ashwin Jacob, and Venkatesh Raman; Proceedings of International Symposium on Fundamentals of Computation Theory FCT 2021. (Best student paper award in FCT 2021)
   

• Valued Authorization Policy Existence Problem; with Jason Crampton, Eduard Eiben, Gregory Gutin, and Daniel Karapetyan; Proceedings of ACM Symposium on Access Control Models and Technologies SACMAT 2021. (PDF) (Best paper award in SACMAT 2021)

​

2020

• Parameterized Complexity of Deletion to Scattered Graph Classes; with Ashwin Jacob, and Venkatesh Raman; Proceedings of 15th International Symposium on Parameterized and Exact Compuation, IPEC 2020; LIPIcs; Volume 180; pages 18.1--18.17.
   

• Parameterized Precoloring Extension and List Coloring Problems; with Gregory Gutin, Sebastian Ordyniak, and Magnus Wahlstrom; Proceedings of 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020; arXiv: abs/1905.03379, 2019; LIPIcs; Volume 154; pages 19.1--19.18.

 

2019

• Bounded and Approximate Strong Satisfiability in Workflows; with Jason Crampton, and Gregory Gutin; Proceedings of the 24th ACM Symposium on Access Control Models and Technologies, SACMAT 2019; arXiv: abs/1904.07234, 2019.
   

• Parameterized Complexity of Conflict-Free Set Cover; with Ashwin Jacob and Venkatesh Raman; Proceedings of the 14th International Computer Science Symposium in Russia CSR 2019; volume 11532, pages 191–202, LNCS 2019.

​

2018

• Structural Parameterizations of Dominating Set Variants; with Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar and Venkatesh Raman; Proceedings of the 13th International Computer Science Symposium in Russia CSR 2018, volume 10846, pages 157-168, LNCS, 2018.

​

2017

• FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters; with Venkatesh Raman; Proceedings of the 11th International Frontiers of Algorithmics Workshop FAW 2017, volume 10336, pages 209-220, LNCS, 2017.
   

• Exact and Parameterized Algorithms for (k,i)-Coloring; with Rian Neogi, Venkatesh Raman and Prafullkumar P. Tale; Proceedings of the 3rd International Conference on Algorithms and Discrete Applied Mathematics CALDAM 2017, volume 10156, pages 281-293. Springer, LNCS, 2017.

 

2016

• Structural Parameterizations of Feedback Vertex Set; Proceedings of the 11th International Symposium on Parameterized and Exact Computation IPEC 2016, volume 63 of LIPIcs, pages 21:1-21:16. 2016.
   

• Kernelization of Cycle Packing with Relaxed Disjointness Constraints; with Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad and Saket Saurabh; Proceedings of the 43rd International Colloquium on Automata, Languages and Programming; ICALP 2016,volume 55 of LIPIcs, pages 26:1-26:14. 2016.

​

2015

• Kernels for Structural Parameterizations of Vertex Cover - case of Small Degree Modulators; with Venkatesh Raman and Saket Saurabh; Proceedings of the 10th International Symposium on Parameterized and Exact Computation IPEC 2015, volume 43 of LIPIcs, pages 331-342. 2015.