scientific article; zbMATH DE number 7525509
From MaRDI portal
Publication:5075819
DOI10.4230/LIPIcs.ESA.2019.72MaRDI QIDQ5075819
Manuel Sorge, Paweł Rzążewski, Irene Muzi, Tomáš Masařík, Marcin Pilipczuk
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1907.02494
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- Polynomial treewidth forces a large grid-like-minor
- Graph minors. III. Planar tree-width
- Linearity of grid minors in treewidth with applications through bidimensionality
- Graph minors. V. Excluding a planar graph
- Quickly excluding a planar graph
- Packing directed circuits
- Directed tree-width
- Packing directed circuits fractionally
- The Directed Grid Theorem
- Polynomial Bounds for the Grid-Minor Theorem
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
- Multicommodity flow, well-linked terminals, and routing problems
- Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs
- Polynomial Planar Directed Grid Theorem
- On Independent Circuits Contained in a Graph
- An Excluded Grid Theorem for Digraphs with Forbidden Minors
- The All-or-Nothing Flow Problem in Directed Graphs with Symmetric Demand Pairs
- Large-treewidth graph decompositions and applications
