More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints (Q5009336): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.11275
@@ Property / arXiv ID: 1805.11275 / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for connected red-blue dominating set
+Normal rank
@@ Property / cites work @@
+Minimum semidefinite rank of outerplanar graphs and the tree cover number
+Normal rank
@@ Property / cites work @@
+Graph classes with structured neighborhoods and algorithmic applications
+Normal rank
@@ Property / cites work @@
+Fast exact algorithms for some connectivity problems parameterized by clique-width
+Normal rank
@@ Property / cites work @@
+An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
+Normal rank
@@ Property / cites work @@
+Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
+Normal rank
@@ Property / cites work @@
+Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Boolean-width of graphs
@@ Property / cites work: Boolean-width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Computing the largest bond of a graph
@@ Property / cites work: Computing the largest bond of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5875545
@@ Property / cites work: Q5875545 / rank @@
+Normal rank
@@ Property / cites work @@
+Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
+Normal rank
@@ Property / cites work @@
+On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
+Normal rank
@@ Property / cites work @@
+The Complexity of Coloring Circular Arcs and Chords
+Normal rank
@@ Property / cites work @@
+Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
+Normal rank
@@ Property / cites work @@
+Improved methods for approximating node weighted Steiner trees and connected dominating sets.
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Mim-width. I. Induced path problems
@@ Property / cites work: Mim-width. I. Induced path problems / rank @@
+Normal rank
@@ Property / cites work @@
+Mim-width. II. The feedback vertex set problem
@@ Property / cites work: Mim-width. II. The feedback vertex set problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3958592
@@ Property / cites work: Q3958592 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-coloring problems of bounded treewidth graphs
+Normal rank
@@ Property / cites work @@
+On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators
+Normal rank
@@ Property / cites work @@
+Faster algorithms for vertex partitioning problems parameterized by clique-width
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+MSOL partitioning problems on graphs of bounded treewidth and clique-width
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank
@@ Property / OpenAlex ID @@
+W3195206410
@@ Property / OpenAlex ID: W3195206410 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5009336