Roohani Sharma

From MaRDI portal
Person:396878

Available identifiers

zbMath Open sharma.roohaniMaRDI QIDQ396878

List of research outcomes





PublicationDate of PublicationType
On the parameterized complexity of deletion to \(\mathcal{H}\)-free strong components2024-12-18Paper
Optimally repurposing existing algorithms to obtain exponential-time approximations2024-11-28Paper
Odd cycle transversal on \(P_5\)-free graphs in quasi-polynomial time2024-11-28Paper
Metric dimension parameterized by feedback vertex set and other structural parameters2024-08-06Paper
Fixed-parameter tractability of \textsc{Directed Multicut} with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation2024-05-14Paper
Domination and Cut Problems on Chordal Graphs with Bounded Leafage2024-04-24Paper
Parameterized Complexity of Directed Spanner Problems.2023-11-13Paper
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters2023-10-13Paper
Parameterized complexity of multicut in weighted trees2023-10-12Paper
Treedepth vs circumference2023-10-04Paper
Balanced substructures in bicolored graphs2023-08-14Paper
Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number2023-06-28Paper
Parameterized complexity of weighted multicut in trees2023-05-05Paper
The complexity of contracting bipartite graphs into small cycles2023-05-05Paper
Circumventing connectivity for kernelization2023-03-22Paper
Exact and Approximate Digraph Bandwidth2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q58757482023-02-03Paper
Parameterized complexity of directed spanner problems2022-08-03Paper
https://portal.mardi4nfdi.de/entity/Q50923872022-07-21Paper
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50892492022-07-18Paper
Quick separation in chordal and split graphs2022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50027952021-07-28Paper
A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs2021-06-11Paper
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms2021-05-03Paper
Balanced Judicious Bipartition is Fixed-Parameter Tractable2020-11-25Paper
Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS2020-01-16Paper
Balanced Judicious Bipartition is Fixed-Parameter Tractable2019-10-28Paper
Parameterised algorithms for deletion to classes of DAGs2019-09-05Paper
Kernels for Deletion to Classes of Acyclic Digraphs.2018-04-19Paper
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set2018-04-10Paper
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms2018-03-15Paper
Kernels for deletion to classes of acyclic digraphs2017-11-14Paper
Product dimension of forests and bounded treewidth graphs2014-08-14Paper

Research outcomes over time

This page was built for person: Roohani Sharma