scientific article; zbMATH DE number 7561677
From MaRDI portal
Publication:5092394
DOI10.4230/LIPIcs.MFCS.2019.33MaRDI QIDQ5092394
Tomáš Toufar, Tomáš Masařík, Dušan Knop
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1803.06878
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Parameterized Complexity of Fair Feedback Vertex Set Problem ⋮ Computing L(p,1)-Labeling with Combined Parameters ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity ⋮ Unnamed Item ⋮ Extended MSO model checking via small vertex integrity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Sparsity. Graphs, structures, and algorithms
- Extensions of MSO and the monadic counting hierarchy
- Monadic second-order evaluations on tree-decomposable graphs
- Elements of finite model theory.
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
- Algorithmic meta-theorems for restrictions of treewidth
- Integer convex minimization by mixed integer linear optimization
- The complexity of first-order and monadic second-order logic revisited
- Bin packing with fixed number of bins revisited
- Parameterized complexity of fair deletion problems
- Constant thresholds can make target set selection tractable
- Improper colouring of (random) unit disk graphs
- Tight lower bounds for certain parameterized NP-hard problems
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
- Monadic second order logic on graphs with local cardinality constraints
- Improper coloring of unit disk graphs
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
- Easy problems for tree-decomposable graphs
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Edge-Deletion Problems
- A New Perspective on FO Model Checking of Dense Graph Classes
- Deciding First-Order Properties of Nowhere Dense Graphs
- Kernelizing MSO Properties of Trees of Fixed Height, and Some Consequences
- Fair edge deletion problems
- Model Checking Lower Bounds for Simple Graphs
- Parameterized Algorithms
This page was built for publication:
