Petr Kolman

According to our database, Petr Kolman authored at least 26 papers between 1997 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow.

Katerina Altmanová, Petr Kolman, Jan Voborník

J. Graph Algorithms Appl., 2020

Extension Complexity, MSO Logic, and Treewidth.

Petr Kolman, Martin Koutecký, Hans Raj Tiwary

Discret. Math. Theor. Comput. Sci., 2020

How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut.

Eden Chlamtác, Petr Kolman

Proceedings of the Approximation, 2020

2018

On Algorithms Employing Treewidth for L-bounded Cut Problems.

Petr Kolman

J. Graph Algorithms Appl., 2018

2017

On Algorithms for $L$-bounded Cut Problem.

Petr Kolman

CoRR, 2017

2015

Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth.

Petr Kolman, Martin Koutecký

Electron. J. Comb., 2015

2013

Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.

Petr Kolman, Christian Scheideler

Theory Comput. Syst., 2013

2012

Approximate duality of multicommodity multiroute flows and cuts: single source case.

Petr Kolman, Christian Scheideler

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2010

Length-bounded cuts and flows.

Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella

ACM Trans. Algorithms, 2010

2009

On the complexity of paths avoiding forbidden pairs.

Petr Kolman, Ondrej Pangrác

Discret. Appl. Math., 2009

2008

Single Source Multiroute Flows and Cuts on Uniform Capacity Networks.

Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jirí Sgall

Theory Comput., 2008

2007

Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.

Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman

SIAM J. Discret. Math., 2007

Approximating reversal distance for strings with bounded number of duplicates.

Petr Kolman, Tomasz Walen

Discret. Appl. Math., 2007

Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set.

Petr Kolman, Tomasz Walen

Electron. J. Comb., 2007

Single source multiroute flows and cuts on uniform capacity networks.

Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

Improved bounds for the unsplittable flow problem.

Petr Kolman, Christian Scheideler

J. Algorithms, 2006

2005

Short length Menger's theorem and reliable optical routing.

Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman

Theor. Comput. Sci., 2005

The greedy algorithm for the minimum common string partition problem.

Marek Chrobak, Petr Kolman, Jirí Sgall

ACM Trans. Algorithms, 2005

Minimum Common String Partition Problem: Hardness and Approximations.

Avraham Goldstein, Petr Kolman, Jie Zheng

Electron. J. Comb., 2005

Approximating Reversal Distance for Strings with Bounded Number of Duplicates.

Petr Kolman

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004

Crossing number, pair-crossing number, and expansion.

Petr Kolman, Jirí Matousek

J. Comb. Theory, Ser. B, 2004

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.

Petr Kolman, Christian Scheideler

Algorithmica, 2004

2003

Optimal broadcast on parallel locality models.

Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping

J. Discrete Algorithms, 2003

A note on the greedy algorithm for the unsplittable flow problem.

Petr Kolman

Inf. Process. Lett., 2003

1998

On Nonblocking Properties on the Benes Network.

Petr Kolman

Proceedings of the Algorithms, 1998

1997

PRAM Lower Bound for Element Distinctness Revisited.

Petr Kolman

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997