scientific article; zbMATH DE number 7378346
From MaRDI portal
Publication:5005129
DOI10.4230/LIPIcs.MFCS.2018.29MaRDI QIDQ5005129
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1709.09985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- Linear time solvable optimization problems on graphs of bounded clique-width
- Computing and combinatorics. 13th annual international conference, COCOON 2007, Banff, Canada, July 16--19, 2007. Proceedings.
- Fundamentals of computation theory. 21st international symposium, FCT 2017, Bordeaux, France, September 11--13, 2017. Proceedings
- Grad and classes with bounded expansion. I: Decompositions
- Grad and classes with bounded expansion. II: Algorithmic aspects
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- Approximating clique-width and branch-width
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
- Domination Problems in Nowhere-Dense Classes
- Linear time low tree-width partitions and algorithmic consequences
- Deciding first-order properties of locally tree-decomposable structures
- FO Model Checking of Interval Graphs
- Deciding First-Order Properties of Nowhere Dense Graphs
- First-Order Interpretations of Bounded Expansion Classes
- Testing first-order properties for subclasses of sparse graphs
This page was built for publication:
