scientific article; zbMATH DE number 7525479
From MaRDI portal
Publication:5075784
DOI10.4230/LIPIcs.ESA.2019.42MaRDI QIDQ5075784
Daniel Lokshtanov, Amer E. Mouawad, Eduard Eiben
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parallel algorithm for bisection width in trees
- Treewidth. Computations and approximations
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- A Polylogarithmic Approximation of the Minimum Bisection
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- On the Parameterized Complexity of Computing Graph Bisections
- Clustered Integer 3SUM via Additive Combinatorics
- Approximating the minimum bisection size (extended abstract)
- Partitioning Planar Graphs
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Better Approximations for Tree Sparsity in Nearly-Linear Time
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems
- On Problems Equivalent to (min,+)-Convolution
- ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
- Minimum bisection is fixed parameter tractable
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ 1
This page was built for publication:
