Q5009589 (Q5009589): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes with Structured Neighborhoods and Algorithmic Applications
+Normal rank
@@ Property / cites work @@
+Graph classes with structured neighborhoods and algorithmic applications
+Normal rank
@@ Property / cites work @@
+Q4944976
@@ Property / cites work: Q4944976 / rank @@
+Normal rank
@@ Property / cites work @@
+Precoloring extension. I: Interval graphs
@@ Property / cites work: Precoloring extension. I: Interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+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 @@
+On \(H\)-topological intersection graphs
@@ Property / cites work: On \(H\)-topological intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial problems on \(H\)-graphs
@@ Property / cites work: Combinatorial problems on \(H\)-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Large Induced Subgraphs via Triangulations and CMSO
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Algorithm for the Leafage of Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Q3304141
@@ Property / cites work: Q3304141 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5111880
@@ Property / cites work: Q5111880 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank