Product Dimension of Forests and Bounded Treewidth Graphs. - L. Sunil Chandran; Rogers Mathew; Deepak Rajendraprasad; Roohani Sharma (Electron. J. Comb., 2013)

Kernelizing Buttons and Scissors. - Akanksha Agrawal 001; Sudeshna Kolay; Saket Saurabh 001; Roohani Sharma (CCCG, 2016)

Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. - Akanksha Agrawal 001; Sushmita Gupta; Saket Saurabh 001; Roohani Sharma (IPEC, 2016)

Balanced Judicious Partition is Fixed-Parameter Tractable. - Daniel Lokshtanov; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (CoRR, 2017)

Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ICALP, 2018)

Kernels for deletion to classes of acyclic digraphs. - Akanksha Agrawal 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (J. Comput. Syst. Sci., 2018)

Parameterised Algorithms for Deletion to Classes of DAGs. - Akanksha Agrawal 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (Theory Comput. Syst., 2018)

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. - Daniel Lokshtanov; M. S. Ramanujan 001; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (WADS, 2019)

Balanced Judicious Bipartition is Fixed-Parameter Tractable. - Daniel Lokshtanov; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (SIAM J. Discret. Math., 2019)

Fault Tolerant Subgraphs with Applications in Kernelization. - William Lochet; Daniel Lokshtanov; Pranabendu Misra; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ITCS, 2020)

Quick Separation in Chordal and Split Graphs. - Pranabendu Misra; Fahad Panolan; Ashutosh Rai 001; Saket Saurabh 001; Roohani Sharma (MFCS, 2020)

On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. - Rian Neogi; M. S. Ramanujan 001; Saket Saurabh 001; Roohani Sharma (MFCS, 2020)

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ACM Trans. Algorithms, 2020)

Circumventing Connectivity for Kernelization. - Pallavi Jain 001; Lawqueen Kanesh; Shivesh Kumar Roy; Saket Saurabh 001; Roohani Sharma (CIAC, 2021)

A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. - Jayakrishnan Madathil; Roohani Sharma; Meirav Zehavi (Algorithmica, 2021)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (ESA, 2022)

Parameterized Complexity of Weighted Multicut in Trees. - Esther Galby; Dániel Marx; Philipp Schepper; Roohani Sharma; Prafullkumar Tale (WG, 2022)

The Complexity of Contracting Bipartite Graphs into Small Cycles. - R. Krithika 001; Roohani Sharma; Prafullkumar Tale (WG, 2022)

Parameterized Complexity of Directed Spanner Problems. - Fedor V. Fomin; Petr A. Golovach; William Lochet; Pranabendu Misra; Saket Saurabh 001; Roohani Sharma (Algorithmica, 2022)

On weighted graph separation problems and flow-augmentation. - Eun Jung Kim 002; Marcin Pilipczuk; Roohani Sharma; Magnus Wahlström (CoRR, 2022)

b-Coloring Parameterized by Pathwidth is XNLP-complete. - Lars Jaffke; Paloma T. Lima; Roohani Sharma (CoRR, 2022)

Parameterized Approximation Schemes for Clustering with General Norm Objectives. - Fateme Abbasi; Sandip Banerjee; Jaroslaw Byrka; Parinya Chalermsook; Ameet Gadekar; Kamyar Khodamoradi; Dániel Marx; Roohani Sharma; Joachim Spoerhase (FOCS, 2023)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. - R. Krithika 001; V. K. Kutty Malu; Roohani Sharma; Prafullkumar Tale (FSTTCS, 2023)

Structural Parameterizations of b-Coloring. - Lars Jaffke; Paloma T. Lima; Roohani Sharma (ISAAC, 2023)

Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. - Sriram Bhyravarapu; Satyabrata Jana; Saket Saurabh 001; Roohani Sharma (IPEC, 2023)

Parameterized Complexity Classification for Interval Constraints. - Konrad K. Dabrowski; Peter Jonsson; Sebastian Ordyniak; George Osipov; Marcin Pilipczuk; Roohani Sharma (IPEC, 2023)

Approximate Monotone Local Search for Weighted Problems. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (IPEC, 2023)

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; Tomás Masarík; Marcin Pilipczuk; Roohani Sharma; Manuel Sorge (SODA, 2023)

Balanced Substructures in Bicolored Graphs. - P. S. Ardra; R. Krithika 001; Saket Saurabh 001; Roohani Sharma (SOFSEM, 2023)

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (CoRR, 2023)

Open Problems in (Hyper)Graph Decomposition. - Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; Tobias Heuer; George Karypis; Kamer Kaya; et al. (CoRR, 2023)

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). - George Karypis; Christian Schulz 003; Darren Strash; Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; et al. (Dagstuhl Reports, 2023)

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. - Pranabendu Misra; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (Algorithmica, 2023)

Treedepth vs Circumference. - Marcin Brianski; Gwenaël Joret; Konrad Majewski; Piotr Micek; Michal T. Seweryn; Roohani Sharma (Comb., 2023)

Parameterized complexity of multicut in weighted trees. - Esther Galby; Dániel Marx; Philipp Schepper; Roohani Sharma; Prafullkumar Tale (Theor. Comput. Sci., 2023)

Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. - Esther Galby; Liana Khazaliya; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (SIAM J. Discret. Math., 2023)

Hitting Meets Packing: How Hard Can It Be? - Jacob Focke; Fabian Frei; Shaohua Li 005; Dániel Marx; Philipp Schepper; Roohani Sharma; Karol Wegrzycki (ESA, 2024)

Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. - Fateme Abbasi; Sandip Banerjee; Jaroslaw Byrka; Parinya Chalermsook; Ameet Gadekar; Kamyar Khodamoradi; Dániel Marx; Roohani Sharma; Joachim Spoerhase (ICALP, 2024)

Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (ICALP, 2024)

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. - Esther Galby; Sándor Kisfaludi-Bak; Dániel Marx; Roohani Sharma (ICALP, 2024)

Uniform Polynomial Kernel for Deletion to K_{2, p} Minor-Free Graphs. - William Lochet; Roohani Sharma (ISAAC, 2024)

Component Order Connectivity Admits No Polynomial Kernel Parameterized by the Distance to Subdivided Comb Graphs. - Jakob Greilhuber; Roohani Sharma (IPEC, 2024)

Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Saket Saurabh 001; Roohani Sharma (SODA, 2024)

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Daniel Neuen; Roohani Sharma (SODA, 2024)

Eliminating Crossings in Ordered Graphs. - Akanksha Agrawal 001; Sergio Cabello; Michael Kaufmann 001; Saket Saurabh 001; Roohani Sharma; Yushi Uno; Alexander Wolff 001 (SWAT, 2024)

Odd Cycle Transversal on P5-free Graphs in Polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma (CoRR, 2024)

Maximum Partial List H-Coloring on P5-free graphs in polynomial time. - Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (CoRR, 2024)

New Tools in Parameterized Complexity: Paths, Cuts, and Decomposition (Dagstuhl Seminar 24411). - Fedor V. Fomin; Dániel Marx; Saket Saurabh 001; Roohani Sharma; Madhumita Kundu (Dagstuhl Reports, 2024)

On the Parameterized Complexity of Deletion to ( boldsymbol{ mathcal{H}} )-Free Strong Components. - Rian Neogi; M. S. Ramanujan 001; Saket Saurabh 001; Roohani Sharma (SIAM J. Discret. Math., 2024)

On Weighted Graph Separation Problems and Flow Augmentation. - Eun Jung Kim 002; Tomás Masarík; Marcin Pilipczuk; Roohani Sharma; Magnus Wahlström (SIAM J. Discret. Math., 2024)

Domination and Cut Problems on Chordal Graphs with Bounded Leafage. - Esther Galby; Dániel Marx; Philipp Schepper; Roohani Sharma; Prafullkumar Tale (Algorithmica, 2024)

Crossing Number in Slightly Superexponential Time (Extended Abstract). - Daniel Lokshtanov; Fahad Panolan; Saket Saurabh 001; Roohani Sharma; Jie Xue 003; Meirav Zehavi (SODA, 2025)

Metric Dimension and Geodetic Set Parameterized by Vertex Cover. - Florent Foucaud; Esther Galby; Liana Khazaliya; Shaohua Li 005; Fionn Mc Inerney; Roohani Sharma; Prafullkumar Tale (STACS, 2025)

MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. - Ajinkya Gaikwad; Hitendra Kumar; Soumen Maity; Saket Saurabh 001; Roohani Sharma (STACS, 2025)

Odd Cycle Transversal on P5-free Graphs in Polynomial Time. - Akanksha Agrawal 001; Paloma T. Lima; Daniel Lokshtanov; Pawel Rzazewski; Saket Saurabh 001; Roohani Sharma (ACM Trans. Algorithms, 2025)

MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal. - Ajinkya Gaikwad; Hitendra Kumar; Soumen Maity; Saket Saurabh 001; Roohani Sharma (CoRR, 2025)

Exact and Approximate Digraph Bandwidth. - Pallavi Jain 001; Lawqueen Kanesh; William Lochet; Saket Saurabh 001; Roohani Sharma (Theory Comput. Syst., 2025)

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set. - Daniel Lokshtanov; Ramanujan Maadapuzhi Sridharan; Saket Saurabh 001; Roohani Sharma; Meirav Zehavi (ACM Trans. Comput. Theory, 2025)