scientific article
From MaRDI portal
Publication:2721971
zbMath0966.68224MaRDI QIDQ2721971
Henning Fernau, Rolf Niedermeier, Jochen Alber, Hans L. Bodlaender
Publication date: 11 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On the existence of subexponential parameterized algorithms, Graph separators: A parameterized view, Reachability problems in interval-constrained and cardinality-constrained graphs, How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms, An exact algorithm for connected red-blue dominating set, Subexponential parameterized algorithms, Confronting intractability via parameters, A linear kernel for planar red-blue dominating set, Dynamic programming and planarity: improved tree-decomposition based algorithms
