Publication:4808679
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
68Q25: Analysis of algorithms and problem complexity
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
Related Items
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, Parameterized enumeration, transversals, and imperfect phylogeny reconstruction, Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, Enumerate and expand: Improved algorithms for connected vertex cover and tree cover, Fixed-parameter enumerability of cluster editing and related problems, The union of minimal hitting sets: parameterized combinatorial bounds and counting, Randomised enumeration of small witnesses using a decision oracle, On the complexity of solution extension of optimization problems, Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT, Refined notions of parameterized enumeration kernels with applications to matching cut enumeration, Complexity of independency and cliquy trees, Paradigms for parameterized enumeration, Crown reductions for the minimum weighted vertex cover problem, Invited talks, Parameterized Enumeration for Modification Problems, Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
