Q5874536 (Q5874536): Difference between revisions

@@ Property / cites work @@
+Connected Search for a Lazy Robber
@@ Property / cites work: Connected Search for a Lazy Robber / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Connected graph searching
@@ Property / cites work: Connected graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Derivation of algorithms for cutwidth and related graph layout parameters
+Normal rank
@@ Property / cites work @@
+Q5874334
@@ Property / cites work: Q5874334 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+Constructive linear time algorithms for branchwidth
+Normal rank
@@ Property / cites work @@
+Parameterized and Exact Computation
@@ Property / cites work: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4636613
@@ Property / cites work: Q4636613 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Equivalent definitions of recognizability for sets of graphs of bounded tree-width
+Normal rank
@@ Property / cites work @@
+From Pathwidth to Connected Pathwidth
@@ Property / cites work: From Pathwidth to Connected Pathwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Finding small-width connected path decompositions in polynomial time
+Normal rank
@@ Property / cites work @@
+An annotated bibliography on guaranteed graph searching
+Normal rank
@@ Property / cites work @@
+Faster Computation of Path-Width
@@ Property / cites work: Faster Computation of Path-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Q3818815
@@ Property / cites work: Q3818815 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4204018
@@ Property / cites work: Q4204018 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3489816
@@ Property / cites work: Q3489816 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructive algorithm for path-width of matroids
@@ Property / cites work: Constructive algorithm for path-width of matroids / rank @@
+Normal rank
@@ Property / cites work @@
+The “Art of Trellis Decoding” Is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Finding branch-decompositions of matroids, hypergraphs, and more
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Interval graphs and searching
@@ Property / cites work: Interval graphs and searching / rank @@
+Normal rank
@@ Property / cites work @@
+Searching and pebbling
@@ Property / cites work: Searching and pebbling / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036591
@@ Property / cites work: Q4036591 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3477966
@@ Property / cites work: Q3477966 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4159394
@@ Property / cites work: Q4159394 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q4472491
@@ Property / cites work: Q4472491 / rank @@
+Normal rank
@@ Property / cites work @@
+Cutwidth I: A linear time fixed parameter algorithm
+Normal rank
@@ Property / cites work @@
+Cutwidth II: Algorithms for partial w-trees of bounded degree
+Normal rank