default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Kolman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Petr Kolman
:
Approximating Spanning Tree Congestion on Graphs with Polylog Degree. IWOCA 2024: 497-508- [i5]Petr Kolman:
A Note on Approximation of Spanning Tree Congestion. CoRR abs/2410.00568 (2024) - 2020
- [j19]Petr Kolman, Martin Koutecký, Hans Raj Tiwary:
Extension Complexity, MSO Logic, and Treewidth. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j18]Katerina Altmanová, Petr Kolman, Jan Voborník:
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow. J. Graph Algorithms Appl. 24(3): 303-322 (2020) - [c17]Eden Chlamtác, Petr Kolman:
How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut. APPROX-RANDOM 2020: 41:1-41:17
2010 – 2019
- 2019
- [c16]Katerina Altmanová, Petr Kolman, Jan Voborník:
On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow. WADS 2019: 14-27 - [i4]Katerina Altmanová, Petr Kolman, Jan Voborník:
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow. CoRR abs/1902.07568 (2019) - 2018
- [j17]Petr Kolman:
On Algorithms Employing Treewidth for L-bounded Cut Problems. J. Graph Algorithms Appl. 22(2): 177-191 (2018) - 2017
- [i3]Petr Kolman:
On Algorithms for $L$-bounded Cut Problem. CoRR abs/1705.02390 (2017) - 2016
- [c15]Petr Kolman, Martin Koutecký, Hans Raj Tiwary:
Extension Complexity, MSO Logic, and Treewidth . SWAT 2016: 18:1-18:14 - 2015
- [j16]Petr Kolman, Martin Koutecký:
Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth. Electron. J. Comb. 22(4): 4 (2015) - [i2]Petr Kolman, Martin Koutecký:
Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth. CoRR abs/1502.05361 (2015) - [i1]Petr Kolman, Martin Koutecký, Hans Raj Tiwary:
Extension Complexity, MSO Logic, and Treewidth. CoRR abs/1507.04907 (2015) - 2013
- [j15]Petr Kolman, Christian Scheideler:
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory Comput. Syst. 53(2): 341-363 (2013) - 2012
- [c14]Petr Kolman, Christian Scheideler:
Approximate duality of multicommodity multiroute flows and cuts: single source case. SODA 2012: 800-810 - 2011
- [c13]Petr Kolman, Christian Scheideler:
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. STACS 2011: 129-140 - [e3]Petr Kolman, Jan Kratochvíl:
Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers. Lecture Notes in Computer Science 6986, Springer 2011, ISBN 978-3-642-25869-5 [contents] - 2010
- [j14]Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella:
Length-bounded cuts and flows. ACM Trans. Algorithms 7(1): 4:1-4:27 (2010) - [e2]Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman:
Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings. Lecture Notes in Computer Science 6108, Springer 2010, ISBN 978-3-642-13561-3 [contents]
2000 – 2009
- 2009
- [j13]Petr Kolman, Ondrej Pangrác:
On the complexity of paths avoiding forbidden pairs. Discret. Appl. Math. 157(13): 2871-2876 (2009) - 2008
- [j12]Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jirí Sgall:
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. Theory Comput. 4(1): 1-20 (2008) - 2007
- [j11]Petr Kolman, Tomasz Walen:
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set. Electron. J. Comb. 14(1) (2007) - [j10]Petr Kolman, Tomasz Walen:
Approximating reversal distance for strings with bounded number of duplicates. Discret. Appl. Math. 155(3): 327-336 (2007) - [j9]Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman:
Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discret. Math. 21(1): 141-157 (2007) - [c12]Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman:
Single source multiroute flows and cuts on uniform capacity networks. SODA 2007: 855-863 - 2006
- [j8]Petr Kolman, Christian Scheideler:
Improved bounds for the unsplittable flow problem. J. Algorithms 61(1): 20-44 (2006) - [c11]Petr Kolman, Tomasz Walen:
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set. WAOA 2006: 279-289 - 2005
- [j7]Avraham Goldstein, Petr Kolman, Jie Zheng:
Minimum Common String Partition Problem: Hardness and Approximations. Electron. J. Comb. 12 (2005) - [j6]Marek Chrobak, Petr Kolman, Jirí Sgall:
The greedy algorithm for the minimum common string partition problem. ACM Trans. Algorithms 1(2): 350-366 (2005) - [j5]Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman:
Short length Menger's theorem and reliable optical routing. Theor. Comput. Sci. 339(2-3): 315-332 (2005) - [c10]Petr Kolman:
Approximating Reversal Distance for Strings with Bounded Number of Duplicates. MFCS 2005: 580-590 - 2004
- [j4]Petr Kolman, Christian Scheideler:
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica 39(3): 209-233 (2004) - [j3]Petr Kolman, Jirí Matousek:
Crossing number, pair-crossing number, and expansion. J. Comb. Theory B 92(1): 99-113 (2004) - [c9]Marek Chrobak, Petr Kolman, Jirí Sgall:
The Greedy Algorithm for the Minimum Common String Partition Problem. APPROX-RANDOM 2004: 84-95 - [c8]Avraham Goldstein, Petr Kolman, Jie Zheng:
Minimum Common String Partition Problem: Hardness and Approximations. ISAAC 2004: 484-495 - 2003
- [j2]Petr Kolman:
A note on the greedy algorithm for the unsplittable flow problem. Inf. Process. Lett. 88(3): 101-105 (2003) - [j1]Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping:
Optimal broadcast on parallel locality models. J. Discrete Algorithms 1(2): 151-166 (2003) - [c7]Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman:
Short length menger's theorem and reliable optical routing. SPAA 2003: 246-247 - 2002
- [c6]Petr Kolman, Christian Scheideler:
Improved bounds for the unsplittable flow problem. SODA 2002: 184-193 - [c5]Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman:
Algorithms for fault-tolerant routing in circuit switched networks. SPAA 2002: 265-274 - 2001
- [c4]Petr Kolman, Christian Scheideler:
Simple on-line algorithms for the maximum disjoint paths problem. SPAA 2001: 38-47 - [e1]Jirí Sgall, Ales Pultr, Petr Kolman:
Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings. Lecture Notes in Computer Science 2136, Springer 2001, ISBN 3-540-42496-2 [contents] - 2000
- [c3]Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping:
Optimal broadcast on parallel locality models. SIROCCO 2000: 221-225
1990 – 1999
- 1998
- [c2]Petr Kolman:
On Nonblocking Properties on the Benes Network. ESA 1998: 259-270 - 1997
- [c1]Petr Kolman:
PRAM Lower Bound for Element Distinctness Revisited. SOFSEM 1997: 448-455
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 20:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
