The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Petr Kolman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  21. Minimum Common String Partition Problem: Hardness and Approximations. [Citation Graph (, )][DBLP]


  22. Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set. [Citation Graph (, )][DBLP]


  23. On the complexity of paths avoiding forbidden pairs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002