Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989): Difference between revisions

@@ Property / OpenAlex ID @@
+W3046548273
@@ Property / OpenAlex ID: W3046548273 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01082
@@ Property / arXiv ID: 1910.01082 / rank @@
+Normal rank
@@ Property / cites work @@
+On easy and hard hereditary classes of graphs with respect to the independent set problem
+Normal rank
@@ Property / cites work @@
+Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs
+Normal rank
@@ Property / cites work @@
+Largest chordal and interval subgraphs faster than \(2^n\)
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles of even length in graphs
@@ Property / cites work: Cycles of even length in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimality program in segment and string graphs
@@ Property / cites work: Optimality program in segment and string graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs
+Normal rank
@@ Property / cites work @@
+Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
+Normal rank
@@ Property / cites work @@
+On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Hitting forbidden subgraphs in graphs of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Treewidth of graphs with balanced separations
@@ Property / cites work: Treewidth of graphs with balanced separations / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms via Monotone Local Search
@@ Property / cites work: Exact Algorithms via Monotone Local Search / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithm for the Maximum Induced Planar Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Large Induced Subgraphs via Triangulations and CMSO
+Normal rank
@@ Property / cites work @@
+Polynomial-time algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free graphs
+Normal rank
@@ Property / cites work @@
+Q3745859
@@ Property / cites work: Q3745859 / rank @@
+Normal rank
@@ Property / cites work @@
+Deleting vertices to graphs of bounded genus
@@ Property / cites work: Deleting vertices to graphs of bounded genus / rank @@
+Normal rank
@@ Property / cites work @@
+Tight Running Time Lower Bounds for Vertex Deletion Problems
+Normal rank
@@ Property / cites work @@
+String graphs. I: The number of critical nonstring graphs is infinite
+Normal rank
@@ Property / cites work @@
+String graphs. II: Recognizing string graphs is NP-hard
+Normal rank
@@ Property / cites work @@
+String graphs requiring exponential representations
+Normal rank
@@ Property / cites work @@
+Separators in region intersection graphs
@@ Property / cites work: Separators in region intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
+Normal rank
@@ Property / cites work @@
+Q5875557
@@ Property / cites work: Q5875557 / rank @@
+Normal rank
@@ Property / cites work @@
+Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n
+Normal rank
@@ Property / cites work @@
+Das Geschlecht des vollständigen paaren Graphen
@@ Property / cites work: Das Geschlecht des vollständigen paaren Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Q3318125
@@ Property / cites work: Q3318125 / rank @@
+Normal rank
@@ Property / cites work @@
+Embeddings of graphs
@@ Property / cites work: Embeddings of graphs / rank @@
+Normal rank