scientific article; zbMATH DE number 1953101

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Simpler Linear-Time Kernelization for Planar Dominating Set, Approximate tree decompositions of planar graphs in linear time, Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms, Approximate min-max relations on plane graphs, On line graphs of subcubic triangle-free graphs, Unnamed Item, Recent techniques and results on the Erdős-Pósa property, Deterministic Algorithms for the Independent Feedback Vertex Set Problem, A Linear Kernel for Planar Feedback Vertex Set, A note on disjoint cycles, Planarizing graphs and their drawings by vertex splitting, Kernel bounds for disjoint cycles and disjoint paths, The decycling number of outerplanar graphs, Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, Confronting intractability via parameters, On the parameterized complexity of computing balanced partitions in graphs, Jones' conjecture in subcubic graphs, Linearity of grid minors in treewidth with applications through bidimensionality, A linear kernel for planar red-blue dominating set, An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\), Approximability of the independent feedback vertex set problem for bipartite graphs, Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms, Improved bottleneck domination algorithms, The role of planarity in connectivity problems parameterized by treewidth, Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction, Unnamed Item, A linear-time kernelization for the rooted \(k\)-leaf outbranching problem