scientific article; zbMATH DE number 2090012
From MaRDI portal
zbMath1077.68658MaRDI QIDQ4808679
Publication date: 12 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2387/23870564.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, Paradigms for parameterized enumeration, Extension of some edge graph problems: standard, parameterized and approximation complexity, Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations, Vertex cover problem parameterized above and below tight bounds, Invited talks, Constraint bipartite vertex cover: simpler exact algorithms and implementations, Randomised enumeration of small witnesses using a decision oracle, Enumerate and expand: Improved algorithms for connected vertex cover and tree cover, Refined notions of parameterized enumeration kernels with applications to matching cut enumeration, Crown reductions for the minimum weighted vertex cover problem, Fixed-parameter enumerability of cluster editing and related problems, Complexity of independency and cliquy trees, Parameterized Enumeration for Modification Problems, On the complexity of solution extension of optimization problems, The union of minimal hitting sets: parameterized combinatorial bounds and counting, Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT
