5 citations · 5 across the 1 of their papers we have counts for
2 papers
cs.DS2019
On Polynomial-Time Combinatorial Algorithms for Maximum -Bounded Flow
Kateřina Altmanová, Petr Kolman, Jan Voborník
Given a graph with two distinguished vertices and an integer , an {\em -bounded flow} is a flow between and that can be decomposed into paths of…
cs.DS2018★ 5 cited
Evaluating and Tuning n-fold Integer Programming
Kateřina Altmanová, Dušan Knop, Martin Koutecký
In recent years, algorithmic breakthroughs in stringology, computational social choice, scheduling, etc., were achieved by applying the theory of so-called -fold integer program…