Hristo Djidjev
Hristo Djidjev
Scientist at IICT, Bulgarian Academy of Sciences and Los Alamos National Laboratory
Verified email at
Cited by
Cited by
On the problem of partitioning planar graphs
HN Djidjev
SIAM Journal on Algebraic Discrete Methods 3 (2), 229-240, 1982
Quantum algorithm implementations for beginners
PJ Coles, S Eidenbenz, S Pakin, A Adedoyin, J Ambrosiano, P Anisimov, ...
arXiv, arXiv: 1804.03719, 2018
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
Finding maximum cliques on a quantum annealer
G Chapuis, H Djidjev, G Hahn, G Rizk
Proceedings of the Computing Frontiers Conference, 63-70, 2017
Efficient algorithms for shortest path queries in planar digraphs
HN Djidjev
International Workshop on Graph-Theoretic Concepts in Computer Science, 151-165, 1996
Intelligent sensor networks: the integration of sensor networks, signal processing and machine learning
F Hu, Q Hao
Taylor & Francis, 2012
Linear algorithms for partitioning embedded graphs of bounded genus
L Aleksandrov, H Djidjev
SIAM Journal on Discrete Mathematics 9 (1), 129-150, 1996
Reduced constants for simple cycle graph separation
HN Djidjev, SM Venkatesan
Acta informatica 34, 231-243, 1997
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
Embedding algorithms for quantum annealers with chimera and pegasus connection topologies
S Zbinden, A Bärtschi, H Djidjev, S Eidenbenz
International Conference on High Performance Computing, 187-206, 2020
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
Computing shortest paths and distances in planar graphs
HN Djidjev, GE Pantziou, CD Zaroliagis
Automata, Languages and Programming: 18th International Colloquium Madrid …, 1991
Link distance problems
A Maheshwari, JR Sack, HN Djidjev
Handbook of Computational Geometry, 519-558, 2000
On computing Voronoi diagrams for sorted point sets
HN Djidjev, A Lingas
International Journal of Computational Geometry & Applications 5 (03), 327-337, 1995
On-line and dynamic algorithms for shortest path problems
HN Djidjev, GE Pantziou, CD Zaroliagis
STACS 95: 12th Annual Symposium on Theoretical Aspects of Computer Science …, 1995
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
Force-directed methods for smoothing unstructured triangular and tetrahedral meshes
HN Djidjev
Proceedings of the 9th International Meshing Roundtable, Sandia National …, 2000
Efficient multi-GPU computation of all-pairs shortest paths
H Djidjev, S Thulasidasan, G Chapuis, R Andonov, D Lavenier
2014 IEEE 28th International Parallel and Distributed Processing Symposium …, 2014
A linear algorithm for partitioning graphs of fixed genus
HN Djidjev
Serdica. Bulgariacae mathematicae publicationes 11 (4), 369-387, 1985
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
H Djidjev, J Reif
Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991
The system can't perform the operation now. Try again later.
Articles 1–20