Lyudmil Aleksandrov - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

2016

Parallel Shortest-Path Queries in Planar GraphsLyudmil Aleksandrov, Guillaume Chapuis, Hristo Djidjev. hpdc 2016: 9-16 [doi]

2013

An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d DomainsLyudmil Aleksandrov, Hristo Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack. dcg, 50(1):124-184, 2013. [doi]

Generation of SSH Network Traffic Data for IDS TestbedsHristo Djidjev, Lyudmil Aleksandrov. uss 2013: [doi]

2010

Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral SurfacesLyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack. dcg, 44(4):762-801, 2010. [doi]

2006

Partitioning planar graphs with costs and weightsLyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari. jea, 11, 2006. [doi]

Approximate Shortest Path Queries on Weighted Polyhedral SurfacesLyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack. mfcs 2006: 98-109 [doi]

2005

Determining approximate shortest paths on weighted polyhedral surfacesLyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack. JACM, 52(1):25-53, 2005. [doi]

2003

An Improved Approximation Algorithm for Computing Geometric Shortest PathsLyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack. fct 2003: 246-257 [doi]

2002

Partitioning Planar Graphs with Costs and WeightsLyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari. alenex 2002: 98-110 [doi]

2000

A Dynamic Algorithm for Maintaining Graph PartitionsLyudmil Aleksandrov, Hristo Djidjev. swat 2000: 71-82 [doi]

An O(n log n) Algorithm for Finding a Shortest Central Link SegmentLyudmil Aleksandrov, Hristo Djidjev, Jörg-Rüdiger Sack. ijcga, 10(2):157-188, 2000.

Approximation algorithms for geometric shortest path problemsLyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack. stoc 2000: 286-295 [doi]

1998

Maintaining partitions of dynamic planar meshesLyudmil Aleksandrov, Hristo Djidjev. cccg 1998: [doi]

An epsilon-Approximation for Weighted Shortest Paths on Polyhedral SurfacesLyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack. swat 1998: 11-22 [doi]

1996

Linear Algorithms for Partitioning Embedded Graphs of BoundedGenusLyudmil Aleksandrov, Hristo Djidjev. siamdm, 9(1):129-150, 1996. [doi]

1989

Improved Bounds on the Size of Separators of Toroidal GraphsLyudmil Aleksandrov, Hristo Djidjev. oa 1989: 126-138

Sign in or sign up to see more results.

runs on WebDSL