Hristo Djidjev
Hristo Djidjev
Email verificata su lanl.gov
TitoloCitata daAnno
On the problem of partitioning planar graphs
HN Djidjev
SIAM Journal on Algebraic Discrete Methods 3 (2), 229-240, 1982
1301982
Linear algorithms for partitioning embedded graphs of bounded genus
L Aleksandrov, H Djidjev
SIAM Journal on Discrete Mathematics 9 (1), 129-150, 1996
731996
Efficient algorithms for shortest path queries in planar digraphs
HN Djidjev
International Workshop on Graph-Theoretic Concepts in Computer Science, 151-165, 1996
721996
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
631993
Reduced constants for simple cycle graph separation
HN Djidjev, SM Venkatesan
Acta informatica 34 (3), 231-243, 1997
611997
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
592006
Link distance problems
A Maheshwari, JR Sack, HN Djidjev
Handbook of Computational Geometry, 519-558, 2000
592000
Computing shortest paths and distances in planar graphs
HN Djidjev, GE Pantziou, CD Zaroliagis
International Colloquium on Automata, Languages, and Programming, 327-338, 1991
531991
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
461992
A linear algorithm for partitioning graphs of fixed genus
HN Djidjev
SERDICA Bulgaricae mathematicae publications 11, 369-387, 1985
431985
Quantum algorithm implementations for beginners
PJ Coles, S Eidenbenz, S Pakin, A Adedoyin, J Ambrosiano, P Anisimov, ...
arXiv preprint arXiv:1804.03719, 2018
422018
Force-directed methods for smoothing unstructured triangular and tetrahedral meshes
HN Djidjev
In Proceedings of the 9th International Meshing Roundtable, 2000
422000
A separator theorem
HN Djidjev
DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE 34 (5), 643-645, 1981
411981
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
H Djidjev, JH Reif
STOC 91, 337-347, 1991
391991
A separator theorem for graphs of fixed genus
HN Djidjev, H Nikolov
Serdica 11 (319-329), 65, 1985
391985
Improved algorithms for dynamic shortest paths
HN Djidjev, GE Pantziou, CD Zaroliagis
Algorithmica 28 (4), 367-389, 2000
372000
A linear algorithm for the maximal planar subgraph problem
HN Djidjev
Workshop on Algorithms and Data Structures, 369-380, 1995
341995
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
322011
Planarization of graphs embedded on surfaces
HN Djidjev, SM Venkatesan
International Workshop on Graph-Theoretic Concepts in Computer Science, 62-72, 1995
321995
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20