Hristo N. Djidjev

134 papers A* 3A 8B 9C 4Misc 1Journal 71Unranked 36

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A quantum annealing approach to graph node embedding. CoRR Hristo N. Djidjev
2025	J	`jnl`	Extending quantum annealing to continuous domains: a hybrid method for quadratic programming. CoRR Hristo N. Djidjev
2024	—	`conf`	Replication-Based Quantum Annealing Error Mitigation. CF Hristo N. Djidjev
2023	J	`jnl`	Distributed non-negative RESCAL with automatic model selection for exascale data. J. Parallel Distributed Comput. Manish Bhattarai, Namita Kharat, Ismael Boureima, Erik Skau, Benjamin T. Nebgen, Hristo N. Djidjev, Sanjay V. Rajopadhye, James P. Smith, Boian S. Alexandrov
2023	J	`jnl`	Initial state encoding via reverse quantum annealing and h-gain features. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2023	J	`jnl`	Logical qubit implementation for quantum annealing: augmented Lagrangian approach. CoRR Hristo N. Djidjev
2023	J	`jnl`	Posiform Planting: Generating QUBO Instances for Benchmarking. CoRR Georg Hahn, Elijah Pelofske, Hristo N. Djidjev
2023	J	`jnl`	Posiform planting: generating QUBO instances for benchmarking. Frontiers Comput. Sci. Georg Hahn, Elijah Pelofske, Hristo N. Djidjev
2023	J	`jnl`	Quantum annealing with inequality constraints: the set cover problem. CoRR Hristo N. Djidjev
2023	J	`jnl`	Solving larger maximum clique problems using parallel quantum annealing. Quantum Inf. Process. Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2022	—	`conf`	Distributed Out-of-Memory SVD on CPU/GPU Architectures. HPEC Ismael Boureima, Manish Bhattarai, Maksim Ekin Eren, Nick Solovyev, Hristo N. Djidjev, Boian S. Alexandrov
2022	J	`jnl`	Distributed Out-of-Memory SVD on CPU/GPU Architectures. CoRR Ismael Boureima, Manish Bhattarai, Maksim Ekin Eren, Nick Solovyev, Hristo N. Djidjev, Boian S. Alexandrov
2022	J	`jnl`	Distributed non-negative RESCAL with Automatic Model Selection for Exascale Data. CoRR Manish Bhattarai, Namita Kharat, Erik Skau, Benjamin T. Nebgen, Hristo N. Djidjev, Sanjay V. Rajopadhye, James P. Smith, Boian S. Alexandrov
2022	J	`jnl`	Improved Protein Decoy Selection via Non-Negative Matrix Factorization. IEEE ACM Trans. Comput. Biol. Bioinform. Nasrin Akhter, Kazi Lutful Kabir, Gopinath Chennupati, Raviteja Vangara, Boian S. Alexandrov, Hristo N. Djidjev, Amarda Shehu
2022	J	`jnl`	Inferring the Dynamics of the State Evolution During Quantum Annealing. IEEE Trans. Parallel Distributed Syst. Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2022	J	`jnl`	Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2022	J	`jnl`	Quantum Algorithm Implementations for Beginners. ACM Trans. Quantum Comput. Abhijith Jayakumar, Adetokunbo Adedoyin, John Ambrosiano, Petr M. Anisimov, William Casper, Gopinath Chennupati, Carleton Coffrin, Hristo N. Djidjev, David Gunter, Satish Karra, Nathan Lemons, Shizeng Lin, Alexander Malyzhenkov, David Mascarenas, Susan M. Mniszewski, Balu Nadiga, Daniel O'Malley, Diane Oyen, Scott Pakin, Lakshman Prasad, Randy Roberts, Phillip Romero, Nandakishore Santhi, Nikolai Sinitsyn, Pieter J. Swart, James G. Wendelberger, Boram Yoon, Richard J. Zamora, Wei Zhu, Stephan J. Eidenbenz, Andreas Bärtschi, Patrick J. Coles, Marc Vuffray, Andrey Y. Lokhov
2022	J	`jnl`	Solving Larger Optimization Problems Using Parallel Quantum Annealing. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2021	—	`conf`	Boolean Hierarchical Tucker Networks on Quantum Annealers. LSSC Elijah Pelofske, Georg Hahn, Daniel O'Malley, Hristo N. Djidjev, Boian S. Alexandrov
2021	J	`jnl`	Boolean Hierarchical Tucker Networks on Quantum Annealers. CoRR Elijah Pelofske, Georg Hahn, Daniel O'Malley, Hristo N. Djidjev, Boian S. Alexandrov
2021	J	`jnl`	Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer. J. Signal Process. Syst. Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2021	J	`jnl`	Finding the Number of Latent Topics With Semantic Non-Negative Matrix Factorization. IEEE Access Raviteja Vangara, Manish Bhattarai, Erik Skau, Gopinath Chennupati, Hristo N. Djidjev, Thomas Tierney, James P. Smith, Valentin G. Stanev, Boian S. Alexandrov
2021	J	`jnl`	Parallel Quantum Annealing. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2021	J	`jnl`	Quantum Annealing Algorithms for Boolean Tensor Networks. CoRR Elijah Pelofske, Georg Hahn, Daniel O'Malley, Hristo N. Djidjev, Boian S. Alexandrov
2021	—	`conf`	Reducing quantum annealing biases for solving the graph partitioning problem. CF Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2021	J	`jnl`	Reducing quantum annealing biases for solving the graph partitioning problem. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2021	J	`jnl`	Using Machine Learning for Quantum Annealing Accuracy Prediction. Algorithms Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2021	J	`jnl`	Using machine learning for quantum annealing accuracy prediction. CoRR Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2020	Misc	`conf`	Advanced anneal paths for improved quantum annealing. QCE Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2020	J	`jnl`	Advanced anneal paths for improved quantum annealing. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2020	—	`conf`	Advanced unembedding techniques for quantum annealers. ICRC Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2020	J	`jnl`	Advanced unembedding techniques for quantum annealers. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2020	J	`jnl`	An Out of Memory tSVD for Big-Data Factorization. IEEE Access Hector Carrillo-Cabada, Erik Skau, Gopinath Chennupati, Boian S. Alexandrov, Hristo N. Djidjev
2020	—	`conf`	Automaton-based methodology for implementing optimization constraints for quantum annealing. CF Hristo N. Djidjev
2020	J	`jnl`	Decomposition algorithms for solving NP-hard problems on a quantum annealer. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2020	J	`jnl`	Decoy Selection for Protein Structure Prediction Via Extreme Gradient Boosting and Ranking. CoRR Nasrin Akhter, Gopinath Chennupati, Hristo N. Djidjev, Amarda Shehu
2020	—	`conf`	Decoy Selection in Protein Structure Determination via Symmetric Non-negative Matrix Factorization. BIBM Kazi Lutful Kabir, Gopinath Chennupati, Raviteja Vangara, Hristo N. Djidjev, Boian S. Alexandrov, Amarda Shehu
2020	J	`jnl`	Decoy selection for protein structure prediction via extreme gradient boosting and ranking. BMC Bioinform. Nasrin Akhter, Gopinath Chennupati, Hristo N. Djidjev, Amarda Shehu
2020	—	`conf`	Distributed Non-Negative Tensor Train Decomposition. HPEC Manish Bhattarai, Gopinath Chennupati, Erik Skau, Raviteja Vangara, Hristo N. Djidjev, Boian S. Alexandrov
2020	J	`jnl`	Distributed Non-Negative Tensor Train Decomposition. CoRR Manish Bhattarai, Gopinath Chennupati, Erik Skau, Raviteja Vangara, Hristo N. Djidjev, Boian S. Alexandrov
2020	J	`jnl`	Distributed non-negative matrix factorization with determination of the number of latent features. J. Supercomput. Gopinath Chennupati, Raviteja Vangara, Erik Skau, Hristo N. Djidjev, Boian S. Alexandrov
2020	C	`conf`	Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies. ISC Stefanie Zbinden, Andreas Bärtschi, Hristo N. Djidjev, Stephan J. Eidenbenz
2020	J	`jnl`	Inferring the Dynamics of the State Evolution During Quantum Annealing. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2020	J	`jnl`	Optimization Approach to Accelerator Codesign. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. Nirmal Prajapati, Sanjay V. Rajopadhye, Hristo N. Djidjev, Nandakishore Santhi, Tobias Grosser, Rumen Andonov
2020	—	`conf`	Optimizing Embedding-Related Quantum Annealing Parameters for Reducing Hardware Bias. PAAP Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2020	J	`jnl`	Optimizing embedding-related quantum annealing parameters for reducing hardware bias. CoRR Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2020	C	`conf`	Semantic Nonnegative Matrix Factorization with Automatic Model Determination for Topic Modeling. ICMLA Raviteja Vangara, Erik Skau, Gopinath Chennupati, Hristo N. Djidjev, Thomas Tierney, James P. Smith, Manish Bhattarai, Valentin G. Stanev, Boian S. Alexandrov
2020	—	`conf`	Tucker-1 Boolean Tensor Factorization with Quantum Annealers. ICRC Daniel O'Malley, Hristo N. Djidjev, Boian S. Alexandrov
2019	J	`jnl`	Complete assembly of circular and chloroplast genomes based on global optimization. J. Bioinform. Comput. Biol. Rumen Andonov, Hristo N. Djidjev, Sebastien François, Dominique Lavenier
2019	—	`conf`	Constraint Embedding for Solving Optimization Problems on Quantum Annealers. IPDPS Workshops Tomás Vyskocil, Hristo N. Djidjev
2019	J	`jnl`	Embedding Equality Constraints of Optimization Problems into a Quantum Annealer. Algorithms Tomás Vyskocil, Hristo N. Djidjev
2019	J	`jnl`	Finding Maximum Cliques on the D-Wave Quantum Annealer. J. Signal Process. Syst. Guillaume Chapuis, Hristo N. Djidjev, Georg Hahn, Guillaume Rizk
2019	—	`conf`	Non-Negative Matrix Factorization for Selection of Near-Native Protein Tertiary Structures. BIBM Nasrin Akhter, Raviteja Vangara, Gopinath Chennupati, Boian S. Alexandrov, Hristo N. Djidjev, Amarda Shehu
2019	—	`conf`	Optimizing the Spin Reversal Transform on the D-Wave 2000Q. ICRC Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2019	J	`jnl`	Optimizing the spin reversal transform on the D-Wave 2000Q. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2019	C	`conf`	Peering Into the Anneal Process of a Quantum Annealer. PDCAT Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2019	J	`jnl`	Peering into the Anneal Process of a Quantum Annealer. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2019	J	`jnl`	Solving large Maximum Clique problems on a quantum annealer. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2019	J	`jnl`	Solving large Minimum Vertex Cover problems on a quantum annealer. CoRR Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2019	—	`conf`	Solving large minimum vertex cover problems on a quantum annealer. CF Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2019	J	`jnl`	Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics. Algorithms Hristo N. Djidjev, Georg Hahn, Susan M. Mniszewski, Christian F. A. Negre, Anders M. N. Niklasson
2018	J	`jnl`	Analytical Cost Metrics : Days of Future Past. CoRR Nirmal Prajapati, Sanjay V. Rajopadhye, Hristo N. Djidjev
2018	J	`jnl`	Global Optimization for Scaffolding and Completing Genome Assemblies. Electron. Notes Discret. Math. Sebastien François, Rumen Andonov, Dominique Lavenier, Hristo N. Djidjev
2018	—	`conf`	Improved Decoy Selection via Machine Learning and Ranking. ICCABS Nasrin Akhter, Gopinath Chennupati, Hristo N. Djidjev, Amarda Shehu
2018	J	`jnl`	Quantum Algorithm Implementations for Beginners. CoRR 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, Nathan Lemons, Shizeng Lin, Andrey Y. Lokhov, Alexander Malyzhenkov, David Mascarenas, Susan M. Mniszewski, Balu Nadiga, Dan O'Malley, Diane Oyen, Lakshman Prasad, Randy Roberts, Philip Romero, Nandakishore Santhi, Nikolai Sinitsyn, Pieter J. Swart, Marc Vuffray, Jim Wendelberger, Boram Yoon, Richard J. Zamora, Wei Zhu
2018	J	`jnl`	Reducing Binary Quadratic Forms for More Scalable Quantum Annealing. CoRR Georg Hahn, Hristo N. Djidjev
2018	—	`conf`	Simple Constraint Embedding for Quantum Annealers. ICRC Tomás Vyskocil, Hristo N. Djidjev
2017	J	`jnl`	Accelerator Codesign as Non-Linear Optimization. CoRR Nirmal Prajapati, Sanjay V. Rajopadhye, Hristo N. Djidjev, Nandakishore Santhi, Tobias Grosser, Rumen Andonov
2017	—	`conf`	Embedding Inequality Constraints for Quantum Annealing Optimization. QTOP@NetSys Tomás Vyskocil, Scott Pakin, Hristo N. Djidjev
2017	—	`conf`	Finding Maximum Cliques on a Quantum Annealer. Conf. Computing Frontiers Guillaume Chapuis, Hristo N. Djidjev, Georg Hahn, Guillaume Rizk
2017	—	`conf`	Learning on Graphs for Predictions of Fracture Propagation, Flow and Transport. IPDPS Workshops Hristo N. Djidjev, Daniel O'Malley, Hari S. Viswanathan, Jeffrey D. Hyman, Satish Karra, Gowri Srinivasan
2017	—	`conf`	Reducing Binary Quadratic Forms for More Scalable Quantum Annealing. ICRC Georg Hahn, Hristo N. Djidjev
2017	B	`conf`	Simple, Accurate, Analytical Time Modeling and Optimal Tile Size Selection for GPGPU Stencils. PPoPP Nirmal Prajapati, Waruna Ranasinghe, Sanjay V. Rajopadhye, Rumen Andonov, Hristo N. Djidjev, Tobias Grosser
2017	—	`conf`	Solving Large Maximum Clique Problems on a Quantum Annealer. QTOP@NetSys Elijah Pelofske, Georg Hahn, Hristo N. Djidjev
2016	—	`conf`	Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics. CSC Hristo N. Djidjev, Georg Hahn, Susan M. Mniszewski, Christian F. A. Negre, Anders M. N. Niklasson, Vivek B. Sardeshmukh
2016	—	`conf`	Parallel Shortest-Path Queries in Planar Graphs. HPGP@HPDC Lyudmil Aleksandrov, Guillaume Chapuis, Hristo N. Djidjev
2015	J	`jnl`	All-Pairs Shortest Path algorithms for planar graph for GPU-accelerated clusters. J. Parallel Distributed Comput. Hristo N. Djidjev, Guillaume Chapuis, Rumen Andonov, Sunil Thulasidasan, Dominique Lavenier
2015	J	`jnl`	Automatic Classification of Protein Structure Using the Maximum Contact Map Overlap Metric. Algorithms Rumen Andonov, Hristo N. Djidjev, Gunnar W. Klau, Mathilde Le Boudic-Jamin, Inken Wohlers
2015	—	`conf`	Energy Modeling and Optimization for Tiled Nested-Loop Codes. IPDPS Workshops Nirmal Prajapati, Waruna Ranasinghe, Vamshi Tandrapati, Rumen Andonov, Hristo N. Djidjev, Sanjay V. Rajopadhye
2015	J	`jnl`	Parallel Seed-Based Approach to Multiple Protein Structure Similarities Detection. Sci. Program. Guillaume Chapuis, Mathilde Le Boudic-Jamin, Rumen Andonov, Hristo N. Djidjev, Dominique Lavenier
2015	—	`conf`	Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures. LSSC Guillaume Chapuis, Hristo N. Djidjev
2015	J	`jnl`	Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures. CoRR Guillaume Chapuis, Hristo N. Djidjev
2014	A	`conf`	Efficient Multi-GPU Computation of All-Pairs Shortest Paths. IPDPS Hristo N. Djidjev, Sunil Thulasidasan, Guillaume Chapuis, Rumen Andonov, Dominique Lavenier
2014	—	`conf`	Exact Protein Structure Classification Using the Maximum Contact Map Overlap Metric. AlCoB Inken Wohlers, Mathilde Le Boudic-Jamin, Hristo N. Djidjev, Gunnar W. Klau, Rumen Andonov
2013	J	`jnl`	An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discret. Comput. Geom. Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack
2013	—	`conf`	Generation of SSH Network Traffic Data for IDS Testbeds. CSET Hristo N. Djidjev, Lyudmil Aleksandrov
2013	—	`conf`	Parallel Seed-Based Approach to Protein Structure Similarity Detection. PPAM (2) Guillaume Chapuis, Mathilde Le Boudic-Jamin, Rumen Andonov, Hristo N. Djidjev, Dominique Lavenier
2013	J	`jnl`	Scalable and Accurate Graph Clustering and Community Structure Detection. IEEE Trans. Parallel Distributed Syst. Hristo N. Djidjev, Melih Onus
2012	J	`jnl`	Planar Crossing Numbers of Graphs of Bounded Genus. Discret. Comput. Geom. Hristo N. Djidjev, Imrich Vrt'o
2012	—	`conf`	Using graph partitioning for efficient network modularity optimization. Graph Partitioning and Graph Clustering Hristo N. Djidjev, Melih Onus
2011	J	`jnl`	An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains CoRR Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack
2011	A	`conf`	Approximate Distance Queries for Weighted Polyhedral Surfaces. ESA Hristo N. Djidjev, Christian Sommer
2010	J	`jnl`	A faster algorithm for computing the girth of planar and bounded genus graphs. ACM Trans. Algorithms Hristo N. Djidjev
2010	J	`jnl`	Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discret. Comput. Geom. Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
2010	J	`jnl`	Approximation algorithms for computing minimum exposure paths in a sensor field. ACM Trans. Sens. Networks Hristo N. Djidjev
2007	B	`conf`	Efficient Computation of Minimum Exposure Paths in a Sensor Network Field. DCOSS Hristo N. Djidjev
2006	J	`jnl`	A Linear-Time Algorithm for Finding a Maximal Planar Subgraph. SIAM J. Discret. Math. Hristo N. Djidjev
2006	C	`conf`	A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection. WAW Hristo N. Djidjev
2006	B	`conf`	Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack
2006	J	`jnl`	Partitioning planar graphs with costs and weights. ACM J. Exp. Algorithmics Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari
2006	—	`conf`	Planar Crossing Numbers of Genus ICALP (1) Hristo N. Djidjev, Imrich Vrto
2003	J	`jnl`	Crossing Numbers and Cutwidths. J. Graph Algorithms Appl. Hristo N. Djidjev, Imrich Vrto
2002	A	`conf`	Partitioning Planar Graphs with Costs and Weights. ALENEX Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari
2001	A	`conf`	An Improved Lower Bound for Crossing Numbers. GD Hristo N. Djidjev, Imrich Vrto
2000	—	`conf`	A Dynamic Algorithm for Maintaining Graph Partitions. SWAT Lyudmil Aleksandrov, Hristo N. Djidjev
2000	J	`jnl`	An O(n log n) Algorithm for Finding a Shortest Central Link Segment. Int. J. Comput. Geom. Appl. Lyudmil Aleksandrov, Hristo N. Djidjev, Jörg-Rüdiger Sack
2000	A*	`conf`	Computing the Girth of a Planar Graph. ICALP Hristo N. Djidjev
2000	—	`conf`	Force-Directed Methods for Smoothing Unstructured Triangular and Tetrahedral Meshes. IMR Hristo N. Djidjev
2000	J	`jnl`	Improved Algorithms for Dynamic Shortest Paths. Algorithmica Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
2000	—	`ch.`	Link Distance Problems. Handbook of Computational Geometry Anil Maheshwari, Jörg-Rüdiger Sack, Hristo N. Djidjev
2000	J	`jnl`	Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications. Algorithmica Hristo N. Djidjev
1999	J	`jnl`	Separators in Graphs with Negative and Multiple Vertex Weights. Algorithmica Hristo N. Djidjev, John R. Gilbert
1998	—	`conf`	Maintaining partitions of dynamic planar meshes. CCCG Lyudmil Aleksandrov, Hristo N. Djidjev
1997	J	`jnl`	Reduced Constants for Simple Cycle Graph Separation. Acta Informatica Hristo N. Djidjev, Shankar M. Venkatesan
1997	A	`conf`	Weighted Graph Separators and Their Applications. ESA Hristo N. Djidjev
1996	J	`jnl`	Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus. SIAM J. Discret. Math. Lyudmil Aleksandrov, Hristo N. Djidjev
1996	B	`conf`	On-Line Algorithms for Shortest Path Problems on Planar Digraphs. WG Hristo N. Djidjev
1995	B	`conf`	A Linear Algorithm for the Maximal Planar Subgraph Problem. WADS Hristo N. Djidjev
1995	B	`conf`	Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs. FCT Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
1995	J	`jnl`	On computing Voronoi diagrams for sorted point sets. Int. J. Comput. Geom. Appl. Hristo N. Djidjev, Andrzej Lingas
1995	A	`conf`	On-line and Dynamic Algorithms for Shorted Path Problems. STACS Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
1995	B	`conf`	Planarization of Graphs Embedded on Surfaces. WG Hristo N. Djidjev, Shankar M. Venkatesan
1994	A	`conf`	On Drawing a Graph Convexly in the Plane. GD Hristo N. Djidjev
1993	J	`jnl`	Edge Separators of Planar and Outerplanar Graphs with Applications. J. Algorithms Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto
1992	J	`jnl`	An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
1991	A*	`conf`	An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs STOC Hristo N. Djidjev, John H. Reif
1991	A*	`conf`	Computing Shortest Paths and Distances in Planar Graphs. ICALP Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis
1991	B	`conf`	On Computing the Voronoi Diagram for Restricted Planar Figures. WADS Hristo N. Djidjev, Andrzej Lingas
1989	A	`conf`	An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon. STACS Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
1989	—	`conf`	Improved Bounds on the Size of Separators of Toroidal Graphs. Optimal Algorithms Lyudmil Aleksandrov, Hristo N. Djidjev
1989	—	`ed.`	Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29 - June 2, 1989, Proceedings Optimal Algorithms Hristo N. Djidjev
1988	B	`conf`	Edge Separators for Planar Graphs and Their Applications. MFCS Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto
1988	—	`conf`	Linear Algorithms for Graph Separation Problems. SWAT Hristo N. Djidjev
1986	—	`conf`	VLSI Algorithms for Combinatorial Problems. IFIP Congress Hristo N. Djidjev