Publication:4414505
From MaRDI portal
zbMath1022.68100MaRDI QIDQ4414505
Chuan-Min Lee, Ton Kloks, Ji Ping Liu
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2573/25730282.htm
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Unnamed Item, Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms, Unnamed Item, Approximability of the independent feedback vertex set problem for bipartite graphs, Planarizing graphs and their drawings by vertex splitting, Approximate tree decompositions of planar graphs in linear time, Approximate min-max relations on plane graphs, A note on disjoint cycles, Confronting intractability via parameters, On the parameterized complexity of computing balanced partitions in graphs, A linear kernel for planar red-blue dominating set, Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms, Kernel bounds for disjoint cycles and disjoint paths, Linearity of grid minors in treewidth with applications through bidimensionality, Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction, An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\), The decycling number of outerplanar graphs, Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, Jones' conjecture in subcubic graphs, A linear-time kernelization for the rooted \(k\)-leaf outbranching problem, On line graphs of subcubic triangle-free graphs, Recent techniques and results on the Erdős-Pósa property, Improved bottleneck domination algorithms, The role of planarity in connectivity problems parameterized by treewidth, Simpler Linear-Time Kernelization for Planar Dominating Set, Deterministic Algorithms for the Independent Feedback Vertex Set Problem, A Linear Kernel for Planar Feedback Vertex Set
