The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lyudmil Aleksandrov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Lyudmil Aleksandrov, Hristo Djidjev
    Maintaining partitions of dynamic planar meshes. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. Lyudmil Aleksandrov, Hristo Djidjev
    A Dynamic Algorithm for Maintaining Graph Partitions. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:71-82 [Conf]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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.002secs, Finished in 0.002secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002