VLSI Algorithms for Combinatorial Problems. - Hristo N. Djidjev (IFIP Congress, 1986)

Edge Separators for Planar Graphs and Their Applications. - Krzysztof Diks; Hristo N. Djidjev; Ondrej Sýkora; Imrich Vrto (MFCS, 1988)

Linear Algorithms for Graph Separation Problems. - Hristo N. Djidjev (SWAT, 1988)

Improved Bounds on the Size of Separators of Toroidal Graphs. - Lyudmil Aleksandrov; Hristo N. Djidjev (Optimal Algorithms, 1989)

Computing Shortest Paths and Distances in Planar Graphs. - Hristo N. Djidjev; Grammati E. Pantziou; Christos D. Zaroliagis (ICALP, 1991)

An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs - Hristo N. Djidjev; John H. Reif (STOC, 1991)

On Computing the Voronoi Diagram for Restricted Planar Figures. - Hristo N. Djidjev; Andrzej Lingas (WADS, 1991)

An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. - Hristo N. Djidjev; Andrzej Lingas; Jörg-Rüdiger Sack (Discret. Comput. Geom., 1992)

Edge Separators of Planar and Outerplanar Graphs with Applications. - Krzysztof Diks; Hristo N. Djidjev; Ondrej Sýkora; Imrich Vrto (J. Algorithms, 1993)

On Drawing a Graph Convexly in the Plane. - Hristo N. Djidjev (GD, 1994)

Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs. - Hristo N. Djidjev; Grammati E. Pantziou; Christos D. Zaroliagis (FCT, 1995)

On-line and Dynamic Algorithms for Shorted Path Problems. - Hristo N. Djidjev; Grammati E. Pantziou; Christos D. Zaroliagis (STACS, 1995)

A Linear Algorithm for the Maximal Planar Subgraph Problem. - Hristo N. Djidjev (WADS, 1995)

Planarization of Graphs Embedded on Surfaces. - Hristo N. Djidjev; Shankar M. Venkatesan (WG, 1995)

On computing Voronoi diagrams for sorted point sets. - Hristo N. Djidjev; Andrzej Lingas (Int. J. Comput. Geom. Appl., 1995)

On-Line Algorithms for Shortest Path Problems on Planar Digraphs. - Hristo N. Djidjev (WG, 1996)

Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus. - Lyudmil Aleksandrov; Hristo N. Djidjev (SIAM J. Discret. Math., 1996)

Weighted Graph Separators and Their Applications. - Hristo N. Djidjev (ESA, 1997)

Reduced Constants for Simple Cycle Graph Separation. - Hristo N. Djidjev; Shankar M. Venkatesan (Acta Informatica, 1997)

Maintaining partitions of dynamic planar meshes. - Lyudmil Aleksandrov; Hristo N. Djidjev (CCCG, 1998)

Separators in Graphs with Negative and Multiple Vertex Weights. - Hristo N. Djidjev; John R. Gilbert (Algorithmica, 1999)

Link Distance Problems. - Anil Maheshwari; Jörg-Rüdiger Sack; Hristo N. Djidjev (Handbook of Computational Geometry, 2000)

Computing the Girth of a Planar Graph. - Hristo N. Djidjev (ICALP, 2000)

Force-Directed Methods for Smoothing Unstructured Triangular and Tetrahedral Meshes. - Hristo N. Djidjev (IMR, 2000)

A Dynamic Algorithm for Maintaining Graph Partitions. - Lyudmil Aleksandrov; Hristo N. Djidjev (SWAT, 2000)

Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications. - Hristo N. Djidjev (Algorithmica, 2000)

Improved Algorithms for Dynamic Shortest Paths. - Hristo N. Djidjev; Grammati E. Pantziou; Christos D. Zaroliagis (Algorithmica, 2000)

An O(n log n) Algorithm for Finding a Shortest Central Link Segment. - Lyudmil Aleksandrov; Hristo N. Djidjev; Jörg-Rüdiger Sack (Int. J. Comput. Geom. Appl., 2000)

An Improved Lower Bound for Crossing Numbers. - Hristo N. Djidjev; Imrich Vrto (GD, 2001)

Crossing Numbers and Cutwidths. - Hristo N. Djidjev; Imrich Vrto (J. Graph Algorithms Appl., 2003)

Planar Crossing Numbers of Genus g Graphs. - Hristo N. Djidjev; Imrich Vrto (ICALP (1), 2006)

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

A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection. - Hristo N. Djidjev (WAW, 2006)

Partitioning planar graphs with costs and weights. - Lyudmil Aleksandrov; Hristo N. Djidjev; Hua Guo; Anil Maheshwari (ACM J. Exp. Algorithmics, 2006)

A Linear-Time Algorithm for Finding a Maximal Planar Subgraph. - Hristo N. Djidjev (SIAM J. Discret. Math., 2006)

Efficient Computation of Minimum Exposure Paths in a Sensor Network Field. - Hristo N. Djidjev (DCOSS, 2007)

Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. - Lyudmil Aleksandrov; Hristo N. Djidjev; Hua Guo; Anil Maheshwari; Doron Nussbaum; Jörg-Rüdiger Sack (Discret. Comput. Geom., 2010)

A faster algorithm for computing the girth of planar and bounded genus graphs. - Hristo N. Djidjev (ACM Trans. Algorithms, 2010)

Approximation algorithms for computing minimum exposure paths in a sensor field. - Hristo N. Djidjev (ACM Trans. Sens. Networks, 2010)

Approximate Distance Queries for Weighted Polyhedral Surfaces. - Hristo N. Djidjev; Christian Sommer 001 (ESA, 2011)

Using graph partitioning for efficient network modularity optimization. - Hristo N. Djidjev; Melih Onus (Graph Partitioning and Graph Clustering, 2012)

Planar Crossing Numbers of Graphs of Bounded Genus. - Hristo N. Djidjev; Imrich Vrt'o (Discret. Comput. Geom., 2012)

Parallel Seed-Based Approach to Protein Structure Similarity Detection. - Guillaume Chapuis; Mathilde Le Boudic-Jamin; Rumen Andonov; Hristo N. Djidjev; Dominique Lavenier (PPAM (2), 2013)

Generation of SSH Network Traffic Data for IDS Testbeds. - Hristo N. Djidjev; Lyudmil Aleksandrov (CSET, 2013)

An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. - Lyudmil Aleksandrov; Hristo N. Djidjev; Anil Maheshwari; Jörg-Rüdiger Sack (Discret. Comput. Geom., 2013)

Scalable and Accurate Graph Clustering and Community Structure Detection. - Hristo N. Djidjev; Melih Onus (IEEE Trans. Parallel Distributed Syst., 2013)

Exact Protein Structure Classification Using the Maximum Contact Map Overlap Metric. - Inken Wohlers; Mathilde Le Boudic-Jamin; Hristo N. Djidjev; Gunnar W. Klau; Rumen Andonov (AlCoB, 2014)

Efficient Multi-GPU Computation of All-Pairs Shortest Paths. - Hristo N. Djidjev; Sunil Thulasidasan; Guillaume Chapuis; Rumen Andonov; Dominique Lavenier (IPDPS, 2014)

Energy Modeling and Optimization for Tiled Nested-Loop Codes. - Nirmal Prajapati; Waruna Ranasinghe; Vamshi Tandrapati; Rumen Andonov; Hristo N. Djidjev; Sanjay V. Rajopadhye (IPDPS Workshops, 2015)

Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures. - Guillaume Chapuis; Hristo N. Djidjev (LSSC, 2015)

Automatic Classification of Protein Structure Using the Maximum Contact Map Overlap Metric. - Rumen Andonov; Hristo N. Djidjev; Gunnar W. Klau; Mathilde Le Boudic-Jamin; Inken Wohlers (Algorithms, 2015)

All-Pairs Shortest Path algorithms for planar graph for GPU-accelerated clusters. - Hristo N. Djidjev; Guillaume Chapuis; Rumen Andonov; Sunil Thulasidasan; Dominique Lavenier (J. Parallel Distributed Comput., 2015)

Parallel Seed-Based Approach to Multiple Protein Structure Similarities Detection. - Guillaume Chapuis; Mathilde Le Boudic-Jamin; Rumen Andonov; Hristo N. Djidjev; Dominique Lavenier (Sci. Program., 2015)

Parallel Shortest-Path Queries in Planar Graphs. - Lyudmil Aleksandrov; Guillaume Chapuis; Hristo N. Djidjev (HPGP@HPDC, 2016)

Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics. - Hristo N. Djidjev; Georg Hahn; Susan M. Mniszewski; Christian F. A. Negre; Anders M. N. Niklasson; Vivek B. Sardeshmukh (CSC, 2016)

Finding Maximum Cliques on a Quantum Annealer. - Guillaume Chapuis; Hristo N. Djidjev; Georg Hahn; Guillaume Rizk (Conf. Computing Frontiers, 2017)

Reducing Binary Quadratic Forms for More Scalable Quantum Annealing. - Georg Hahn; Hristo N. Djidjev (ICRC, 2017)

Learning on Graphs for Predictions of Fracture Propagation, Flow and Transport. - Hristo N. Djidjev; Daniel O'Malley; Hari S. Viswanathan; Jeffrey D. Hyman; Satish Karra; Gowri Srinivasan (IPDPS Workshops, 2017)

Solving Large Maximum Clique Problems on a Quantum Annealer. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (QTOP@NetSys, 2017)

Embedding Inequality Constraints for Quantum Annealing Optimization. - Tomás Vyskocil; Scott Pakin; Hristo N. Djidjev (QTOP@NetSys, 2017)

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 (PPoPP, 2017)

Accelerator Codesign as Non-Linear Optimization. - Nirmal Prajapati; Sanjay V. Rajopadhye; Hristo N. Djidjev; Nandakishore Santhi; Tobias Grosser; Rumen Andonov (CoRR, 2017)

Improved Decoy Selection via Machine Learning and Ranking. - Nasrin Akhter; Gopinath Chennupati; Hristo N. Djidjev; Amarda Shehu (ICCABS, 2018)

Simple Constraint Embedding for Quantum Annealers. - Tomás Vyskocil; Hristo N. Djidjev (ICRC, 2018)

Analytical Cost Metrics : Days of Future Past. - Nirmal Prajapati; Sanjay V. Rajopadhye; Hristo N. Djidjev (CoRR, 2018)

Quantum Algorithm Implementations for Beginners. - Patrick J. Coles; Stephan J. Eidenbenz; Scott Pakin; Adetokunbo Adedoyin; John Ambrosiano; Petr M. Anisimov; William Casper; Gopinath Chennupati; Carleton Coffrin; Hristo N. Djidjev; David Gunter; Satish Karra; et al. (CoRR, 2018)

Global Optimization for Scaffolding and Completing Genome Assemblies. - Sebastien François; Rumen Andonov; Dominique Lavenier; Hristo N. Djidjev (Electron. Notes Discret. Math., 2018)

Non-Negative Matrix Factorization for Selection of Near-Native Protein Tertiary Structures. - Nasrin Akhter; Raviteja Vangara; Gopinath Chennupati; Boian S. Alexandrov; Hristo N. Djidjev; Amarda Shehu (BIBM, 2019)

Solving large minimum vertex cover problems on a quantum annealer. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (CF, 2019)

Optimizing the Spin Reversal Transform on the D-Wave 2000Q. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (ICRC, 2019)

Constraint Embedding for Solving Optimization Problems on Quantum Annealers. - Tomás Vyskocil; Hristo N. Djidjev (IPDPS Workshops, 2019)

Peering Into the Anneal Process of a Quantum Annealer. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (PDCAT, 2019)

Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics. - Hristo N. Djidjev; Georg Hahn; Susan M. Mniszewski; Christian F. A. Negre; Anders M. N. Niklasson (Algorithms, 2019)

Embedding Equality Constraints of Optimization Problems into a Quantum Annealer. - Tomás Vyskocil; Hristo N. Djidjev (Algorithms, 2019)

Complete assembly of circular and chloroplast genomes based on global optimization. - Rumen Andonov; Hristo N. Djidjev; Sebastien François; Dominique Lavenier (J. Bioinform. Comput. Biol., 2019)

Finding Maximum Cliques on the D-Wave Quantum Annealer. - Guillaume Chapuis; Hristo N. Djidjev; Georg Hahn; Guillaume Rizk (J. Signal Process. Syst., 2019)

Decoy Selection in Protein Structure Determination via Symmetric Non-negative Matrix Factorization. - Kazi Lutful Kabir; Gopinath Chennupati; Raviteja Vangara; Hristo N. Djidjev; Boian S. Alexandrov; Amarda Shehu (BIBM, 2020)

Automaton-based methodology for implementing optimization constraints for quantum annealing. - Hristo N. Djidjev (CF, 2020)

Distributed Non-Negative Tensor Train Decomposition. - Manish Bhattarai; Gopinath Chennupati; Erik Skau; Raviteja Vangara; Hristo N. Djidjev; Boian S. Alexandrov (HPEC, 2020)

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 (ICMLA, 2020)

Tucker-1 Boolean Tensor Factorization with Quantum Annealers. - Daniel O'Malley; Hristo N. Djidjev; Boian S. Alexandrov (ICRC, 2020)

Advanced unembedding techniques for quantum annealers. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (ICRC, 2020)

Optimizing Embedding-Related Quantum Annealing Parameters for Reducing Hardware Bias. - Aaron Barbosa; Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (PAAP, 2020)

Advanced anneal paths for improved quantum annealing. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (QCE, 2020)

Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies. - Stefanie Zbinden; Andreas Bärtschi; Hristo N. Djidjev; Stephan J. Eidenbenz (ISC, 2020)

An Out of Memory tSVD for Big-Data Factorization. - Hector Carrillo-Cabada; Erik Skau; Gopinath Chennupati; Boian S. Alexandrov; Hristo N. Djidjev (IEEE Access, 2020)

Decoy selection for protein structure prediction via extreme gradient boosting and ranking. - Nasrin Akhter; Gopinath Chennupati; Hristo N. Djidjev; Amarda Shehu (BMC Bioinform., 2020)

Optimization Approach to Accelerator Codesign. - Nirmal Prajapati; Sanjay V. Rajopadhye; Hristo N. Djidjev; Nandakishore Santhi; Tobias Grosser; Rumen Andonov (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020)

Distributed non-negative matrix factorization with determination of the number of latent features. - Gopinath Chennupati; Raviteja Vangara; Erik Skau; Hristo N. Djidjev; Boian S. Alexandrov (J. Supercomput., 2020)

Reducing quantum annealing biases for solving the graph partitioning problem. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (CF, 2021)

Boolean Hierarchical Tucker Networks on Quantum Annealers. - Elijah Pelofske; Georg Hahn; Daniel O'Malley; Hristo N. Djidjev; Boian S. Alexandrov (LSSC, 2021)

Finding the Number of Latent Topics With Semantic Non-Negative Matrix Factorization. - Raviteja Vangara; Manish Bhattarai; Erik Skau; Gopinath Chennupati; Hristo N. Djidjev; Thomas Tierney; James P. Smith; Valentin G. Stanev; Boian S. Alexandrov (IEEE Access, 2021)

Using Machine Learning for Quantum Annealing Accuracy Prediction. - Aaron Barbosa; Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (Algorithms, 2021)

Quantum Annealing Algorithms for Boolean Tensor Networks. - Elijah Pelofske; Georg Hahn; Daniel O'Malley; Hristo N. Djidjev; Boian S. Alexandrov (CoRR, 2021)

Parallel Quantum Annealing. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (CoRR, 2021)

Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (J. Signal Process. Syst., 2021)

Distributed Out-of-Memory SVD on CPU/GPU Architectures. - Ismael Boureima; Manish Bhattarai; Maksim Ekin Eren; Nick Solovyev 001; Hristo N. Djidjev; Boian S. Alexandrov (HPEC, 2022)

Distributed non-negative RESCAL with Automatic Model Selection for Exascale Data. - Manish Bhattarai; Namita Kharat; Erik Skau; Benjamin T. Nebgen; Hristo N. Djidjev; Sanjay V. Rajopadhye; James P. Smith; Boian S. Alexandrov (CoRR, 2022)

Solving Larger Optimization Problems Using Parallel Quantum Annealing. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (CoRR, 2022)

Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (CoRR, 2022)

Improved Protein Decoy Selection via Non-Negative Matrix Factorization. - Nasrin Akhter; Kazi Lutful Kabir; Gopinath Chennupati; Raviteja Vangara; Boian S. Alexandrov; Hristo N. Djidjev; Amarda Shehu (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)

Inferring the Dynamics of the State Evolution During Quantum Annealing. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (IEEE Trans. Parallel Distributed Syst., 2022)

Logical qubit implementation for quantum annealing: augmented Lagrangian approach. - Hristo N. Djidjev (CoRR, 2023)

Quantum annealing with inequality constraints: the set cover problem. - Hristo N. Djidjev (CoRR, 2023)

Initial state encoding via reverse quantum annealing and h-gain features. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (CoRR, 2023)

Posiform planting: generating QUBO instances for benchmarking. - Georg Hahn; Elijah Pelofske; Hristo N. Djidjev (Frontiers Comput. Sci., 2023)

Solving larger maximum clique problems using parallel quantum annealing. - Elijah Pelofske; Georg Hahn; Hristo N. Djidjev (Quantum Inf. Process., 2023)

Distributed non-negative RESCAL with automatic model selection for exascale data. - Manish Bhattarai; Namita Kharat; Ismael Boureima; Erik Skau; Benjamin T. Nebgen; Hristo N. Djidjev; Sanjay V. Rajopadhye; James P. Smith; Boian S. Alexandrov (J. Parallel Distributed Comput., 2023)

Replication-Based Quantum Annealing Error Mitigation. - Hristo N. Djidjev (CF, 2024)

A quantum annealing approach to graph node embedding. - Hristo N. Djidjev (CoRR, 2025)

Extending quantum annealing to continuous domains: a hybrid method for quadratic programming. - Hristo N. Djidjev (CoRR, 2025)