| 2020 | ICMLA | Semantic Nonnegative Matrix Factorization with Automatic Model Determination for Topic Modeling. | Raviteja Vangara, Erik Skau, Gopinath Chennupati, Hristo N. Djidjev, Thomas Tierney, James P. Smith, Manish Bhattarai, Valentin G. Stanev, Boian S. Alexandrov |
| 2020 | QCE | Advanced anneal paths for improved quantum annealing. | Elijah Pelofske, Georg Hahn, Hristo N. Djidjev |
| 2019 | PDCAT | Peering Into the Anneal Process of a Quantum Annealer. | Elijah Pelofske, Georg Hahn, Hristo N. Djidjev |
| 2017 | PPoPP | Simple, Accurate, Analytical Time Modeling and Optimal Tile Size Selection for GPGPU Stencils. | Nirmal Prajapati, Waruna Ranasinghe, Sanjay V. Rajopadhye, Rumen Andonov, Hristo N. Djidjev, Tobias Grosser |
| 2016 | HPDC | Parallel Shortest-Path Queries in Planar Graphs. | Lyudmil Aleksandrov, Guillaume Chapuis, Hristo N. Djidjev |
| 2013 | PPAM | Parallel Seed-Based Approach to Protein Structure Similarity Detection. | Guillaume Chapuis, Mathilde Le Boudic-Jamin, Rumen Andonov, Hristo N. Djidjev, Dominique Lavenier |
| 2011 | ESA | Approximate Distance Queries for Weighted Polyhedral Surfaces. | Hristo N. Djidjev, Christian Sommer |
| 2007 | DCOSS | Efficient Computation of Minimum Exposure Paths in a Sensor Network Field. | Hristo N. Djidjev |
| 2006 | ICALP | Planar Crossing Numbers of Genus | Hristo N. Djidjev, Imrich Vrto |
| 2006 | MFCS | Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. | Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jrg-Rdiger Sack |
| 2006 | WAW | A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection. | Hristo N. Djidjev |
| 2002 | ALENEX | Partitioning Planar Graphs with Costs and Weights. | Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari |
| 2001 | GD | An Improved Lower Bound for Crossing Numbers. | Hristo N. Djidjev, Imrich Vrto |
| 2000 | ICALP | Computing the Girth of a Planar Graph. | Hristo N. Djidjev |
| 1997 | ESA | Weighted Graph Separators and Their Applications. | Hristo N. Djidjev |
| 1996 | WG | On-Line Algorithms for Shortest Path Problems on Planar Digraphs. | Hristo N. Djidjev |
| 1995 | FCT | Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs. | Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis |
| 1995 | STACS | On-line and Dynamic Algorithms for Shorted Path Problems. | Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis |
| 1995 | WADS | A Linear Algorithm for the Maximal Planar Subgraph Problem. | Hristo N. Djidjev |
| 1995 | WG | Planarization of Graphs Embedded on Surfaces. | Hristo N. Djidjev, Shankar M. Venkatesan |
| 1994 | GD | On Drawing a Graph Convexly in the Plane. | Hristo N. Djidjev |
| 1991 | ICALP | Computing Shortest Paths and Distances in Planar Graphs. | Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis |
| 1991 | STOC | An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs | Hristo N. Djidjev, John H. Reif |
| 1991 | WADS | On Computing the Voronoi Diagram for Restricted Planar Figures. | Hristo N. Djidjev, Andrzej Lingas |
| 1989 | STACS | An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. | Hristo N. Djidjev, Andrzej Lingas, Jrg-Rdiger Sack |
| 1988 | MFCS | Edge Separators for Planar Graphs and Their Applications. | Krzysztof Diks, Hristo N. Djidjev, Ondrej Skora, Imrich Vrto |