top of page

2024

  • Bi-Objective Optimization in Role Mining; with Jason Crampton, Eduard Eiben, Gregory Gutin, Daniel Karapetyan; ACM-Transactions on Privacy and Security (ACM-TOPS); volume 28(1); pages 1-22; 2024. (PDF)
     

  • Constrained Hitting Set Problem with Intervals: Hardness, FPT, and Approximation Algorithms; with Ankush Acharyya, Vahideh Keikha, Supantha Pandit; Theoretical Computer Science;  volume 990; pages 114402. 2024.
     

2023

  • Deletion to Scattered Graph Classes I -- case of finite number of graph classes; with Ashwin Jacob, Jari J.H. D. Kroon, Venkatesh Raman; Journal of Computer and System Sciences (JCSS);  volume 138; pages 103460; 2023. (PDF)
     

  • Deletion to Scattered Graph Classes II -- Improved FPT Algorithms for Deletion to Pairs of Graph Classes; with Ashwin Jacob, Venkatesh Raman; Journal of Computer and System Sciences (JCSS); volume 136; pages 280-301; 2023 (Special Issue of FCT 2021). (PDF)
     

  • p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms; with Carl Einarson, Gregory Gutin, Bart M. P. Jansen, Magnus Wahlstrom; Journal of Computer and System Sciences (JCSS); volume 133; pages 23-40; 2023 (PDF).

​

2022

  • Valued Authorization Policy Existence Problem: Theory and Experiments; with Jason Crampton, Eduard Eiben, Gregory Gutin, Daniel Karapetyan; ACM Transactions on Privacy and Security (TOPS). volume 25(4), pages 1-31; 2022. (PDF)

​

2021

  • Towards Better Understanding of User Authorization Query Problem via Multi-variable Complexity Analysis; with Jason Crampton, Gregory Gutin; ACM Transactions on Privacy and Security (TOPS); volume 24(3), pages 1-22; 2021. (PDF)
     

  • Parameterized Pre-Coloring Extension and List Coloring Problems; with Gregory Gutin, Sebastian Ordinyak, Magnus Wahlstrom; SIAM Journal on Discrete Mathematics (SIDMA); volume 35(1), pages 575--596; 2021 (PDF)
     

  • Parameterized Complexity of Conflict-Free Set Cover; with Ashwin Jacob, Venkatesh Raman; Theory of Computing Systems (TOCS); volume 65(3), pages 515-540; 2021 (Special issue of CSR 2019).

 

2020

  • On the Approximate Compressibility of Connected Vertex Cover; with M. S. Ramanujan, Saket Saurabh; Algorithmica; volume 82, pages 2902–2926; 2020; arXiv: abs/1905.03379, 2019. (PDF)

 

2019

  • Tractability of Konig Edge Deletion Problems; with Rian Neogi, Venkatesh Raman, S. Vaishali; Theoretical Computer Science; volume 796, pages 207–215; 2019; arXiv: abs/1811.04560; 2018. (PDF)

 

2018

  • Kernelization of Cycle Packing with Relaxed Disjointness Constraints; with Akanksha Agrawal, Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh; SIAM Journal on Discrete Mathematics (SIDMA), volume 32(3), pages 1619-1643, 2018. (PDF)
     

  • Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators; with Venkatesh Raman, Saket Saurabh; Theory of Computing Systems (TOCS), volume 62(8), pages 1910-1951, 2018. (PDF)
     

  • Structural Parameterizations of Undirected Feedback Vertex Set: FPT Algorithms and Kernelization;

    with Venkatesh Raman; Algorithmica, volume 80(9), pages 2683-2724, 2018. (PDF)
     

  • Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels; with R. Krithika, Venkatesh Raman; Theory of Computing Systems (TOCS), volume 62(8), pages 1690-1714, 2018; arXiv:1711.07872, 2017. (PDF)

bottom of page