scientific article; zbMATH DE number 6297725

zbMath1288.05269MaRDI QIDQ5417642

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

Publication date: 22 May 2014

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (28)

Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width ⋮ On structural parameterizations of load coloring ⋮ Between treewidth and clique-width ⋮ What’s Next? Future Directions in Parameterized Complexity ⋮ Between Treewidth and Clique-Width ⋮ Tight complexity bounds for FPT subgraph problems parameterized by the clique-width ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking ⋮ On the minimum cycle cover problem on graphs with bounded co-degeneracy ⋮ A parameterized approximation algorithm for the multiple allocation \(k\)-hub center ⋮ On the complexity of some colorful problems parameterized by treewidth ⋮ Unnamed Item ⋮ Directed NLC-width ⋮ Algorithmic aspects of switch cographs ⋮ On Structural Parameterizations of Graph Motif and Chromatic Number ⋮ The complexity of finding uniform sparsest cuts in various graph classes ⋮ Digraph width measures in parameterized algorithmics ⋮ Paths of bounded length and their cuts: parameterized complexity and algorithms ⋮ Confronting intractability via parameters ⋮ Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity ⋮ On the parameterized complexity of computing balanced partitions in graphs ⋮ On structural parameterizations of load coloring ⋮ Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width ⋮ A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs ⋮ Fly-automata for checking \(\mathrm{MSO}_2\) graph properties ⋮ On the maximum cardinality cut problem in proper interval graphs and related graph classes ⋮ Efficient parallel algorithms for parameterized problems ⋮ Kernelization: New Upper and Lower Bound Techniques

This page was built for publication: