Petr Kolman

According to our database, Petr Kolman authored at least 29 papers between 1997 and 2025.

Collaborative distances:

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

2025

Approximation of Spanning Tree Congestion Using Hereditary Bisection.

Petr Kolman

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

2024

A Note on Approximation of Spanning Tree Congestion.

Petr Kolman

CoRR, 2024

Approximating Spanning Tree Congestion on Graphs with Polylog Degree.

Petr Kolman

Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2020

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

Eden Chlamtác, Petr Kolman

Proceedings of the Approximation, 2020

2019

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

Katerina Altmanová, Petr Kolman, Jan Voborník

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

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

2016

Extension Complexity, MSO Logic, and Treewidth .

Petr Kolman, Martin Koutecký, Hans Raj Tiwary

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

2015

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

Petr Kolman, Martin Koutecký

Electron. J. Comb., 2015

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

2011

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

Petr Kolman, Christian Scheideler

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

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

Approximating reversal distance for strings with bounded number of duplicates.

Petr Kolman, Tomasz Walen

Discret. Appl. Math., 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

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

Petr Kolman, Tomasz Walen

Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

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 B, 2004

Minimum Common String Partition Problem: Hardness and Approximations.

Avraham Goldstein, Petr Kolman, Jie Zheng

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

The Greedy Algorithm for the Minimum Common String Partition Problem.

Marek Chrobak, Petr Kolman, Jirí Sgall

Proceedings of the Approximation, 2004

2003

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

Petr Kolman

Inf. Process. Lett., 2003

Short length menger's theorem and reliable optical routing.

Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman

Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002

Algorithms for fault-tolerant routing in circuit switched networks.

Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Improved bounds for the unsplittable flow problem.

Petr Kolman, Christian Scheideler

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Simple on-line algorithms for the maximum disjoint paths problem.

Petr Kolman, Christian Scheideler

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000

Optimal broadcast on parallel locality models.

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

Proceedings of the SIROCCO 7, 2000

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