Classes
Publications
- How to cut a ball without separating: Improved approximations for length bounded cut2020 | Faculty of Mathematics and Physics
- On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow2020 | Faculty of Mathematics and Physics
- On polynomial-time combinatorial algorithms for maximum L-bounded flow2019 | Faculty of Mathematics and Physics
- Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth2015 | Faculty of Mathematics and Physics
- On the Complexity of Paths Avoiding Forbidden Pairs2009 | Faculty of Mathematics and Physics
- Simple On-Line Algorithms for the Maximum Disjoint Paths Problem +12004 | Faculty of Mathematics and Physics
- Minimum Common String Partition Problem: Hardness and Approximations +22004 | Faculty of Mathematics and Physics
- On Algorithms Employing Treewidth for L-bounded Cut Problems2018 | Faculty of Mathematics and Physics
- Extension Complexity, MSO Logic, and Treewidth +12016 | Faculty of Mathematics and Physics
- Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing2013 | Faculty of Mathematics and Physics
Loading network view...
