scientific article; zbMATH DE number 7559155
From MaRDI portal
Publication:5090497
DOI10.4230/LIPIcs.STACS.2019.46MaRDI QIDQ5090497
Sebastian Siebertz, Roman Rabinovich, Irene Muzi, De Mendez Patrice Ossona, Stephan Kreutzer
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Are there any good digraph width measures?
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
- Digraph measures: Kelly decompositions, games, and orderings
- On the parameterized complexity of multiple-interval graph problems
- Colouring graphs with bounded generalized colouring number
- Characterising bounded expansion by neighbourhood complexity
- Reconfiguration on nowhere dense graph classes
- Reconfiguration on sparse graphs
- Graph minors. XIII: The disjoint paths problem
- Almost optimal set covers in finite VC-dimension
- Constant-factor approximation of the domination number in sparse graphs
- Grad and classes with bounded expansion. I: Decompositions
- On nowhere dense graphs
- Interpreting nowhere dense graph classes as a classical notion of model theory
- Local tree-width, excluded minors, and approximation algorithms
- Directed path-width and monotonicity in digraph searching
- A combinatorial problem; stability and order for models and theories in infinitary languages
- On the density of families of sets
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Colouring and Covering Nowhere Dense Graphs
- Kernelization Using Structural Parameters on Sparse Graph Classes
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
- Domination Problems in Nowhere-Dense Classes
- Linear time low tree-width partitions and algorithmic consequences
- Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
- Enumeration of monadic second-order queries on trees
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
- Lossy Kernels for Connected Dominating Set on Sparse Graphs
- FPT Algorithms for Connected Feedback Vertex Set
- Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
- DAG-width
- Polynomial-time data reduction for dominating set
- On Digraph Width Measures in Parameterized Algorithmics
- Approximation algorithms for NP-complete problems on planar graphs
- Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs
- Kernelization and Sparseness: the case of Dominating Set
- Deciding First-Order Properties of Nowhere Dense Graphs
- First order properties on nowhere dense structures
- Reducibility among Combinatorial Problems
- Neighborhood complexity and kernelization for nowhere dense classes of graphs
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness
- (Meta) Kernelization
- On distance ‐dominating and ‐independent sets in sparse graphs
- Testing first-order properties for subclasses of sparse graphs
- Regularity lemmas for stable graphs
- Bidimensionality and Geometric Graphs
- DAG-Width and Parity Games
- Mathematical Foundations of Computer Science 2005
- Spectral Theory and Analysis
