The SCEAS System
| |||||||

## Search the dblp DataBase
Lyudmil Aleksandrov:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari
**Partitioning Planar Graphs with Costs and Weights.**[Citation Graph (0, 0)][DBLP] ALENEX, 2002, pp:98-110 [Conf] - Lyudmil Aleksandrov, Hristo Djidjev
**Maintaining partitions of dynamic planar meshes.**[Citation Graph (0, 0)][DBLP] CCCG, 1998, pp:- [Conf] - Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
**An Improved Approximation Algorithm for Computing Geometric Shortest Paths.**[Citation Graph (0, 0)][DBLP] FCT, 2003, pp:246-257 [Conf] - Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
**Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.**[Citation Graph (0, 0)][DBLP] MFCS, 2006, pp:98-109 [Conf] - Lyudmil Aleksandrov, Hristo Djidjev
**Improved Bounds on the Size of Separators of Toroidal Graphs.**[Citation Graph (0, 0)][DBLP] Optimal Algorithms, 1989, pp:126-138 [Conf] - Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
**Approximation algorithms for geometric shortest path problems.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:286-295 [Conf] - Lyudmil Aleksandrov, Hristo Djidjev
**A Dynamic Algorithm for Maintaining Graph Partitions.**[Citation Graph (0, 0)][DBLP] SWAT, 2000, pp:71-82 [Conf] - Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
**An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces.**[Citation Graph (0, 0)][DBLP] SWAT, 1998, pp:11-22 [Conf] - Lyudmil Aleksandrov, Hristo Djidjev, Jörg-Rüdiger Sack
**An O(n log n) Algorithm for Finding a Shortest Central Link Segment.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2000, v:10, n:2, pp:157-188 [Journal] - Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
**Determining approximate shortest paths on weighted polyhedral surfaces.**[Citation Graph (0, 0)][DBLP] J. ACM, 2005, v:52, n:1, pp:25-53 [Journal] - Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari
**Partitioning planar graphs with costs and weights.**[Citation Graph (0, 0)][DBLP] ACM Journal of Experimental Algorithms, 2006, v:11, n:, pp:- [Journal] - Lyudmil Aleksandrov, Hristo Djidjev
**Linear Algorithms for Partitioning Embedded Graphs of BoundedGenus.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1996, v:9, n:1, pp:129-150 [Journal]
Search in 0.001secs, Finished in 0.002secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |