Saket Saurabh

University of Bergen — Norway

Computer Science · Physical Sciences

45h-index10.6kcitations767works0.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(591), Complexity and Algorithms in Graphs(436), Graph Labeling and Dimension Problems(113), Optimization and Search Problems(110), Limits and Structures in Graph Theory(92)

Publications767 total

The Sparsification Lemma via Measure and Conquer
Society for Industrial and Applied Mathematics eBooks·2026
Subset Feedback Vertex Set Parameterized by Multiway Cut is FPT
Lecture notes in computer science·2026
Chromatic Index Under Parameterized Settings
Lecture notes in computer science·2026
Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
Society for Industrial and Applied Mathematics eBooks·2026
The parameterized complexity landscape of two-sets cut-uncut
Theoretical Computer Science·2025Open Access
When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices
Journal of Combinatorial Theory Series B·2025
On the structural parameterized complexity of defective coloring
Journal of Computer and System Sciences·2025
Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
arXiv (Cornell University)·2025Open Access
Max-SAT with cardinality constraint parameterized by the number of clauses
Theoretical Computer Science·2025
Packing Short Cycles
ACM Transactions on Algorithms·2025Open Access
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
2025
Parameterized Approximation Schemes for Biclique-Free Max <i>k</i> -Weight SAT and Max Coverage
ACM Transactions on Algorithms·2025Open Access
Subexponential Parameterized Algorithms for Hitting Subgraphs
2025
Efficiently Finding and Counting Patterns with Distance Constraints in Sparse Graphs
2025
Hybrid k-Clustering: Blending k-Median and k-Center
ACM Transactions on Computation Theory·2025Open Access
Burn and win
Theoretical Computer Science·2025
Further parameterized results on weak Grundy coloring
Theoretical Computer Science·2025
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
arXiv (Cornell University)·2025Open Access
An Exponential Time Parameterized Algorithm for Planar Disjoint Paths
SIAM Journal on Computing·2025
Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
arXiv (Cornell University)·2025Open Access
page 1 of 39Next →

Frequent Co-authors

Daniel Lokshtanov(36), Fedor V. Fomin(25), Venkatesh Raman(10), Neeldhara Misra(7), Dániel Marx(6), Marek Cygan(4), M. S. Ramanujan(4), Dimitrios M. Thilikos(4), Michael R. Fellows(4), Frances Rosamond(4), Yngve Villanger(4), Michał Pilipczuk(3), Michael Dom(3), Fahad Panolan(3), Serge Gaspers(3), Łukasz Kowalik(2), Marcin Pilipczuk(2), N. S. Narayanaswamy(2), Meirav Zehavi(2), Hans L. Bodlaender(2)