Theoretical Computer Science
From MaRDI portal
Publication:5395087
DOI10.1007/11560586zbMath1171.68646OpenAlexW2603408665MaRDI QIDQ5395087
Venkatesh Raman, Somnath Sikdar, Saket Saurabh
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11560586
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal, Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG, New bounds for the signless Laplacian spread, On the minimum feedback vertex set problem: Exact and enumeration algorithms, Parameterized measure \& conquer for problems with no small kernels, Parameterized algorithms for \(d\)-hitting set: the weighted case, Enumerate and Measure: Improving Parameter Budget Management
