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
- On Algorithms Employing Treewidth for L-bounded Cut Problems2018 | Faculty of Mathematics and Physics
- Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth2015 | Faculty of Mathematics and Physics
- Length-bounded cuts and flows2010 | Faculty of Mathematics and Physics
- Single Source Multiroute Flows and Cuts on Uniform Capacity Networks +12008 | Faculty of Mathematics and Physics
- Improved Bounds for the Unsplittable Flow Problem2006 | Faculty of Mathematics and Physics
- Approximating Reversal Distance for Strings with Bounded Number of Duplicates +32005 | Faculty of Mathematics and Physics
- Optimal Broadcast on Parallel Locality Models2003 | Faculty of Mathematics and Physics
Loading network view...