Lyudmil Aleksandrov

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