SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257zbMath1175.68294OpenAlexW2756057450MaRDI QIDQ5897992

Johannes Uhlmann, Rolf Niedermeier, Erhan Kenar, Jiong Guo, Falk Hüffner

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11611257

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Parameterized complexity dichotomy for \textsc{Steiner Multicut} ⋮ A logical approach to multicut problems ⋮ Performing Multicut on Walkable Environments ⋮ Multicut Is FPT ⋮ On the complexity of the multicut problem in bounded tree-width graphs and digraphs ⋮ Solution methods for the vertex variant of the network system vulnerability analysis problem ⋮ Almost 2-SAT is fixed-parameter tractable