PRAM Lower Bound for Element Distinctness Revisited. - Petr Kolman (SOFSEM, 1997)

On Nonblocking Properties on the Benes Network. - Petr Kolman (ESA, 1998)

A note on the greedy algorithm for the unsplittable flow problem. - Petr Kolman (Inf. Process. Lett., 2003)

Optimal broadcast on parallel locality models. - Ben H. H. Juurlink; Petr Kolman; Friedhelm Meyer auf der Heide; Ingo Rieping (J. Discrete Algorithms, 2003)

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. - Petr Kolman; Christian Scheideler (Algorithmica, 2004)

Crossing number, pair-crossing number, and expansion. - Petr Kolman; Jirí Matousek 001 (J. Comb. Theory B, 2004)

Approximating Reversal Distance for Strings with Bounded Number of Duplicates. - Petr Kolman (MFCS, 2005)

Minimum Common String Partition Problem: Hardness and Approximations. - Avraham Goldstein; Petr Kolman; Jie Zheng (Electron. J. Comb., 2005)

The greedy algorithm for the minimum common string partition problem. - Marek Chrobak; Petr Kolman; Jirí Sgall (ACM Trans. Algorithms, 2005)

Short length Menger's theorem and reliable optical routing. - Amitabha Bagchi; Amitabh Chaudhary; Petr Kolman (Theor. Comput. Sci., 2005)

Improved bounds for the unsplittable flow problem. - Petr Kolman; Christian Scheideler (J. Algorithms, 2006)

Single source multiroute flows and cuts on uniform capacity networks. - Henning Bruhn; Jakub Cerný; Alexander Hall; Petr Kolman (SODA, 2007)

Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set. - Petr Kolman; Tomasz Walen (Electron. J. Comb., 2007)

Approximating reversal distance for strings with bounded number of duplicates. - Petr Kolman; Tomasz Walen (Discret. Appl. Math., 2007)

Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. - Amitabha Bagchi; Amitabh Chaudhary; Christian Scheideler; Petr Kolman (SIAM J. Discret. Math., 2007)

Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. - Henning Bruhn; Jakub Cerný; Alexander Hall; Petr Kolman; Jirí Sgall (Theory Comput., 2008)

On the complexity of paths avoiding forbidden pairs. - Petr Kolman; Ondrej Pangrác (Discret. Appl. Math., 2009)

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)

Approximate duality of multicommodity multiroute flows and cuts: single source case. - Petr Kolman; Christian Scheideler (SODA, 2012)

Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. - Petr Kolman; Christian Scheideler (Theory Comput. Syst., 2013)

Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth. - Petr Kolman; Martin Koutecký (Electron. J. Comb., 2015)

On Algorithms for $L$-bounded Cut Problem. - Petr Kolman (CoRR, 2017)

On Algorithms Employing Treewidth for L-bounded Cut Problems. - Petr Kolman (J. Graph Algorithms Appl., 2018)

How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut. - Eden Chlamtác; Petr Kolman (APPROX-RANDOM, 2020)

Extension Complexity, MSO Logic, and Treewidth. - Petr Kolman; Martin Koutecký; Hans Raj Tiwary (Discret. Math. Theor. Comput. Sci., 2020)

On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow. - Katerina Altmanová; Petr Kolman; Jan Voborník (J. Graph Algorithms Appl., 2020)

Approximating Spanning Tree Congestion on Graphs with Polylog Degree. - Petr Kolman (IWOCA, 2024)

A Note on Approximation of Spanning Tree Congestion. - Petr Kolman (CoRR, 2024)

Approximation of Spanning Tree Congestion Using Hereditary Bisection. - Petr Kolman (STACS, 2025)