Follow
Petr Kolman
Title
Cited by
Cited by
Year
Improved bounds for the unsplittable flow problem
P Kolman, C Scheideler
Journal of Algorithms 61 (1), 20-44, 2006
1452006
Minimum common string partition problem: Hardness and approximations
A Goldstein, P Kolman, J Zheng
International Symposium on Algorithms and Computation, 484-495, 2004
1322004
Reversal distance for strings with duplicates: Linear time approximation using hitting set
P Kolman, T Waleń
Approximation and Online Algorithms: 4th International Workshop, WAOA 2006 …, 2007
752007
Length-bounded cuts and flows
G Baier, T Erlebach, A Hall, E Köhler, P Kolman, O Pangrác, H Schilling, ...
ACM Transactions on Algorithms (TALG) 7 (1), 1-27, 2010
732010
On the complexity of paths avoiding forbidden pairs
P Kolman, O Pangrác
Discrete Applied Mathematics 157 (13), 2871-2876, 2009
562009
The greedy algorithm for the minimum common string partition problem
M Chrobak, P Kolman, J Sgall
International Workshop on Randomization and Approximation Techniques in …, 2004
532004
The greedy algorithm for the minimum common string partition problem
M Chrobak, P Kolman, J Sgall
ACM Transactions on Algorithms (TALG) 1 (2), 350-366, 2005
392005
Approximating reversal distance for strings with bounded number of duplicates
P Kolman, T Waleń
Discrete Applied Mathematics 155 (3), 327-336, 2007
352007
Crossing number, pair-crossing number, and expansion
P Kolman, J Matoušek
Journal of Combinatorial Theory, Series B 92 (1), 99-113, 2004
352004
A note on the greedy algorithm for the unsplittable flow problem
P Kolman
Information Processing Letters 88 (3), 101-105, 2003
322003
Approximating reversal distance for strings with bounded number of duplicates
P Kolman
Mathematical Foundations of Computer Science 2005: 30th International …, 2005
312005
Simple on-line algorithms for the maximum disjoint paths problem
P Kolman, C Scheideler
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001
292001
Short length Menger's theorem and reliable optical routing
A Bagchi, A Chaudhary, P Kolman
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and …, 2003
242003
Algorithms for fault-tolerant routing in circuit switched networks
A Bagchi, A Chaudhary, C Scheideler, P Kolman
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002
212002
Extension complexity, MSO logic, and treewidth
P Kolman, M Koutecký, HR Tiwary
Discrete Mathematics & Theoretical Computer Science 22 (Discrete Algorithms), 2020
17*2020
Extended formulation for CSP that is compact for instances of bounded treewidth
P Kolman, M Koutecký
arXiv preprint arXiv:1502.05361, 2015
162015
A simple combinatorial proof of duality of multiroute flows and cuts
A Bagchi, A Chaudhary, P Kolman, J Sgall
Charles Univ., 2004
162004
Single source multiroute flows and cuts on uniform capacity networks
H Bruhn, J Černý, A Hall, P Kolman, J Sgall
Theory of Computing 4 (1), 1-20, 2008
122008
The new national energy concept 2015-The future of brown coal in the Czech Republic.
M Mikoláš, R Kozel, Š Vilamová, D Paus, A Király, P Kolman, M Piecha, ...
Acta Montanistica Slovaca 20 (4), 2015
102015
Towards duality of multicommodity multiroute cuts and flows: Multilevel ball-growing
P Kolman, C Scheideler
Theory of Computing Systems 53, 341-363, 2013
92013
The system can't perform the operation now. Try again later.
Articles 1–20