Lyudmil Aleksandrov

Publication Activity (10 Years)

Years Active: 1989-2016
Publications (10 Years): 1

Top Topics

Top Venues

Discret. Comput. Geom.

Publications

Lyudmil Aleksandrov, Guillaume Chapuis, Hristo N. Djidjev
Parallel Shortest-Path Queries in Planar Graphs. HPGP@HPDC (2016)
Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discret. Comput. Geom. 50 (1) (2013)
Hristo N. Djidjev, Lyudmil Aleksandrov
Generation of SSH Network Traffic Data for IDS Testbeds. CSET (2013)
Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains CoRR (2011)
Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discret. Comput. Geom. 44 (4) (2010)
Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS (2006)
Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari
Partitioning planar graphs with costs and weights. ACM J. Exp. Algorithmics 11 (2006)
Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52 (1) (2005)
Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
An Improved Approximation Algorithm for Computing Geometric Shortest Paths. FCT (2003)
Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari
Partitioning Planar Graphs with Costs and Weights. ALENEX (2002)
Lyudmil Aleksandrov, Hristo N. Djidjev
A Dynamic Algorithm for Maintaining Graph Partitions. SWAT (2000)
Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack
Approximation algorithms for geometric shortest path problems. STOC (2000)
Lyudmil Aleksandrov, Hristo N. Djidjev, Jörg-Rüdiger Sack
An O(n log n) Algorithm for Finding a Shortest Central Link Segment. Int. J. Comput. Geom. Appl. 10 (2) (2000)
Lyudmil Aleksandrov, Hristo N. Djidjev
Maintaining partitions of dynamic planar meshes. CCCG (1998)
Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. SWAT (1998)
Lyudmil Aleksandrov, Hristo N. Djidjev
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus. SIAM J. Discret. Math. 9 (1) (1996)
Lyudmil Aleksandrov, Hristo N. Djidjev
Improved Bounds on the Size of Separators of Toroidal Graphs. Optimal Algorithms (1989)