scientific article; zbMATH DE number 6783430
From MaRDI portal
zbMath1377.68324MaRDI QIDQ5365078
Daniel Lokshtanov, Saket Saurabh, Venkatesh Raman, Fedor V. Fomin
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133095
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths, A Retrospective on (Meta) Kernelization, Contraction bidimensionality of geometric intersection graphs, Hitting Weighted Even Cycles in Planar Graphs, Complexity of metric dimension on planar graphs, Graph Minors and Parameterized Algorithm Design, Unnamed Item, Domination chain: characterisation, classical complexity, parameterised complexity and approximability, On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability, Data reduction for graph coloring problems, Improved (In-)Approximability Bounds for d-Scattered Set, Computing connected-\(k\)-subgraph cover with connectivity requirement, Local search is a PTAS for feedback vertex set in minor-free graphs, An FPT 2-approximation for tree-cut decomposition, Unnamed Item, Maximum Cut Parameterized by Crossing Number, Tight bounds for parameterized complexity of cluster editing with a small number of clusters, Explicit linear kernels for packing problems, Contraction obstructions for treewidth, Unnamed Item, Bidimensionality and Kernels, Structurally parameterized \(d\)-scattered set, Packing Cycles Faster Than Erdos--Posa, Contraction-Bidimensionality of Geometric Intersection Graphs, An improved approximation bound for minimum weight dominating set on graphs of bounded arboricity, Finding, hitting and packing cycles in subexponential time on unit disk graphs, Unnamed Item
