scientific article; zbMATH DE number 7559136
From MaRDI portal
Publication:5090476
DOI10.4230/LIPIcs.STACS.2019.27MaRDI QIDQ5090476
Michał Pilipczuk, Szymon Toruńczyk, Grzegorz Fabiański, Sebastian Siebertz
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1811.06799
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (7)
On the parameterized complexity of reconfiguration of connected dominating sets ⋮ Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs ⋮ Bounds on half graph orders in powers of sparse graphs ⋮ Clustering powers of sparse graphs ⋮ Unnamed Item ⋮ Lossy Kernels for Connected Dominating Set on Sparse Graphs ⋮ Constant round distributed domination on graph classes with bounded expansion
Cites Work
- Sparsity. Graphs, structures, and algorithms
- Classification theory and the number of non-isomorphic models.
- Polynomial bounds for centered colorings on proper minor-closed graph classes
- On nowhere dense graphs
- Interpreting nowhere dense graph classes as a classical notion of model theory
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Approximation Algorithms for Independent Sets in Map Graphs
- FPT Algorithms for Domination in Biclique-Free Graphs
- Domination Problems in Nowhere-Dense Classes
- Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
- Closed sets and chain conditions in stable theories
- Stable graphs
- Kernelization and Sparseness: the case of Dominating Set
- Deciding First-Order Properties of Nowhere Dense Graphs
- Quick k-Median, k-Center, and Facility Location for Sparse Graphs
- First order properties on nowhere dense structures
- Neighborhood complexity and kernelization for nowhere dense classes of graphs
- On the number of types in sparse graphs
- Testing first-order properties for subclasses of sparse graphs
This page was built for publication:
