Large Induced Subgraphs via Triangulations and CMSO (Q2954371): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1968041356
@@ Property / OpenAlex ID: W1968041356 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1559
@@ Property / arXiv ID: 1309.1559 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for the group path problem on chordal graphs
+Normal rank
@@ Property / cites work @@
+Efficient reduction for path problems on circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
+Normal rank
@@ Property / cites work @@
+GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
@@ Property / cites work: GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of testing for odd holes and induced odd paths
+Normal rank
@@ Property / cites work @@
+The Erdős-Pósa property for long circuits
@@ Property / cites work: The Erdős-Pósa property for long circuits / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and Pathwidth of Permutation Graphs
@@ Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
+Normal rank
@@ Property / cites work @@
+Treewidth and Minimum Fill-in: Grouping the Minimal Separators
+Normal rank
@@ Property / cites work @@
+Listing all potential maximal cliques of a graph
@@ Property / cites work: Listing all potential maximal cliques of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for max independent set
@@ Property / cites work: Fast algorithms for max independent set / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Induced matchings
@@ Property / cites work: Induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Independent packings in structured graphs
@@ Property / cites work: Independent packings in structured graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a maximum induced matching in weakly chordal graphs
+Normal rank
@@ Property / cites work @@
+Induced matchings in asteroidal triple-free graphs
+Normal rank
@@ Property / cites work @@
+The three-in-a-tree problem
@@ Property / cites work: The three-in-a-tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic second-order evaluations on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Finding induced trees
@@ Property / cites work: Finding induced trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum feedback vertex set problem: Exact and enumeration algorithms
+Normal rank
@@ Property / cites work @@
+Contraction obstructions for treewidth
@@ Property / cites work: Contraction obstructions for treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+A measure &amp; conquer approach for the analysis of exact algorithms
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Treewidth and Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Bidimensionality and Geometric Graphs
@@ Property / cites work: Bidimensionality and Geometric Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithm for the Maximum Induced Planar Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Treewidth computation and extremal combinatorics
@@ Property / cites work: Treewidth computation and extremal combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Subexponential Parameterized Algorithm for Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+Deciding first-order properties of locally tree-decomposable structures
+Normal rank
@@ Property / cites work @@
+Exponential time algorithms for the minimum dominating set problem on some graph classes
+Normal rank
@@ Property / cites work @@
+Minimum weight feedback vertex sets in circle graphs
+Normal rank
@@ Property / cites work @@
+MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS
+Normal rank
@@ Property / cites work @@
+Induced packing of odd cycles in planar graphs
@@ Property / cites work: Induced packing of odd cycles in planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+New results on induced matchings
@@ Property / cites work: New results on induced matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3086928
@@ Property / cites work: Q3086928 / rank @@
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds
+Normal rank
@@ Property / cites work @@
+Minimal triangulations of graphs: a survey
@@ Property / cites work: Minimal triangulations of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+On treewidth and minimum fill-in of asteroidal triple-free graphs
+Normal rank
@@ Property / cites work @@
+Minimum Fill-in on Circle and Circular-Arc Graphs
@@ Property / cites work: Minimum Fill-in on Circle and Circular-Arc Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3172385
@@ Property / cites work: Q3172385 / 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 @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Use of Linear Graphs in Gauss Elimination
@@ Property / cites work: The Use of Linear Graphs in Gauss Elimination / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
+Normal rank
@@ Property / cites work @@
+Robust algorithms for restricted domains
@@ Property / cites work: Robust algorithms for restricted domains / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Computation of Maximum Induced Forest
@@ Property / cites work: Exact Computation of Maximum Induced Forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q5683627
@@ Property / cites work: Q5683627 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Independent Set
@@ Property / cites work: Finding a Maximum Independent Set / rank @@
+Normal rank
@@ Property / cites work @@
+On the presence of disjoint subgraphs of a specified type
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Maximum Independent Set
@@ Property / cites work: Exact Algorithms for Maximum Independent Set / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Exact Algorithm for Undirected Feedback Vertex Set
+Normal rank
@@ Property / cites work @@
+The Complexity of the Partial Order Dimension Problem
+Normal rank
@@ Property / cites work @@
+The maximum k-colorable subgraph problem for chordal graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2954371