Induced disjoint paths in circular-arc graphs in linear time (Q2629233): Difference between revisions

@@ Property / author @@
-Petr A. Golovach
@@ Property / author: Petr A. Golovach / rank @@
-Normal rank
@@ Property / author @@
+Petr A. Golovach
@@ Property / author: Petr A. Golovach / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1582736073
@@ Property / OpenAlex ID: W1582736073 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.0789
@@ Property / arXiv ID: 1403.0789 / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting fixed patterns in chordal graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Corrigendum to: On the complexity of testing for odd holes and induced odd paths
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3034816
@@ Property / cites work: Q3034816 / rank @@
+Normal rank
@@ Property / cites work @@
+The \(k\)-in-a-path problem for claw-free graphs
@@ Property / cites work: The \(k\)-in-a-path problem for claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Large induced subgraphs via triangulations and CMSO
+Normal rank
@@ Property / cites work @@
+Induced disjoint paths in AT-free graphs
@@ Property / cites work: Induced disjoint paths in AT-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Induced Disjoint Paths in Claw-Free Graphs
@@ Property / cites work: Induced Disjoint Paths in Claw-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Induced Disjoint Paths in Circular-Arc Graphs in Linear Time
+Normal rank
@@ Property / cites work @@
+Vertex disjoint paths on clique-width bounded graphs
+Normal rank
@@ Property / cites work @@
+Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
+Normal rank
@@ Property / cites work @@
+Finding Disjoint Paths in Split Graphs
@@ Property / cites work: Finding Disjoint Paths in Split Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A simpler linear-time recognition of circular-arc graphs
+Normal rank
@@ Property / cites work @@
+On the Computational Complexity of Combinatorial Problems
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for the induced disjoint paths problem in planar graphs
+Normal rank
@@ Property / cites work @@
+An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
+Normal rank
@@ Property / cites work @@
+Linear-time recognition of circular-arc graphs
@@ Property / cites work: Linear-time recognition of circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4352948
@@ Property / cites work: Q4352948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273851
@@ Property / cites work: Q4273851 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank