Coverage Problems in Sensor Networks.

Hristo Djidjev, Miodrag Potkonjak.

a chapter in *Intelligent Sensor Networks: Across Sensing, Signal Processing, and Machine Learning*, CRC Press, 2012.

Scalable and Accurate Graph Clustering and Community Structure Detection.

Hristo Djidjev, Melih Onus.

*IEEE Transactions on Parallel and Distributed Systems*, vol 99, no. preprint, 2012.

Planar Crossing Numbers of Graphs of Bounded Genus.

Hristo Djidjev, Imrich Vrto.

*Discrete & Computational Geometry, *48(2): 393-415, 2012.

Approximate Distance Queries for Weighted Polyhedral Surfaces.

Hristo Djidjev, Christian Sommer

European Symposium on Algorithms (ESA)*, Lecture Notes in Computer Science,* vol. 6942, pp. 579--590, 2011.

Graph Based Statistical Analysis of Network Traffic

Hristo Djidjev, Gary Sandine, Curtis Storlie, Scott Vander Wiel

*Mining and Learning with Graphs (MLG)*, San Diego, August 2011.

Approximation algorithms for computing minimum exposure paths in a sensor field.

Hristo Djidjev.

*ACM Transactions of Sensor Networks *vol. 7, no. 3, pp. 1-23, 2010.

A faster algorithm for computing the girth of planar and bounded genus graphs

Hristo Djidjev.

*ACM Transactions on Algorithms (TALG)*, 2010.

Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surface.

Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Joerg-R. Sack.

*Discrete and Computational Geometry, *vol. 44 (4), pp. 762-801, 2010.

Partitioning Planar Graphs with Costs and Weights.

Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo and Anil Maheshwari.

*ACM Journal of Experimental Algorithmics*, 2007, LA-UR-06-3187.

A Linear Algorithm for the Maximal Planar Subgraph Problem.

Hristo Djidjev.

*SIAM Journal on Discrete Mathematics *, 2006, LA-UR-06-0432.

Planar Crossing Numbers of Genus-g Graphs.

Hristo Djidjev and Imrich Vrt'o.

*Proc. of International Colloquium on Automata, Languages, and Programming (ICALP), 2006, LA-UR-06-1474.*.

Approximate Shortest Path Queries on Weighted Polyhedral Surfaces.

L. Aleksandrov, H. Djidjev, H. Guo, A. Maheshwari, D. Nussbaum and J.-R. Sack.

*Proc. of Mathematical Foundations of Computer Science (MFCS), 2006, LA-UR-06-1475.*.

An Improved Lower Bound for Crossing Numbers.

H. Djidjev and I. Vrto.

*Proc. 9th Intl. Symp. on Graph Drawing*, Lecture Notes in Computer Science 2265, Springer Verlag, Berlin, 2002, pp. 96-101.

Force-directed methods for smoothing unstructured triangular and tetrahedral meshes.

Hristo Djidjev.

*Proceedings of the 9th International Meshing Roundtable*, October 2-5, 2000, New Orleans, pp. 395-406.

Partitioning Graphs with Vertex Costs: Algorithms and Applications.

Hristo Djidjev.

*Algorithmica *, vol. 28 (2000), pp. 51-75.

A preliminary version appeared in Lecture Notes in Computer Science, vol. 1284, pp. 130-143.

Link Distance Problems.

A. Maheshwari, J.R. Sack, and H. Djidjev.

Chapter in *Handbook on Computational Geometry*, Elsevier, 2000, pp. 519-558.

Computing the girth of a planar graph.

Hristo Djidjev.

International Colloquium on Automata, Languages and Programming (ICALP'00), *Lecture Notes in Computer Science*, vol. 1853, 2000, pp. 821-831.

A Dynamic algorithm for maintaining graph partitions.

Lyudmil Aleksandrov and Hristo Djidjev.

Scandinavian Workshop on Algorithm Theory (SWAT'00), *Lecture Notes in Computer Science*, vol. 1851, 2000, pp. 71-82.

Separators in Graphs with Negative and Multiple Vertex Weights.

Hristo Djidjev and John Gilbert.

A journal version appeared in *Algorithmica*, vol. 23 (1999), pp. 57-71.

Finding a shortest central link segment of a simple polygon in O(*n* log *n*) time.

L. Alexandrov, H. Djidjev, J.-R. Sack .

*International Journal of Computational Geometry and Applications*, 1999 (accepted).

Improved Algorithms for Dynamic Shortest Paths.

H. Djidjev, G. Pantziou and C. Zaroliagis.

A journal version to appear in *Algorithmica*, 1999.

Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus.

Lyudmil Aleksandrov and Hristo Djidjev.

*SIAM Journal of Discrete Mathematics *, vol. 9 (1996), pp. 129-150.

Efficient Algorithms for Shortest Path Queries in Planar Digraphs.

Hristo Djidjev.

Proc. 22nd Workshop on Graph-Theoretic Concepts in Computer Science (WG '96)

*Lecture Notes in Computer Science*, Springer-Verlag, 1996, pp. 151-165.

On Computing Voronoi Diagrams for Sorted Point Sets.

Hristo Djidjev and Andrzej Lingas.

*International Journal of Computational Geometry*, vol. 5 (1995), pp. 327-337.

Planarization of Graphs Embedded on Surfaces.

Hristo Djidjev and Shankar Venkatesan.

in Proc. 21st Workshop on Graph-Theoretic Concepts in Computer Science (WG '95),

*Lecture Notes in Computer Science* , vol. 1017, pp. 62-72, Springer-Verlag, 1995.

On Drawing a Graph Convexly in the Plane.

Hristo Djidjev.

Graph Drawing '94, DIMACS International Workshop,

*Lecture Notes in Computer Science*, vol. 894, Springer-Verlag, 1995, pp. 76-83.

An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs.

Hristo Djidjev, John Reif.

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing, 1991.