MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal: to appear at STACS 2025, with Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh.
Metric Dimension and Geodetic Set Parameterized by Vertex Cover: to appear at STACS 2025, with Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Prafullkumar Tale. arxiv
Odd Cycle Transversal on P_5-free Graphs in Polynomial Time: to appear at TALG 2025, with Akanksha Agrawal, Paloma T. Lima, Paweł Rzążewski, Daniel Lokshtanov, Saket Saurabh. arxiv
Crossing Number in Slightly Superexponential Time: at SODA 2025, with Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, Meirav Zehavi.
Uniform Polynomial Kernel for Deletion to K_{2,p} Minor-Free Graphs: at ISAAC 2024, with William Lochet.
Component Order Connectivity admits no polynomial kernel parameterized by the feedback vertex set number: at IPEC 2024, with Jacob Greilhuber.
Hitting Meets Packing: How Hard Can it Be? at ESA 2024, with Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Karol Węgrzycki. arxiv
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces: at ICALP 2024, with Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Joachim Spoerhase. arxiv
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification: at ICALP 2024, with Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx. arxiv
Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth and Vertex Cover: at ICALP 2024, with Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Prafullkumar Tale. arxiv
Eliminating Crossings in Ordered Graphs: at SWAT 2024, with Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Yushi Uno, Alexander Wolff. arxiv
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations: at SODA 2024, with Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen. arxiv
Odd Cycle Transversal on P_5-free Graphs in Quasi-polynomial Time: at SODA 2024, with Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh. arxiv
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction: at FSTTCS 2023, with R. Krithika, V. K. Kutty Malu, Prafullkumar Tale. arxiv
On weighted graph separation problems and flow-augmentation: at SIDMA 2023, with Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Magnus Wahlström. arxiv
Structural Parameterizations of b-Coloring: at ISAAC 2023, with Lars Jaffke, Paloma T. Lima. arxiv
Parameterized Complexity Classification for Interval Constraints: at IPEC 2023, with Konrad Dabrowski, Peter Jonnson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk. arxiv
Approximate Monotone Local Search for Weighted Problems: at IPEC 2023, with Baris Can Esmer, Ariel Kulik, Daniel Marx, Daniel Neuen. arxiv
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity: at IPEC 2023, with Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh.
Parameterized Approximation Schemes for Clustering with General Norm Objectives: at FOCS 2023, with Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Joachim Spoerhase. arxiv
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation: at SODA 2023, with Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Manuel Sorge. Invited for a short presentation at HALG 2023. arxiv
Treedepth vs circumference: at Combinatorica 2023, with Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn. arxiv.
Balanced Substructures in Bicolored Graphs: at SOFSEM 2023, with P. S. Ardra, R. Krithika, Saket Saurabh. Best paper. arxiv.
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search: at ESA 2022, with Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen. Invited for a presentation at HALG 2023. arxiv
Domination and Cut Problems on Chordal Graphs with Bounded Leafage: at IPEC 2022 and invited to special issue of Algorithmica, with Esther Galby, Dániel Marx, Philipp Schepper, Prafullkumar Tale. arxiv
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters: at MFCS 2022 and SIDMA 2023, with Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Prafullkumar Tale. arxiv
Parameterized Complexity of Weighted Multicut in Trees: at WG 2022 and TCS 2023, with Esther Galby, Dániel Marx, Philipp Schepper, Prafullkumar Tale. arxiv
The Complexity of Contracting Bipartite Graphs into Small Cycles: at WG 2022, with R. Krithika, Prafullkumar Tale. arxiv
Circumventing Connectivity for Kernelization: at CIAC 2021, with Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh.
Fault Tolerant Subgraphs with Applications in Kernelization: at ITCS 2020, with William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi.
Parameterized Complexity of Directed Spanner Problems: at IPEC 2020 and invited to special issue of Algorithmica, with Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh. arxiv
Quick Separation in Chordal and Split Graphs: at MFCS 2020, with Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh.
On the Parameterized Complexity of Deletion to ℋ-Free Strong Components: at MFCS 2020 and SIDMA 2024, with Rian Neogi, M. S. Ramanujan, Saket Saurabh. arxiv
Exact and Approximate Digraph Bandwidth: at FSTTCS 2019 and to appear at TOCS 2025, with Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh.
A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs: at MFCS 2019 and Algorithmica 2021, with Jayakrishnan Madathil, Meirav Zehavi.
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS at WADS 2019 and to appear at TOCT 2025 /Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS at ICALP 2018, with Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi.
Parameterised Algorithms for Deletion to Classes of DAGs: at TOCS 2018, with Akanksha Agrawal, Saket Saurabh, Meirav Zehavi.
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number: at FSTTCS 2018 and Algorithmica 2023, with Pranabendu Misra, Saket Saurabh, Meirav Zehavi.
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms: at SODA 2018 and TALG 2020, with Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi. arxiv
Balanced Judicious Bipartition is Fixed-Parameter Tractable: at FSTTCS 2017 and SIDMA 2019, with Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi. arxiv
Kernelizing Buttons and Scissors: at CCCG 2016, with Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh.
Kernels for Deletion to Classes of Acyclic Digraphs: at ISAAC 2016 and JCSS 2018, with Akanksha Agrawal, Saket Saurabh, Meirav Zehavi.
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set: at IPEC 2016, with Akanksha Agrawal, Sushmita Gupta, Saket Saurabh.
Product Dimension of Forests and Bounded Treewidth Graphs: at the Electronic Journal of Combinatorics 2015, with L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad. arxiv
Maximum Partial List H-Coloring on P_5-free graphs: with Daniel Lokshtanov, Paweł Rzążewski, Saket Saurabh, Meirav Zehavi. arxiv