scientific article; zbMATH DE number 1304341
From MaRDI portal
Publication:4251072
zbMath0921.05046MaRDI QIDQ4251072
Rolf Niedermeier, Peter Rossmanith
Publication date: 24 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, Solving large FPT problems on coarse-grained parallel machines, On the existence of subexponential parameterized algorithms, Graph separators: A parameterized view, Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms, Refined memorization for vertex cover, Maximum Minimal Vertex Cover Parameterized by Vertex Cover, The Impact of Parameterized Complexity to Interdisciplinary Problem Solving, Strong computational lower bounds via parameterized complexity, A multivariate framework for weighted FPT algorithms, An efficient fixed-parameter algorithm for 3-hitting set, Maximum Minimal Vertex Cover Parameterized by Vertex Cover, A novel parameterised approximation algorithm for \textsc{minimum vertex cover}, On the parameterized vertex cover problem for graphs with perfect matching, Solving larger maximum clique problems using parallel quantum annealing, Confronting intractability via parameters, Enumerate and expand: Improved algorithms for connected vertex cover and tree cover, The complexity of irredundant sets parameterized by size, Improved upper bounds for vertex cover, On two techniques of combining branching and treewidth, On parameterized exponential time complexity, Rank Vertex Cover as a Natural Problem for Algebraic Compression, A refined search tree technique for dominating set on planar graphs, Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover, Parameterized computation and complexity: a new approach dealing with NP-hardness, A general method to speed up fixed-parameter-tractable algorithms
