Structural parameterizations for two bounded degree problems revisited
From MaRDI portal
Cites work
- A generalization of Nemhauser and Trotter's local optimization theorem
- A generic convolution algorithm for join operations on tree decompositions
- A new approach for approximating node deletion problems
- A note on defective colorings of graphs in surfaces
- A parameterized algorithm for bounded-degree vertex deletion
- A simplified NP-complete satisfiability problem
- A unified approximation algorithm for node-deletion problems
- Approximating bounded degree deletion via matroid matching
- Clique relaxations in social network analysis: the maximum k-plex problem
- Combinatorial algorithms for the maximum \(k\)-plex problem
- Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
- Defective Coloring on Classes of Perfect Graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Exact and approximate bandwidth
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Fast Hamiltonicity checking via bases of perfect matchings
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- Fine-grained parameterized complexity analysis of graph coloring problems
- Finer tight bounds for coloring on clique-width
- Graph theory
- scientific article; zbMATH DE number 4008419 (Why is no real title available?)
- scientific article; zbMATH DE number 3709576 (Why is no real title available?)
- scientific article; zbMATH DE number 7788352 (Why is no real title available?)
- Improper coloring of graphs on surfaces
- Improper coloring of unit disk graphs
- Known algorithms on graphs of bounded treewidth are probably optimal
- Lower bounds for dynamic programming on planar graphs of bounded cutwidth
- Mixed searching and proper-path-width
- New algorithms for mixed dominating set
- On a Combinatorial Problem in Number Theory
- On a generalization of Nemhauser and Trotter's local optimization theorem
- On bounded-degree vertex deletion parameterized by treewidth
- On making a distinguished vertex of minimum degree by vertex deletion
- On structural parameterizations of the bounded-degree vertex deletion problem
- Optimal dynamic program for r-domination problems over tree decompositions
- Parameterized (approximate) defective coloring
- Parameterized algorithms
- Parameterized Algorithms for Generalized Domination
- Parameterized Approximation Schemes Using Graph Widths
- Parameterized complexity of candidate control in elections and related digraph problems
- Parameterized orientable deletion
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Structural parameterizations for two bounded degree problems revisited
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- Structurally parameterized \(d\)-scattered set
- The complexity of satisfiability problems
- The fine-grained complexity of graph homomorphism parameterized by clique-width
- Tight bounds for counting colorings and connected edge sets parameterized by cutwidth
- Tight complexity bounds for counting generalized dominating sets in bounded-treewidth graphs
- Tight lower bounds for the complexity of multicoloring
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
- Vertex-coloring with defects
Cited in
(3)
This page was built for publication: Structural parameterizations for two bounded degree problems revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022380)
