| 2026 | ESA | Reducing CMSO to Unbreakable Graphs Cannot Be Computable. | Colin Geniet, Roohani Sharma |
| 2026 | ESA | Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-η Deletion. | Ahmed Ghazy, Jakob Greilhuber, Tim A. Hartmann, Roohani Sharma |
| 2026 | MFCS | A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth. | Jakob Greilhuber, Roohani Sharma |
| 2026 | STACS | Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors. | Roohani Sharma, Michal Wlodarczyk |
| 2025 | SODA | Crossing Number in Slightly Superexponential Time (Extended Abstract). | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Jie Xue, Meirav Zehavi |
| 2025 | STACS | Metric Dimension and Geodetic Set Parameterized by Vertex Cover. | Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2025 | STACS | MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. | Ajinkya Gaikwad, Hitendra Kumar, Soumen Maity, Saket Saurabh, Roohani Sharma |
| 2024 | ESA | Hitting Meets Packing: How Hard Can It Be? | Jacob Focke, Fabian Frei, Shaohua Li, Dniel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki |
| 2024 | ICALP | Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. | Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dniel Marx, Roohani Sharma, Joachim Spoerhase |
| 2024 | ICALP | Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. | Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2024 | ICALP | Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. | Esther Galby, Sndor Kisfaludi-Bak, Dniel Marx, Roohani Sharma |
| 2024 | ISAAC | Uniform Polynomial Kernel for Deletion to K_{2, p} Minor-Free Graphs. | William Lochet, Roohani Sharma |
| 2024 | SODA | Odd Cycle Transversal on | Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma |
| 2024 | SODA | Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. | Baris Can Esmer, Ariel Kulik, Dniel Marx, Daniel Neuen, Roohani Sharma |
| 2023 | FOCS | Parameterized Approximation Schemes for Clustering with General Norm Objectives. | Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dniel Marx, Roohani Sharma, Joachim Spoerhase |
| 2023 | ISAAC | Structural Parameterizations of b-Coloring. | Lars Jaffke, Paloma T. Lima, Roohani Sharma |
| 2023 | SODA | Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. | Meike Hatzel, Lars Jaffke, Paloma T. Lima, Toms Masark, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge |
| 2023 | SOFSEM | Balanced Substructures in Bicolored Graphs. | P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma |
| 2022 | ESA | Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. | Baris Can Esmer, Ariel Kulik, Dniel Marx, Daniel Neuen, Roohani Sharma |
| 2022 | MFCS | Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. | Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale |
| 2022 | WG | Parameterized Complexity of Weighted Multicut in Trees. | Esther Galby, Dniel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale |
| 2022 | WG | The Complexity of Contracting Bipartite Graphs into Small Cycles. | R. Krithika, Roohani Sharma, Prafullkumar Tale |
| 2021 | CIAC | Circumventing Connectivity for Kernelization. | Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma |
| 2020 | MFCS | Quick Separation in Chordal and Split Graphs. | Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma |
| 2020 | MFCS | On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. | Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma |
| 2019 | MFCS | A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. | Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi |
| 2019 | WADS | Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | ICALP | Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. | Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2018 | SODA | Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. | Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi |
| 2016 | ISAAC | Kernels for Deletion to Classes of Acyclic Digraphs. | Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi |