| |
| 2004 | ||
|---|---|---|
| 3 | Zhivko Prodanov Nedev, Tao Gong, Bryan Hill: Optimization problems in the implementation of distributed mergesort on networked computers. Parallel and Distributed Computing and Networks 2004: 404-409 | |
| 2000 | ||
| 2 | Zhivko Prodanov Nedev, Peter T. Wood: A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs. J. Algorithms 35(2): 235-259 (2000) | |
| 1999 | ||
| 1 | Zhivko Prodanov Nedev: Finding an Even Simple Path in a Directed Planar Graph. SIAM J. Comput. 29(2): 685-695 (1999) | |
| 1 | Tao Gong | [3] |
| 2 | Bryan Hill | [3] |
| 3 | Peter T. Wood | [2] |