scientific article; zbMATH DE number 7561684
From MaRDI portal
Publication:5092402
DOI10.4230/LIPIcs.MFCS.2019.40MaRDI QIDQ5092402
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1906.09180
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Kernelization using structural parameters on sparse graph classes
- Sparsity. Graphs, structures, and algorithms
- Vertex cover problem parameterized above and below tight bounds
- Solving MAX-\(r\)-SAT above a tight lower bound
- A simplified NP-complete satisfiability problem
- Parameterizing above or below guaranteed values
- Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Betweenness parameterized above tight lower bound
- The linear arrangement problem parameterized above guaranteed value
- On Multiway Cut Parameterized above Lower Bounds
- Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
- Polynomial-time data reduction for dominating set
- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables
- Planar Formulae and Their Uses
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Kernelization and Sparseness: the case of Dominating Set
- Deciding First-Order Properties of Nowhere Dense Graphs
- Faster Parameterized Algorithms Using Linear Programming
- Neighborhood complexity and kernelization for nowhere dense classes of graphs
- Testing first-order properties for subclasses of sparse graphs
- Bidimensionality and Geometric Graphs
This page was built for publication:
