Petr Kolman

49 papers A* 3A 3B 11C 2Journal 27Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Bond Polytope under Vertex- and Edge-sums.
CoRR
Petr Kolman, Hans Raj Tiwary
2026 J jnl
Min-Max Connected Multiway Cut.
CoRR
Hans Raj Tiwary, Petr Kolman
2026 J jnl
Two Complexity Results on Spanning-Tree Congestion Problems.
CoRR
Sunny Atalig, Marek Chrobak, Christoph Dürr, Petr Kolman, Huong Luu, Jirí Sgall, Gregory Zhu
2025 A conf
Approximation of Spanning Tree Congestion Using Hereditary Bisection.
STACS
Petr Kolman
2024 J jnl
A Note on Approximation of Spanning Tree Congestion.
CoRR
Petr Kolman
2024 C conf
Approximating Spanning Tree Congestion on Graphs with Polylog Degree.
IWOCA
Petr Kolman
2020 J jnl
Extension Complexity, MSO Logic, and Treewidth.
Discret. Math. Theor. Comput. Sci.
Petr Kolman, Martin Koutecký, Hans Raj Tiwary
2020 — conf
How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut.
APPROX-RANDOM
Eden Chlamtác, Petr Kolman
2020 J jnl
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow.
J. Graph Algorithms Appl.
Katerina Altmanová, Petr Kolman, Jan Voborník
2019 J jnl
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow.
CoRR
Katerina Altmanová, Petr Kolman, Jan Voborník
2019 B conf
On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow.
WADS
Katerina Altmanová, Petr Kolman, Jan Voborník
2018 J jnl
On Algorithms Employing Treewidth for L-bounded Cut Problems.
J. Graph Algorithms Appl.
Petr Kolman
2017 J jnl
On Algorithms for $L$-bounded Cut Problem.
CoRR
Petr Kolman
2016 — conf
Extension Complexity, MSO Logic, and Treewidth .
SWAT
Petr Kolman, Martin Koutecký, Hans Raj Tiwary
2015 J jnl
Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth.
Electron. J. Comb.
Petr Kolman, Martin Koutecký
2015 J jnl
Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth.
CoRR
Petr Kolman, Martin Koutecký
2015 J jnl
Extension Complexity, MSO Logic, and Treewidth.
CoRR
Petr Kolman, Martin Koutecký, Hans Raj Tiwary
2013 J jnl
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.
Theory Comput. Syst.
Petr Kolman, Christian Scheideler
2012 A* conf
Approximate duality of multicommodity multiroute flows and cuts: single source case.
SODA
Petr Kolman, Christian Scheideler
2011 B ed.
Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers
WG
Petr Kolman, Jan Kratochvíl
2011 A conf
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.
STACS
Petr Kolman, Christian Scheideler
2010 J jnl
Length-bounded cuts and flows.
ACM Trans. Algorithms
Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella
2010 C ed.
Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings
TAMC
Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman
2009 J jnl
On the complexity of paths avoiding forbidden pairs.
Discret. Appl. Math.
Petr Kolman, Ondrej Pangrác
2008 J jnl
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks.
Theory Comput.
Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jirí Sgall
2007 J jnl
Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.
SIAM J. Discret. Math.
Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman
2007 J jnl
Approximating reversal distance for strings with bounded number of duplicates.
Discret. Appl. Math.
Petr Kolman, Tomasz Walen
2007 J jnl
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set.
Electron. J. Comb.
Petr Kolman, Tomasz Walen
2007 A* conf
Single source multiroute flows and cuts on uniform capacity networks.
SODA
Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman
2006 J jnl
Improved bounds for the unsplittable flow problem.
J. Algorithms
Petr Kolman, Christian Scheideler
2006 B conf
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set.
WAOA
Petr Kolman, Tomasz Walen
2005 B conf
Approximating Reversal Distance for Strings with Bounded Number of Duplicates.
MFCS
Petr Kolman
2005 J jnl
Minimum Common String Partition Problem: Hardness and Approximations.
Electron. J. Comb.
Avraham Goldstein, Petr Kolman, Jie Zheng
2005 J jnl
Short length Menger's theorem and reliable optical routing.
Theor. Comput. Sci.
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
2005 J jnl
The greedy algorithm for the minimum common string partition problem.
ACM Trans. Algorithms
Marek Chrobak, Petr Kolman, Jirí Sgall
2004 J jnl
Crossing number, pair-crossing number, and expansion.
J. Comb. Theory B
Petr Kolman, Jirí Matousek
2004 B conf
Minimum Common String Partition Problem: Hardness and Approximations.
ISAAC
Avraham Goldstein, Petr Kolman, Jie Zheng
2004 J jnl
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.
Algorithmica
Petr Kolman, Christian Scheideler
2004 — conf
The Greedy Algorithm for the Minimum Common String Partition Problem.
APPROX-RANDOM
Marek Chrobak, Petr Kolman, Jirí Sgall
2003 J jnl
A note on the greedy algorithm for the unsplittable flow problem.
Inf. Process. Lett.
Petr Kolman
2003 J jnl
Optimal broadcast on parallel locality models.
J. Discrete Algorithms
Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping
2003 B conf
Short length menger's theorem and reliable optical routing.
SPAA
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
2002 B conf
Algorithms for fault-tolerant routing in circuit switched networks.
SPAA
Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman
2002 A* conf
Improved bounds for the unsplittable flow problem.
SODA
Petr Kolman, Christian Scheideler
2001 B ed.
Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings
MFCS
Jirí Sgall, Ales Pultr, Petr Kolman
2001 B conf
Simple on-line algorithms for the maximum disjoint paths problem.
SPAA
Petr Kolman, Christian Scheideler
2000 B conf
Optimal broadcast on parallel locality models.
SIROCCO
Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping
1998 A conf
On Nonblocking Properties on the Benes Network.
ESA
Petr Kolman
1997 B conf
PRAM Lower Bound for Element Distinctness Revisited.
SOFSEM
Petr Kolman