default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLyudmil Aleksandrov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c10]Lyudmil Aleksandrov, Guillaume Chapuis, Hristo N. Djidjev
:
Parallel Shortest-Path Queries in Planar Graphs. HPGP@HPDC 2016: 9-16- 2013
- [j6]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): 124-184 (2013) - [c9]Hristo N. Djidjev, Lyudmil Aleksandrov:
Generation of SSH Network Traffic Data for IDS Testbeds. CSET 2013 - 2011
- [i1]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 abs/1102.3165 (2011) - 2010
- [j5]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): 762-801 (2010)
2000 – 2009
- 2006
- [j4]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari:
Partitioning planar graphs with costs and weights. ACM J. Exp. Algorithmics 11 (2006) - [c8]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: 98-109 - 2005
- [j3]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack:
Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52(1): 25-53 (2005) - 2003
- [c7]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack:
An Improved Approximation Algorithm for Computing Geometric Shortest Paths. FCT 2003: 246-257 - 2002
- [c6]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari:
Partitioning Planar Graphs with Costs and Weights. ALENEX 2002: 98-110 - 2000
- [j2]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): 157-188 (2000) - [c5]Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack:
Approximation algorithms for geometric shortest path problems. STOC 2000: 286-295 - [c4]Lyudmil Aleksandrov, Hristo N. Djidjev:
A Dynamic Algorithm for Maintaining Graph Partitions. SWAT 2000: 71-82
1990 – 1999
- 1998
- [c3]Lyudmil Aleksandrov, Hristo N. Djidjev:
Maintaining partitions of dynamic planar meshes. CCCG 1998 - [c2]Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack:
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. SWAT 1998: 11-22 - 1996
- [j1]Lyudmil Aleksandrov, Hristo N. Djidjev:
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus. SIAM J. Discret. Math. 9(1): 129-150 (1996)
1980 – 1989
- 1989
- [c1]Lyudmil Aleksandrov, Hristo N. Djidjev:
Improved Bounds on the Size of Separators of Toroidal Graphs. Optimal Algorithms 1989: 126-138
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
