scientific article; zbMATH DE number 7651153
From MaRDI portal
Publication:5874480
DOI10.4230/LIPIcs.ESA.2020.14MaRDI QIDQ5874480
Valia Mitsou, Yota Otachi, Michael Lampis, Eun Jung Kim, Rémy Belmonte
Publication date: 7 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Extended MSO model checking via small vertex integrity ⋮ In)approximability of Maximum Minimal FVS ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ Exploring the gap between treedepth and vertex cover through vertex integrity ⋮ (In)approximability of maximum minimal FVS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The parameterised complexity of list problems on graphs of bounded treewidth
- Satisfiability of acyclic and almost acyclic CNF formulas
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
- Parameterized maximum path coloring
- Treewidth governs the complexity of target set selection
- First-fit coloring on interval graphs has performance ratio at least 5
- More bounds for the Grundy number of graphs
- First-fit coloring of bounded tolerance graphs
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- On the complexity of some colorful problems parameterized by treewidth
- Primal-dual approximation algorithms for integral flow and multicut in trees
- On bounded-degree vertex deletion parameterized by treewidth
- On the parameterized complexity of spanning trees with small vertex covers
- The parameterised complexity of computing the maximum modularity of a graph
- Constraint satisfaction with bounded treewidth revisited
- Results on the Grundy chromatic number of graphs
- A note on first-fit coloring of interval graphs
- The Steiner forest problem revisited
- On the parameterized complexity of multiple-interval graph problems
- Some perfect coloring properties of graphs
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- Structurally parameterized \(d\)-Scattered Set
- Time-approximation trade-offs for inapproximable problems
- Matchings with lower quotas: algorithms and complexity
- Counting linear extensions: parameterizations by treewidth
- The complexity landscape of decompositional parameters for ILP
- Complexity of Grundy coloring and its variants
- Algorithmic meta-theorems for restrictions of treewidth
- On the Grundy number of graphs with few \(P_4\)'s
- Parameterized complexity of length-bounded cuts and multicuts
- Linear time solvable optimization problems on graphs of bounded clique-width
- Parameterized complexity of safe set
- Complexity and approximability of parameterized MAX-CSPs
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- On the complexity of restoring corrupted colorings
- Tractable cases of the extended global cardinality constraint
- Inequalities for the Grundy chromatic number of graphs
- Tree-depth, subgraph coloring and homomorphism bounds
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
- Parameterized Algorithms for Modular-Width
- Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask).
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- On Tractable Cases of Target Set Selection
- Parameterized Power Vertex Cover
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
- Capacitated Domination and Covering: A Parameterized Perspective
- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
- What Makes Equitable Connected Partition Easy
- On-line and first fit colorings of graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
- Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus
- New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness
- Clique-width III
- New Results on Directed Edge Dominating Set
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- On Routing Disjoint Paths in Bounded Treewidth Graphs
- Model Checking Lower Bounds for Simple Graphs
- Parameterized Algorithms
This page was built for publication:
