scientific article; zbMATH DE number 7051252

zbMath1421.68125MaRDI QIDQ4633895

Daniel Lokshtanov, Petr A. Golovach, Saket Saurabh, Fedor V. Fomin

Publication date: 6 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=1496860

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (21)

Iterated Type Partitions ⋮ Parameterized edge Hamiltonicity ⋮ Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking ⋮ On the minimum cycle cover problem on graphs with bounded co-degeneracy ⋮ On the computational difficulty of the terminal connection problem ⋮ Optimizing concurrency under Scheduling by Edge Reversal ⋮ Parameterized complexity for iterated type partitions and modular-width ⋮ Spanning trees with few branch vertices in graphs of bounded neighborhood diversity ⋮ Methods for determining cycles of a specific length in undirected graphs with edge weights ⋮ Directed NLC-width ⋮ Confronting intractability via parameters ⋮ Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity ⋮ Oriented coloring on recursively defined digraphs ⋮ \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth ⋮ Parameterized shifted combinatorial optimization ⋮ Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. ⋮ Algorithmic Applications of Tree-Cut Width ⋮ Efficient parallel algorithms for parameterized problems ⋮ Planar Capacitated Dominating Set Is W[1-Hard] ⋮ On Digraph Width Measures in Parameterized Algorithmics ⋮ An extension of the bivariate chromatic polynomial

This page was built for publication: