|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12 occurrences of 10 keywords
|
|
|
|
|
Results
Found 31 publication records. Showing 31 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Petr Kolman, Christian Scheideler |
Approximate duality of multicommodity multiroute flows and cuts: single source case.  |
SODA  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Petr Kolman, Jan Kratochvíl (eds.) |
Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Christian Scheideler |
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondrej Pangrác, Heiko Schilling, Martin Skutella |
Length-bounded cuts and flows. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman (eds.) |
Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Ondrej Pangrác |
On the complexity of paths avoiding forbidden pairs. |
Discrete Applied Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jiri Sgall |
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. |
Theory of Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Tomasz Walen |
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set. |
Electr. J. Comb. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman |
Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Tomasz Walen |
Approximating reversal distance for strings with bounded number of duplicates. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman |
Single source multiroute flows and cuts on uniform capacity networks. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Christian Scheideler |
Improved bounds for the unsplittable flow problem. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Tomasz Walen |
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman |
Short length Menger's theorem and reliable optical routing. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Avraham Goldstein, Petr Kolman, Jie Zheng |
Minimum Common String Partition Problem: Hardness and Approximations. |
Electr. J. Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Marek Chrobak, Petr Kolman, Jiri Sgall |
The greedy algorithm for the minimum common string partition problem. |
ACM Transactions on Algorithms |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithms, String algorithms |
| 1 | Petr Kolman |
Approximating Reversal Distance for Strings with Bounded Number of Duplicates. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Jirí Matousek |
Crossing number, pair-crossing number, and expansion. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Christian Scheideler |
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Disjoint paths problem, Approximation, Randomized algorithms, Greedy algorithms, Unsplittable flow |
| 1 | Marek Chrobak, Petr Kolman, Jiri Sgall |
The Greedy Algorithm for the Minimum Common String Partition Problem. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Avraham Goldstein, Petr Kolman, Jie Zheng |
Minimum Common String Partition Problem: Hardness and Approximations. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman |
A note on the greedy algorithm for the unsplittable flow problem. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping |
Optimal broadcast on parallel locality models. |
J. Discrete Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman |
Short length menger's theorem and reliable optical routing. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
flow number, menger's theorem, fault-tolerant routing, path coloring |
| 1 | Petr Kolman, Christian Scheideler |
Improved bounds for the unsplittable flow problem. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman |
Algorithms for fault-tolerant routing in circuit switched networks. |
SPAA |
2002 |
DBLP DOI BibTeX RDF |
flow number, greedy algorithms, fault-tolerant routing, multicommodity flow, edge-disjoint paths |
| 1 | Jiri Sgall, Ales Pultr, Petr Kolman (eds.) |
Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings |
MFCS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Petr Kolman, Christian Scheideler |
Simple on-line algorithms for the maximum disjoint paths problem. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ben H. H. Juurlink, Petr Kolman, Friedhelm Meyer auf der Heide, Ingo Rieping |
Optimal broadcast on parallel locality models. |
SIROCCO |
2000 |
DBLP BibTeX RDF |
|
| 1 | Petr Kolman |
On Nonblocking Properties on the Benes Network. |
ESA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman |
PRAM Lower Bound for Element Distinctness Revisited. |
SOFSEM |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")