Roohani Sharma

According to our database, Roohani Sharma authored at least 45 papers between 2013 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Domination and Cut Problems on Chordal Graphs with Bounded Leafage.

Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale

Algorithmica, May, 2024

On Weighted Graph Separation Problems and Flow Augmentation.

Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström

SIAM J. Discret. Math., March, 2024

Hitting Meets Packing: How Hard Can it Be?

Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki

CoRR, 2024

Odd Cycle Transversal on P₅-free Graphs in Polynomial Time.

Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma

CoRR, 2024

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Odd Cycle Transversal on <i>P</i>₅-free Graphs in Quasi-polynomial Time.

Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

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., December, 2023

Parameterized complexity of multicut in weighted trees.

Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale

Theor. Comput. Sci., November, 2023

Treedepth vs Circumference.

Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma

Comb., August, 2023

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.

Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Algorithmica, July, 2023

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331).

George Karypis, Christian Schulz, 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, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman

Dagstuhl Reports, 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, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman

CoRR, 2023

Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations.

Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale

CoRR, 2023

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

CoRR, 2023

Balanced Substructures in Bicolored Graphs.

P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 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

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Approximate Monotone Local Search for Weighted Problems.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parameterized Complexity Classification for Interval Constraints.

Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity.

Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, Roohani Sharma

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Structural Parameterizations of b-Coloring.

Lars Jaffke, Paloma T. Lima, Roohani Sharma

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction.

R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

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

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

b-Coloring Parameterized by Pathwidth is XNLP-complete.

Lars Jaffke, Paloma T. Lima, Roohani Sharma

CoRR, 2022

On weighted graph separation problems and flow-augmentation.

Eun Jung Kim, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström

CoRR, 2022

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification.

Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma

CoRR, 2022

Parameterized Complexity of Directed Spanner Problems.

Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma

Algorithmica, 2022

The Complexity of Contracting Bipartite Graphs into Small Cycles.

R. Krithika, Roohani Sharma, Prafullkumar Tale

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Parameterized Complexity of Weighted Multicut in Trees.

Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

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

Circumventing Connectivity for Kernelization.

Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi

ACM Trans. Algorithms, 2020

On the Parameterized Complexity of Deletion to ℋ-Free Strong Components.

Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Quick Separation in Chordal and Split Graphs.

Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Fault Tolerant Subgraphs with Applications in Kernelization.

William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019

Balanced Judicious Bipartition is Fixed-Parameter Tractable.

Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi

SIAM J. Discret. Math., 2019

Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Exact and Approximate Digraph Bandwidth.

Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Parameterised Algorithms for Deletion to Classes of DAGs.

Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Theory Comput. Syst., 2018

Kernels for deletion to classes of acyclic digraphs.

Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi

J. Comput. Syst. Sci., 2018

Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Balanced Judicious Partition is Fixed-Parameter Tractable.

Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi

CoRR, 2017

2016

Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set.

Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Kernelizing Buttons and Scissors.

Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2013

Product Dimension of Forests and Bounded Treewidth Graphs.

L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma

Electron. J. Comb., 2013