| 2008 |
|---|
| 25 | EE | Henning Bruhn,
Jakub Cerný,
Alexander Hall,
Petr Kolman,
Jiri Sgall:
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks.
Theory of Computing 4(1): 1-20 (2008) |
| 2007 |
|---|
| 24 | EE | Henning Bruhn,
Jakub Cerný,
Alexander Hall,
Petr Kolman:
Single source multiroute flows and cuts on uniform capacity networks.
SODA 2007: 855-863 |
| 23 | EE | Petr Kolman,
Tomasz Walen:
Approximating reversal distance for strings with bounded number of duplicates.
Discrete Applied Mathematics 155(3): 327-336 (2007) |
| 22 | EE | Petr Kolman,
Tomasz Walen:
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set.
Electr. J. Comb. 14(1): (2007) |
| 21 | EE | Amitabha Bagchi,
Amitabh Chaudhary,
Christian Scheideler,
Petr Kolman:
Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.
SIAM J. Discrete Math. 21(1): 141-157 (2007) |
| 2006 |
|---|
| 20 | EE | Petr Kolman,
Tomasz Walen:
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set.
WAOA 2006: 279-289 |
| 19 | EE | Petr Kolman,
Christian Scheideler:
Improved bounds for the unsplittable flow problem.
J. Algorithms 61(1): 20-44 (2006) |
| 2005 |
|---|
| 18 | EE | Petr Kolman:
Approximating Reversal Distance for Strings with Bounded Number of Duplicates.
MFCS 2005: 580-590 |
| 17 | EE | Marek Chrobak,
Petr Kolman,
Jiri Sgall:
The greedy algorithm for the minimum common string partition problem.
ACM Transactions on Algorithms 1(2): 350-366 (2005) |
| 16 | EE | Avraham Goldstein,
Petr Kolman,
Jie Zheng:
Minimum Common String Partition Problem: Hardness and Approximations.
Electr. J. Comb. 12: (2005) |
| 15 | EE | Amitabha Bagchi,
Amitabh Chaudhary,
Petr Kolman:
Short length Menger's theorem and reliable optical routing.
Theor. Comput. Sci. 339(2-3): 315-332 (2005) |
| 2004 |
|---|
| 14 | EE | Marek Chrobak,
Petr Kolman,
Jiri Sgall:
The Greedy Algorithm for the Minimum Common String Partition Problem.
APPROX-RANDOM 2004: 84-95 |
| 13 | EE | Avraham Goldstein,
Petr Kolman,
Jie Zheng:
Minimum Common String Partition Problem: Hardness and Approximations.
ISAAC 2004: 484-495 |
| 12 | EE | Petr Kolman,
Christian Scheideler:
Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.
Algorithmica 39(3): 209-233 (2004) |
| 11 | EE | Petr Kolman,
Jirí Matousek:
Crossing number, pair-crossing number, and expansion.
J. Comb. Theory, Ser. B 92(1): 99-113 (2004) |
| 2003 |
|---|
| 10 | EE | Amitabha Bagchi,
Amitabh Chaudhary,
Petr Kolman:
Short length menger's theorem and reliable optical routing.
SPAA 2003: 246-247 |
| 9 | EE | Petr Kolman:
A note on the greedy algorithm for the unsplittable flow problem.
Inf. Process. Lett. 88(3): 101-105 (2003) |
| 8 | EE | 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) |
| 2002 |
|---|
| 7 | EE | Petr Kolman,
Christian Scheideler:
Improved bounds for the unsplittable flow problem.
SODA 2002: 184-193 |
| 6 | EE | Amitabha Bagchi,
Amitabh Chaudhary,
Christian Scheideler,
Petr Kolman:
Algorithms for fault-tolerant routing in circuit switched networks.
SPAA 2002: 265-274 |
| 2001 |
|---|
| 5 | | Jiri 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
Springer 2001 |
| 4 | EE | Petr Kolman,
Christian Scheideler:
Simple on-line algorithms for the maximum disjoint paths problem.
SPAA 2001: 38-47 |
| 2000 |
|---|
| 3 | | Ben H. H. Juurlink,
Petr Kolman,
Friedhelm Meyer auf der Heide,
Ingo Rieping:
Optimal broadcast on parallel locality models.
SIROCCO 2000: 221-225 |
| 1998 |
|---|
| 2 | EE | Petr Kolman:
On Nonblocking Properties on the Benes Network.
ESA 1998: 259-270 |
| 1997 |
|---|
| 1 | | Petr Kolman:
PRAM Lower Bound for Element Distinctness Revisited.
SOFSEM 1997: 448-455 |
