Pages that link to "Item:Q3624379"

The following pages link to Improved Approximation Algorithms for Minimum Weight Vertex Separators (Q3624379):

Displaying 50 items.

• Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
• Local search: is brute-force avoidable? (Q439931) (← links)
• Approximation algorithms for digraph width parameters (Q476883) (← links)
• Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
• A multilevel bilinear programming algorithm for the vertex separator problem (Q683341) (← links)
• Rank-width and tree-width of \(H\)-minor-free graphs (Q709231) (← links)
• Lower bounds for treewidth of product graphs (Q741743) (← links)
• A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
• Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs (Q764332) (← links)
• The all-or-nothing flow problem in directed graphs with symmetric demand pairs (Q896267) (← links)
• Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
• Bivariate complexity analysis of \textsc{Almost Forest Deletion} (Q1686068) (← links)
• Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis (Q1712018) (← links)
• Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
• On classes of graphs with strongly sublinear separators (Q1750205) (← links)
• Quasimetric embeddings and their applications (Q1799224) (← links)
• Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
• An improvement of Reed's treewidth approximation (Q2232243) (← links)
• Target set selection for conservative populations (Q2235265) (← links)
• Contraction obstructions for treewidth (Q2275894) (← links)
• Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
• Algorithms and complexity for Turaev-Viro invariants (Q2316773) (← links)
• Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
• Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
• Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
• Treewidth computation and extremal combinatorics (Q2392037) (← links)
• Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
• Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
• Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
• Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
• Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
• A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
• Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
• Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
• On the Tree-Width of Planar Graphs (Q2851524) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Chasing a Fast Robber on Planar Graphs and Random Graphs (Q2940989) (← links)
• Short Regular Expressions from Finite Automata: Empirical Results (Q3637356) (← links)
• Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
• Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
• Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
• On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
• Separators in region intersection graphs (Q4638049) (← links)
• Improved Bounds for the Excluded-Minor Approximation of Treedepth (Q4990393) (← links)
• Graph Clustering using Effective Resistance (Q4993308) (← links)
• Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery (Q5002784) (← links)
• (Q5009491) (← links)
• Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
• Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
• Computing Tree Decompositions (Q5042458) (← links)