Roohani Sharma

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 73

Top Topics

Parameterized Complexity

Top Venues

Publications

Eun Jung Kim, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
On Weighted Graph Separation Problems and Flow Augmentation. SIAM J. Discret. Math. 38 (1) (2024)
Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Pawel Rzazewski, Saket Saurabh, Roohani Sharma
-free Graphs in Polynomial Time. CoRR (2024)
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
Eliminating Crossings in Ordered Graphs. SWAT (2024)
P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
Balanced Substructures in Bicolored Graphs. CoRR (2024)
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Problems in NP Can Admit Double-Exponential Lower Bounds When Parameterized by Treewidth or Vertex Cover. ICALP (2024)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. SODA (2024)
Akanksha Agrawal, Sergio Cabello, Michael Kaufmann, Saket Saurabh, Roohani Sharma, Yushi Uno, Alexander Wolff
Eliminating Crossings in Ordered Graphs. CoRR (2024)
Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: A Complete Classification. ICALP (2024)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. Algorithmica 86 (5) (2024)
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension and Geodetic Set Parameterized by Vertex Cover. CoRR (2024)
Akanksha Agrawal, Paloma T. Lima, Daniel Lokshtanov, Saket Saurabh, Roohani Sharma
-free Graphs in Quasi-polynomial Time. SODA (2024)
Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki
Hitting Meets Packing: How Hard Can it Be? CoRR (2024)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. ICALP (2024)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized complexity of multicut in weighted trees. Theor. Comput. Sci. 978 (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR (2023)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation Schemes for Clustering with General Norm Objectives. CoRR (2023)
Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma
Treedepth vs Circumference. Comb. 43 (4) (2023)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces. CoRR (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
Parameterized Complexity Classification for Interval Constraints. IPEC (2023)
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. SIAM J. Discret. Math. 37 (4) (2023)
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
Open Problems in (Hyper)Graph Decomposition. CoRR (2023)
Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Tight (Double) Exponential Bounds for NP-Complete Problems: Treewidth and Vertex Cover Parameterizations. CoRR (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Approximate Monotone Local Search for Weighted Problems. IPEC (2023)
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA (2023)
P. S. Ardra, R. Krithika, Saket Saurabh, Roohani Sharma
Balanced Substructures in Bicolored Graphs. SOFSEM (2023)
R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. FSTTCS (2023)
Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase
Parameterized Approximation Schemes for Clustering with General Norm Objectives. FOCS (2023)
Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, Roohani Sharma
Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. IPEC (2023)
Lars Jaffke, Paloma T. Lima, Roohani Sharma
Structural Parameterizations of b-Coloring. ISAAC (2023)
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma
Parameterized Complexity Classification for Interval Constraints. CoRR (2023)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Approximate Monotone Local Search for Weighted Problems. CoRR (2023)
Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica 85 (7) (2023)
R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. CoRR (2023)
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
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13 (8) (2023)
Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma
Treedepth vs circumference. CoRR (2022)
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. MFCS (2022)
Lars Jaffke, Paloma T. Lima, Roohani Sharma
b-Coloring Parameterized by Pathwidth is XNLP-complete. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Weighted Multicut in Trees. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. CoRR (2022)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
Parameterized Complexity of Directed Spanner Problems. Algorithmica 84 (8) (2022)
Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. CoRR (2022)
R. Krithika, Roohani Sharma, Prafullkumar Tale
The Complexity of Contracting Bipartite Graphs into Small Cycles. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Parameterized Complexity of Weighted Multicut in Trees. WG (2022)
Eun Jung Kim, Marcin Pilipczuk, Roohani Sharma, Magnus Wahlström
On weighted graph separation problems and flow-augmentation. CoRR (2022)
R. Krithika, Roohani Sharma, Prafullkumar Tale
The Complexity of Contracting Bipartite Graphs into Small Cycles. WG (2022)
Esther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. CoRR (2022)
Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx, Roohani Sharma
Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification. CoRR (2022)
Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. IPEC (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA (2022)
Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma
Circumventing Connectivity for Kernelization. CIAC (2021)
Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi
A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. Algorithmica 83 (6) (2021)
Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. MFCS (2020)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. ACM Trans. Algorithms 16 (3) (2020)
William Lochet, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Fault Tolerant Subgraphs with Applications in Kernelization. ITCS (2020)
Pranabendu Misra, Fahad Panolan, Ashutosh Rai, Saket Saurabh, Roohani Sharma
Quick Separation in Chordal and Split Graphs. MFCS (2020)
Rian Neogi, M. S. Ramanujan, Saket Saurabh, Roohani Sharma
On the Parameterized Complexity of Deletion to H-free Strong Components. CoRR (2020)
Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, Roohani Sharma
Parameterized Complexity of Directed Spanner Problems. IPEC (2020)
Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Balanced Judicious Bipartition is Fixed-Parameter Tractable. SIAM J. Discret. Math. 33 (4) (2019)
Jayakrishnan Madathil, Roohani Sharma, Meirav Zehavi
A Sub-Exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. MFCS (2019)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. WADS (2019)
Pallavi Jain, Lawqueen Kanesh, William Lochet, Saket Saurabh, Roohani Sharma
Exact and Approximate Digraph Bandwidth. FSTTCS (2019)
Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. FSTTCS (2018)
Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Parameterised Algorithms for Deletion to Classes of DAGs. Theory Comput. Syst. 62 (8) (2018)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA (2018)
Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Kernels for deletion to classes of acyclic digraphs. J. Comput. Syst. Sci. 92 (2018)
Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ICALP (2018)
Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Balanced Judicious Bipartition is Fixed-Parameter Tractable. FSTTCS (2017)
Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. CoRR (2017)
Daniel Lokshtanov, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Balanced Judicious Partition is Fixed-Parameter Tractable. CoRR (2017)
Akanksha Agrawal, Sudeshna Kolay, Saket Saurabh, Roohani Sharma
Kernelizing Buttons and Scissors. CCCG (2016)
Akanksha Agrawal, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Kernels for Deletion to Classes of Acyclic Digraphs. ISAAC (2016)
Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, Roohani Sharma
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. IPEC (2016)
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma
Product Dimension of Forests and Bounded Treewidth Graphs. Electron. J. Comb. 20 (3) (2013)
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma
Product Dimension of Forests and Bounded Treewidth Graphs CoRR (2012)