The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313): Difference between revisions

@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the dimension of projected polyhedra
@@ Property / cites work: On the dimension of projected polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex separator problem: a polyhedral investigation
+Normal rank
@@ Property / cites work @@
+On graphs with polynomially solvable maximum-weight clique problem
+Normal rank
@@ Property / cites work @@
+The k-Separator Problem
@@ Property / cites work: The k-Separator Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding tree-decompositions of small treewidth
+Normal rank
@@ Property / cites work @@
+Q5463498
@@ Property / cites work: Q5463498 / rank @@
+Normal rank
@@ Property / cites work @@
+Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
+Normal rank
@@ Property / cites work @@
+Decomposing Matrices into Blocks
@@ Property / cites work: Decomposing Matrices into Blocks / rank @@
+Normal rank
@@ Property / cites work @@
+Independent Sets in Asteroidal Triple-Free Graphs
@@ Property / cites work: Independent Sets in Asteroidal Triple-Free Graphs / 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 @@
+On the hardness of approximating minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Maximum weight independent sets and cliques in intersection graphs of filaments
+Normal rank
@@ Property / cites work @@
+\(k\)-edge subgraph problems
@@ Property / cites work: \(k\)-edge subgraph problems / rank @@
+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 @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Weakly triangulated graphs
@@ Property / cites work: Weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+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 @@
+Some results on graphs without long induced paths
@@ Property / cites work: Some results on graphs without long induced paths / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal independent sets of vertices in claw-free graphs
+Normal rank
@@ Property / cites work @@
+Disconnecting graphs by removing vertices: a polyhedral approach
+Normal rank
@@ Property / cites work @@
+The complexity of dissociation set problems in graphs
+Normal rank
@@ Property / cites work @@
+The complexity of restricted spanning tree problems
+Normal rank
@@ Property / cites work @@
+Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Algorithms for weakly triangulated graphs
@@ Property / cites work: Algorithms for weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+The primal-dual method for approximation algorithms
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank