Follow
Hristo Djidjev
Hristo Djidjev
Verified email at lanl.gov
Title
Cited by
Cited by
Year
Quantum algorithm implementations for beginners
J Abhijith, A Adedoyin, J Ambrosiano, P Anisimov, A Bärtschi, W Casper, ...
arXiv e-prints, arXiv: 1804.03719, 2018
155*2018
On the problem of partitioning planar graphs
HN Djidjev
SIAM Journal on Algebraic Discrete Methods 3 (2), 229-240, 1982
1451982
Efficient algorithms for shortest path queries in planar digraphs
HN Djidjev
International Workshop on Graph-Theoretic Concepts in Computer Science, 151-165, 1996
881996
Linear algorithms for partitioning embedded graphs of bounded genus
L Aleksandrov, H Djidjev
SIAM Journal on Discrete Mathematics 9 (1), 129-150, 1996
801996
Intelligent sensor networks: the integration of sensor networks, signal processing and machine learning
F Hu, Q Hao
Taylor & Francis, 2012
702012
A scalable multilevel algorithm for graph clustering and community structure detection
HN Djidjev
International workshop on algorithms and models for the web-graph, 117-128, 2006
692006
Reduced constants for simple cycle graph separation
HN Djidjev, SM Venkatesan
Acta informatica 34 (3), 231-243, 1997
681997
Edge separators of planar and outerplanar graphs with applications
K Diks, HN Djidjev, O Sykora, I Vrto
Journal of Algorithms 14 (2), 258-279, 1993
681993
Link distance problems
A Maheshwari, JR Sack, HN Djidjev
Handbook of Computational Geometry, 519-558, 2000
662000
Computing shortest paths and distances in planar graphs
HN Djidjev, GE Pantziou, CD Zaroliagis
International Colloquium on Automata, Languages, and Programming, 327-338, 1991
641991
Finding maximum cliques on the D-Wave quantum annealer
G Chapuis, H Djidjev, G Hahn, G Rizk
Journal of Signal Processing Systems 91 (3), 363-377, 2019
602019
Force-directed methods for smoothing unstructured triangular and tetrahedral meshes
HN Djidjev
In Proceedings of the 9th International Meshing Roundtable, 2000
502000
On-line and dynamic algorithms for shortest path problems
HN Djidjev, GE Pantziou, CD Zaroliagis
Annual Symposium on Theoretical Aspects of Computer Science, 193-204, 1995
501995
AnO (n logn) algorithm for computing the link center of a simple polygon
HN Djidjev, A Lingas, JR Sack
Discrete & Computational Geometry 8 (2), 131-152, 1992
491992
Quantum algorithm implementations for beginners
J Abhijith, A Adedoyin, J Ambrosiano, P Anisimov, A Bärtschi, W Casper, ...
arXiv e-prints, arXiv: 1804.03719, 2018
472018
A linear algorithm for partitioning graphs of fixed genus
HN Djidjev
Serdica. Bulgariacae mathematicae publicationes 11 (4), 369-387, 1985
441985
A separator theorem for graphs of fixed genus
HN Djidjev
Serdica 11 (319-329), 65, 1985
441985
Improved algorithms for dynamic shortest paths
HN Djidjev, GE Pantziou, CD Zaroliagis
Algorithmica 28 (4), 367-389, 2000
422000
A separator theorem
HN Djidjev
DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE 34 (5), 643-645, 1981
421981
Graph based statistical analysis of network traffic
H Djidjev, G Sandine, C Storlie, S Vander Wiel
Proceedings of the Ninth Workshop on Mining and Learning with Graphs, 2011
412011
The system can't perform the operation now. Try again later.
Articles 1–20