scientific article; zbMATH DE number 7765394
From MaRDI portal
Publication:6087208
DOI10.4230/lipics.isaac.2020.36MaRDI QIDQ6087208
Klaus Heeger, Dušan Knop, Matthias Bentert
Publication date: 14 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Paths of bounded length and their cuts: parameterized complexity and algorithms
- Hop-constrained node survivable network design: An application to MPLS over WDM
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Parameterized complexity of length-bounded cuts and multicuts
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Tight lower bounds for certain parameterized NP-hard problems
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
- Length-bounded cuts and flows
- Maximal Flow Through a Network
- Improved bounds for the unsplittable flow problem
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- Integer programming formulations for the two 4-hop-constrained paths problem
- Graph Classes: A Survey
- Fractals for Kernelization Lower Bounds
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems
- Parameterized Algorithms
- On the complexity of \(k\)-SAT
This page was built for publication:
