Skip to content
GraphTheory.in

Saket Saurabh

Institute of Mathematical SciencesIN
ORCID0000-0001-7847-6402
Claim this profile
h-index
45

via OpenAlex

Citations
10,773

via OpenAlex

Publications
20

About

Saket Saurabh is a researcher affiliated with the Institute of Mathematical Sciences. With over 20 publications between 2011 and 2026, his work focuses on parameterized complexity and its applications to graph theory and network optimisation.

Research areas

  • Combinatorics
  • Computer science
  • Mathematics
  • Graph
  • Discrete mathematics

Publications (20)

Sorted by most cited.

  1. Bidimensionality and EPTAS

    2011

    View DOI
    2 cites

  2. Balanced substructures in bicolored graphs

    Theoretical Computer Science2026journal article

    View DOI
    0 cites

  3. The parameterized complexity landscape of two-sets cut-uncut

    Theoretical Computer Science2026journal article

    View DOI
    0 cites

  4. Packing Short Cycles

    ACM Transactions on Algorithms2026journal article

    View DOI
    0 cites

  5. Parameterized Approximation Schemes for Biclique-Free Max k -Weight SAT and Max Coverage

    ACM Transactions on Algorithms2026journal article

    View DOI
    0 cites

  6. Chromatic Index Under Parameterized Settings

    2026

    View DOI
    0 cites

  7. Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization

    2026

    View DOI
    0 cites

  8. Hybrid k-Clustering: Blending k-Median and k-Center

    ACM Transactions on Computation Theory2025journal article

    View DOI
    0 cites

  9. Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs

    2025conference paper

    View DOI
    0 cites

  10. Subexponential Parameterized Algorithms for Hitting Subgraphs

    2025conference paper

    View DOI
    0 cites

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

    ACM Transactions on Algorithms2025journal article

    View DOI
    0 cites

  12. Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for Directed Feedback Vertex Set

    ACM Transactions on Computation Theory2025journal article

    View DOI
    0 cites

  13. True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs

    ACM Transactions on Algorithms2024journal article

    View DOI
    0 cites

  14. Polynomial Kernel for Interval Vertex Deletion

    ACM Transactions on Algorithms2023journal article

    View DOI
    0 cites

  15. Erdős–Pósa property of obstructions to interval graphs

    Journal of Graph Theory2023journal article

    View DOI
    0 cites

  16. Approximation in (Poly-) Logarithmic Space

    Algorithmica2021journal article

    View DOI
    0 cites

  17. Parameterized Complexity of Geometric Covering Problems Having Conflicts

    Algorithmica2020journal article

    View DOI
    0 cites

  18. Parameterized Algorithms for Locally Minimal Defensive Alliance

    1970book chapter

    View DOI
    0 cites

  19. Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT

    1970book chapter

    View DOI
    0 cites

  20. Parameterized Complexity of Disconnected Matchings

    1970book chapter

    View DOI
    0 cites