Sublinear separators, fragility and subexponential expansion (Q896068): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejc.2015.09.001
@@ Property / DOI: 10.1016/j.ejc.2015.09.001 / rank @@
-Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
+Normal rank
@@ Property / cites work @@
+The isoperimetric number of random regular graphs
@@ Property / cites work: The isoperimetric number of random regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Exact algorithms for the Hamiltonian cycle problem in planar graphs
+Normal rank
@@ Property / cites work @@
+Contraction decomposition in h-minor-free graphs and algorithmic applications
+Normal rank
@@ Property / cites work @@
+Excluding any graph as a minor allows a low tree-width 2-coloring
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Kernelization and Sparseness: the case of Dominating Set
+Normal rank
@@ Property / cites work @@
+On forbidden subdivision characterizations of graph classes
+Normal rank
@@ Property / cites work @@
+Testing first-order properties for subclasses of sparse graphs
+Normal rank
@@ Property / cites work @@
+Small graph classes and bounded expansion
@@ Property / cites work: Small graph classes and bounded expansion / rank @@
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+Separator based sparsification. I: Planarity testing and minimum spanning trees
+Normal rank
@@ Property / cites work @@
+Separator-Based Sparsification II: Edge and Vertex Connectivity
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A separator theorem for graphs of bounded genus
@@ Property / cites work: A separator theorem for graphs of bounded genus / rank @@
+Normal rank
@@ Property / cites work @@
+Planar separators and parallel polygon triangulation.
+Normal rank
@@ Property / cites work @@
+Compact topological minors in graphs
@@ Property / cites work: Compact topological minors in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths in directed planar graphs with negative lengths
+Normal rank
@@ Property / cites work @@
+Topological cliques in graphs II
@@ Property / cites work: Topological cliques in graphs II / rank @@
+Normal rank
@@ Property / cites work @@
+Small topological complete subgraphs of ``dense'' graphs
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Grad and classes with bounded expansion. I: Decompositions
+Normal rank
@@ Property / cites work @@
+Grad and classes with bounded expansion. II: Algorithmic aspects
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Characterisations and examples of graph classes with bounded expansion
+Normal rank
@@ Property / cites work @@
+Q3688439
@@ Property / cites work: Q3688439 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128907
@@ Property / cites work: Q3128907 / 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. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+An extremal function for contractions of graphs
@@ Property / cites work: An extremal function for contractions of graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.EJC.2015.09.001
@@ Property / DOI: 10.1016/J.EJC.2015.09.001 / rank @@
+Normal rank