| 2006 |
|---|
| 12 | EE | Lyudmil Aleksandrov,
Hristo Djidjev,
Hua Guo,
Anil Maheshwari,
Doron Nussbaum,
Jörg-Rüdiger Sack:
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.
MFCS 2006: 98-109 |
| 11 | EE | Lyudmil Aleksandrov,
Hristo Djidjev,
Hua Guo,
Anil Maheshwari:
Partitioning planar graphs with costs and weights.
ACM Journal of Experimental Algorithmics 11: (2006) |
| 2005 |
|---|
| 10 | EE | Lyudmil Aleksandrov,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Determining approximate shortest paths on weighted polyhedral surfaces.
J. ACM 52(1): 25-53 (2005) |
| 2003 |
|---|
| 9 | EE | Lyudmil Aleksandrov,
Anil Maheshwari,
Jörg-Rüdiger Sack:
An Improved Approximation Algorithm for Computing Geometric Shortest Paths.
FCT 2003: 246-257 |
| 2002 |
|---|
| 8 | EE | Lyudmil Aleksandrov,
Hristo Djidjev,
Hua Guo,
Anil Maheshwari:
Partitioning Planar Graphs with Costs and Weights.
ALENEX 2002: 98-110 |
| 2000 |
|---|
| 7 | EE | Lyudmil Aleksandrov,
Anil Maheshwari,
Jörg-Rüdiger Sack:
Approximation algorithms for geometric shortest path problems.
STOC 2000: 286-295 |
| 6 | EE | Lyudmil Aleksandrov,
Hristo Djidjev:
A Dynamic Algorithm for Maintaining Graph Partitions.
SWAT 2000: 71-82 |
| 5 | | Lyudmil Aleksandrov,
Hristo Djidjev,
Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Finding a Shortest Central Link Segment.
Int. J. Comput. Geometry Appl. 10(2): 157-188 (2000) |
| 1998 |
|---|
| 4 | EE | Lyudmil Aleksandrov,
Hristo Djidjev:
Maintaining partitions of dynamic planar meshes.
CCCG 1998 |
| 3 | EE | Lyudmil Aleksandrov,
Mark Lanthier,
Anil Maheshwari,
Jörg-Rüdiger Sack:
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces.
SWAT 1998: 11-22 |
| 1996 |
|---|
| 2 | EE | Lyudmil Aleksandrov,
Hristo Djidjev:
Linear Algorithms for Partitioning Embedded Graphs of BoundedGenus.
SIAM J. Discrete Math. 9(1): 129-150 (1996) |
| 1989 |
|---|
| 1 | | Lyudmil Aleksandrov,
Hristo Djidjev:
Improved Bounds on the Size of Separators of Toroidal Graphs.
Optimal Algorithms 1989: 126-138 |
