Folgen
lyudmil aleksandrov
Titel
Zitiert von
Zitiert von
Jahr
Determining approximate shortest paths on weighted polyhedral surfaces
L Aleksandrov, A Maheshwari, JR Sack
Journal of the ACM (JACM) 52 (1), 25-53, 2005
1332005
Approximation algorithms for geometric shortest path problems
L Aleksandrov, A Maheshwari, JR Sack
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
1202000
An ε—approximation algorithm for weighted shortest paths on polyhedral surfaces
L Aleksandrov, M Lanthier, A Maheshwari, JR Sack
Algorithm Theory—SWAT'98: 6th Scandinavian Workshop on Algorithm Theory …, 1998
1181998
Linear algorithms for partitioning embedded graphs of bounded genus
L Aleksandrov, H Djidjev
SIAM Journal on Discrete Mathematics 9 (1), 129-150, 1996
791996
Algorithms for approximate shortest path queries on weighted polyhedral surfaces
L Aleksandrov, HN Djidjev, H Guo, A Maheshwari, D Nussbaum, JR Sack
Discrete & Computational Geometry 44 (4), 762-801, 2010
362010
An improved approximation algorithm for computing geometric shortest paths
L Aleksandrov, A Maheshwari, JR Sack
International Symposium on Fundamentals of Computation Theory, 246-257, 2003
352003
Partitioning planar graphs with costs and weights
L Aleksandrov, H Djidjev, H Guo, A Maheshwari
Journal of Experimental Algorithmics (JEA) 11, 1.5-es, 2007
272007
An ε-approximation algorithm for weighted shortest path queries on polyhedral surfaces
L Aleksandrov, M Lanthier, A Maheshwari, JR Sack
Proc. 14th Euro CG Barcelona, 19-21, 1998
171998
An approximation algorithm for computing shortest paths in weighted 3-d domains
L Aleksandrov, H Djidjev, A Maheshwari, JR Sack
Discrete & Computational Geometry 50, 124-184, 2013
142013
Approximate shortest path queries on weighted polyhedral surfaces
L Aleksandrov, HN Djidjev, H Guo, A Maheshwari, D Nussbaum, JR Sack
International Symposium on Mathematical Foundations of Computer Science, 98-109, 2006
142006
Partitioning planar graphs with costs and weights
L Aleksandrov, H Djidjev, H Guo, A Maheshwari
Workshop on Algorithm Engineering and Experimentation, 98-110, 2002
132002
Improved bounds on the size of separators of toroidal graphs
LG Aleksandrov, HN Djidjev
Optimal Algorithms: International Symposium Varna, Bulgaria, May 29–June 2 …, 1989
51989
A dynamic algorithm for maintaining graph partitions
LG Aleksandrov, HN Djidjev
Scandinavian Workshop on Algorithm Theory, 71-82, 2000
32000
An O (n log n) algorithm for finding a shortest central link segment
LG Aleksandrov, HN Djidjev, JR Sack
International Journal of Computational Geometry & Applications 10 (02), 157-188, 2000
22000
Generation of {SSH} Network Traffic Data for {IDS} Testbeds
H Djidjev, L Aleksandrov
6th Workshop on Cyber Security Experimentation and Test (CSET 13), 2013
12013
Methods for implementing linear algebra algorithms on high performance architectures
L Aleksandrov, M Candev, H Djidjev
online].[retrieved May 11, 2007]. Retrieved from the Internet 28, 1997
11997
Parallel Shortest-Path Queries in Planar Graphs
L Aleksandrov, G Chapuis, H Djidjev
Proceedings of the ACM Workshop on High Performance Graph Processing, 9-16, 2016
2016
Network Traffic Generator for Cyber Security Testbeds
H Djidjev, L Aleksandrov
Comput Secur 28, 18, 2009
2009
An ϵ-Approximation algorithm for weighted shortest paths on polyhedral surfaces
A Maheshwari, JR Sack, M Lanthier, L Aleksandrov
Springer Berlin Heidelberg, 1998
1998
Maintaining partitions of dynamic planar meshes.
L Aleksandrov, HN Djidjev
CCCG, 1998
1998
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20