Lyudmil Aleksandrov

According to our database, Lyudmil Aleksandrov authored at least 15 papers between 1989 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Parallel Shortest-Path Queries in Planar Graphs.

Lyudmil Aleksandrov, Guillaume Chapuis, Hristo N. Djidjev

Proceedings of the ACM Workshop on High Performance Graph Processing, 2016

2013

An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains.

Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack

Discret. Comput. Geom., 2013

Generation of SSH Network Traffic Data for IDS Testbeds.

Hristo N. Djidjev, Lyudmil Aleksandrov

Proceedings of the 6th Workshop on Cyber Security Experimentation and Test, 2013

2010

Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.

Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack

Discret. Comput. Geom., 2010

2006

Partitioning planar graphs with costs and weights.

Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari

ACM J. Exp. Algorithmics, 2006

Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.

Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005

Determining approximate shortest paths on weighted polyhedral surfaces.

Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack

J. ACM, 2005

2003

An Improved Approximation Algorithm for Computing Geometric Shortest Paths.

Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2000

An O(n log n) Algorithm for Finding a Shortest Central Link Segment.

Lyudmil Aleksandrov, Hristo N. Djidjev, Jörg-Rüdiger Sack

Int. J. Comput. Geom. Appl., 2000

A Dynamic Algorithm for Maintaining Graph Partitions.

Lyudmil Aleksandrov, Hristo N. Djidjev

Proceedings of the Algorithm Theory, 2000

Approximation algorithms for geometric shortest path problems.

Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1998

An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces.

Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack

Proceedings of the Algorithm Theory, 1998

Maintaining partitions of dynamic planar meshes.

Lyudmil Aleksandrov, Hristo N. Djidjev

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1996

Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus.

Lyudmil Aleksandrov, Hristo N. Djidjev

SIAM J. Discret. Math., 1996

1989

Improved Bounds on the Size of Separators of Toroidal Graphs.

Lyudmil Aleksandrov, Hristo N. Djidjev

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989