Publication:5417642
From MaRDI portal
zbMath1288.05269MaRDI QIDQ5417642
Fedor V. Fomin, Saket Saurabh, Daniel Lokshtanov, Petr A. Golovach
Publication date: 22 May 2014
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
68W25: Approximation algorithms
Related Items
Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity, Grundy Distinguishes Treewidth from Pathwidth, Unnamed Item, On the minimum cycle cover problem on graphs with bounded co-degeneracy, A parameterized approximation algorithm for the multiple allocation \(k\)-hub center, Between treewidth and clique-width, Tight complexity bounds for FPT subgraph problems parameterized by the clique-width, Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking, The complexity of finding uniform sparsest cuts in various graph classes, Paths of bounded length and their cuts: parameterized complexity and algorithms, Confronting intractability via parameters, On the parameterized complexity of computing balanced partitions in graphs, A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs, On the complexity of some colorful problems parameterized by treewidth, On structural parameterizations of load coloring, Directed NLC-width, Algorithmic aspects of switch cographs, 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, Digraph width measures in parameterized algorithmics, Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width, What’s Next? Future Directions in Parameterized Complexity, Between Treewidth and Clique-Width, On Structural Parameterizations of Graph Motif and Chromatic Number, Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width, Kernelization: New Upper and Lower Bound Techniques
