Solving problems on graphs of high rank-width (Q1709595): Difference between revisions

@@ Property / Wikidata QID @@
+Q93047965
@@ Property / Wikidata QID: Q93047965 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-017-0290-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2258298398
@@ Property / OpenAlex ID: W2258298398 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial algorithm for finding the largest independent sets in graphs without forks
+Normal rank
@@ Property / cites work @@
+Boundary classes of graphs for the dominating set problem
+Normal rank
@@ Property / cites work @@
+Kernel Bounds for Path and Cycle Problems
@@ Property / cites work: Kernel Bounds for Path and Cycle Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Digraph Decompositions and Eulerian Systems
@@ Property / cites work: Digraph Decompositions and Eulerian Systems / rank @@
+Normal rank
@@ Property / cites work @@
+A note on \(\alpha\)-redundant vertices in graphs
@@ Property / cites work: A note on \(\alpha\)-redundant vertices in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of vertex colouring
@@ Property / cites work: Parameterized complexity of vertex colouring / rank @@
+Normal rank
@@ Property / cites work @@
+On feedback vertex set: new measure and new structures
+Normal rank
@@ Property / cites work @@
+Chordal editing is fixed-parameter tractable
@@ Property / cites work: Chordal editing is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Split Decomposition Revisited
@@ Property / cites work: Linear Time Split Decomposition Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Vertex-minors, monadic second-order logic, and a conjecture by Seese
+Normal rank
@@ Property / cites work @@
+Decomposition of Directed Graphs
@@ Property / cites work: Decomposition of Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Meta-kernelization using Well-structured Modulators
+Normal rank
@@ Property / cites work @@
+Kernelization Using Structural Parameters on Sparse Graph Classes
+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 @@
+Meta-kernelization with Structural Parameters
@@ Property / cites work: Meta-kernelization with Structural Parameters / rank @@
+Normal rank
@@ Property / cites work @@
+Backdoors into heterogeneous classes of SAT and CSP
+Normal rank
@@ Property / cites work @@
+Distance labeling scheme and split decomposition
@@ Property / cites work: Distance labeling scheme and split decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Robust algorithms for the stable set problem
@@ Property / cites work: Robust algorithms for the stable set problem / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Distance Hereditary Graphs Using Split Decomposition
+Normal rank
@@ Property / cites work @@
+Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
+Normal rank
@@ Property / cites work @@
+Practical and efficient split decomposition via graph-labelled trees
+Normal rank
@@ Property / cites work @@
+Closing complexity gaps for coloring problems on \(H\)-free graphs
+Normal rank
@@ Property / cites work @@
+Finding Branch-Decompositions and Rank-Decompositions
+Normal rank
@@ Property / cites work @@
+The 3-Colorability Problem on Graphs with Maximum Degree Four
+Normal rank
@@ Property / cites work @@
+Q3353058
@@ Property / cites work: Q3353058 / rank @@
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+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 @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank