Hristo Djidjev

Hristo Djidjev, Melih Onus: Scalable and Accurate Graph Clustering and Community Structure Detection. IEEE Trans. Parallel Distrib. Syst. 24(5): 1022-1029 (2013)

Hristo Djidjev, Imrich Vrt'o: Planar Crossing Numbers of Graphs of Bounded Genus. Discrete & Computational Geometry 48(2): 393-415 (2012)

Hristo Djidjev, Melih Onus: Using graph partitioning for efficient network modularity optimization. Graph Partitioning and Graph Clustering 2012: 103-112

Hristo Djidjev, Christian Sommer: Approximate Distance Queries for Weighted Polyhedral Surfaces. ESA 2011: 579-590

Lyudmil Aleksandrov, Hristo 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)

Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discrete & Computational Geometry 44(4): 762-801 (2010)

Hristo Djidjev: A faster algorithm for computing the girth of planar and bounded genus graphs. ACM Transactions on Algorithms 7(1): 3 (2010)

Hristo Djidjev: Approximation algorithms for computing minimum exposure paths in a sensor field. TOSN 7(3) (2010)

Hristo Djidjev: Efficient Computation of Minimum Exposure Paths in a Sensor Network Field. DCOSS 2007: 295-308

Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari: Partitioning planar graphs with costs and weights. ACM Journal of Experimental Algorithmics 11 (2006)

Hristo Djidjev: A Linear-Time Algorithm for Finding a Maximal Planar Subgraph. SIAM J. Discrete Math. 20(2): 444-462 (2006)

Hristo Djidjev, Imrich Vrto: Planar Crossing Numbers of Genus g Graphs. ICALP (1) 2006: 419-430

Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack: Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS 2006: 98-109

Hristo Djidjev: A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection. WAW 2006: 117-128

Hristo Djidjev, Imrich Vrto: Crossing Numbers and Cutwidths. J. Graph Algorithms Appl. 7(3): 245-251 (2003)

Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari: Partitioning Planar Graphs with Costs and Weights. ALENEX 2002: 98-110

Hristo Djidjev, Imrich Vrto: An Improved Lower Bound for Crossing Numbers. Graph Drawing 2001: 96-101

Hristo Djidjev: Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications. Algorithmica 28(1): 51-75 (2000)

Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis: Improved Algorithms for Dynamic Shortest Paths. Algorithmica 28(4): 367-389 (2000)

Lyudmil Aleksandrov, Hristo Djidjev, Jörg-Rüdiger Sack: An O(n log n) Algorithm for Finding a Shortest Central Link Segment. Int. J. Comput. Geometry Appl. 10(2): 157-188 (2000)

Hristo Djidjev: Computing the Girth of a Planar Graph. ICALP 2000: 821-831

Hristo Djidjev: Force-Directed Methods for Smoothing Unstructured Triangular and Tetrahedral Meshes. IMR 2000: 395-406

Lyudmil Aleksandrov, Hristo Djidjev: A Dynamic Algorithm for Maintaining Graph Partitions. SWAT 2000: 71-82

Hristo Djidjev, John R. Gilbert: Separators in Graphs with Negative and Multiple Vertex Weights. Algorithmica 23(1): 57-71 (1999)

Lyudmil Aleksandrov, Hristo Djidjev: Maintaining partitions of dynamic planar meshes. CCCG 1998

Hristo Djidjev, Shankar M. Venkatesan: Reduced Constants for Simple Cycle Graph Separation. Acta Inf. 34(3): 231-243 (1997)

Hristo Djidjev: Weighted Graph Separators and Their Applications. ESA 1997: 130-143

Lyudmil Aleksandrov, Hristo Djidjev: Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus. SIAM J. Discrete Math. 9(1): 129-150 (1996)

Hristo Djidjev: On-Line Algorithms for Shortest Path Problems on Planar Digraphs. WG 1996: 151-165

Hristo Djidjev, Andrzej Lingas: On computing Voronoi diagrams for sorted point sets. Int. J. Comput. Geometry Appl. 5(3): 327-337 (1995)

Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis: Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs. FCT 1995: 191-200

Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis: On-line and Dynamic Algorithms for Shorted Path Problems. STACS 1995: 193-204

Hristo Djidjev: A Linear Algorithm for the Maximal Planar Subgraph Problem. WADS 1995: 369-380

Hristo Djidjev, Shankar M. Venkatesan: Planarization of Graphs Embedded on Surfaces. WG 1995: 62-72

Hristo Djidjev: On Drawing a Graph Convexly in the Plane. Graph Drawing 1994: 76-83

Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto: Edge Separators of Planar and Outerplanar Graphs with Applications. J. Algorithms 14(2): 258-279 (1993)

Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack: An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. Discrete & Computational Geometry 8: 131-152 (1992)

Hristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis: Computing Shortest Paths and Distances in Planar Graphs. ICALP 1991: 327-338

Hristo Djidjev, John H. Reif: An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs. STOC 1991: 337-347

Hristo Djidjev, Andrzej Lingas: On Computing the Voronoi Diagram for Restricted Planar Figures. WADS 1991: 54-64

Lyudmil Aleksandrov, Hristo Djidjev: Improved Bounds on the Size of Separators of Toroidal Graphs. Optimal Algorithms 1989: 126-138

Hristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack: An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. STACS 1989: 96-107

Hristo Djidjev (Ed.): Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29 - June 2, 1989, Proceedings. Lecture Notes in Computer Science 401, Springer 1989, isbn 3-540-51859-2

Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto: Edge Separators for Planar Graphs and Their Applications. MFCS 1988: 280-290

Hristo Djidjev: Linear Algorithms for Graph Separation Problems. SWAT 1988: 216-222

Hristo Djidjev: VLSI Algorithms for Combinatorial Problems. IFIP Congress 1986: 649-654