Searching for authors named "Saket Saurabh" – sorted by Relevance.
17 documents found, showing 1 through 10.
Next 10 →
-
Clique-width: On the Price of Generality ∗
- … Saket Saurabh Department of Informatics, University of Bergen, N-5020 Bergen, Norway {fedor.fomin|petr.golovach|daniello|saket.saurabh…
- Add To MetaCart
-
Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica
- … Cycles ⋆ Venkatesh Raman and Saket Saurabh The Institute of Mathematical Sciences, Chennai 600 113…
- Cited by 2 (1 self) – Add To MetaCart
-
Parameterized algorithms for feedback set problems and their duals in tournaments
- … Venkatesh Raman ∗ , Saket Saurabh The Institute of Mathematical Sciences, Chennai-600 113, India…
- Cited by 7 (2 self) – Add To MetaCart
-
Fast exponential algorithms for maximum -regular induced subgraph problems
- … , Venkatesh Raman 2 , and Saket Saurabh 2 1 Department of Computer Science, Simon Fraser University, Canada…
- Cited by 2 (0 self) – Add To MetaCart
-
Faster fixed parameter tractable algorithms for undirected feedback vertex set
- …, SAKET SAURABH, AND C. R. SUBRAMANIAN The Institute of Mathematical Sciences Abstract. A feedback vertex…
- Cited by 8 (1 self) – Add To MetaCart
-
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
- …, SAKET SAURABH, SOMNATH SIKDAR The Institute of Mathematical Sciences, Taramani, Chennai 600113. {vraman|saket…
- Cited by 1 (0 self) – Add To MetaCart
-
Fast FAST
- …Fast FAST Noga Alon 1⋆ Daniel Lokshtanov 2 Saket Saurabh 2 1 Tel Aviv University, Tel Aviv 69978…
- Add To MetaCart
-
Capacitated domination and covering: A parameterized perspective
- … † Saket Saurabh † Yngve Villanger † Abstract Capacitated versions of Dominating Set and Vertex Cover have…
- Cited by 4 (4 self) – Add To MetaCart
-
Incompressibility through Colors and IDs
- …Incompressibilitythrough Colorsand IDs Michael Dom ∗ Daniel Lokshtanov † Saket Saurabh † Abstract…
- Add To MetaCart
-
Branching and treewidth based exact algorithms
- …Branching and Treewidth Based Exact Algorithms � Fedor V. Fomin 1 , Serge Gaspers 1 , and Saket…
- Cited by 4 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
