default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHristo N. Djidjev
Person information
- affiliation: Los Alamos National Laboratory, NM, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c61]Hristo N. Djidjev
:
Replication-Based Quantum Annealing Error Mitigation. CF 2024- 2023
- [j38]Georg Hahn, Elijah Pelofske, Hristo N. Djidjev:
Posiform planting: generating QUBO instances for benchmarking. Frontiers Comput. Sci. 5 (2023) - [j37]Manish Bhattarai, Namita Kharat, Ismael Boureima, Erik Skau, Benjamin T. Nebgen, Hristo N. Djidjev, Sanjay V. Rajopadhye, James P. Smith, Boian S. Alexandrov:
Distributed non-negative RESCAL with automatic model selection for exascale data. J. Parallel Distributed Comput. 179: 104709 (2023) - [j36]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving larger maximum clique problems using parallel quantum annealing. Quantum Inf. Process. 22(5): 219 (2023) - [i30]Hristo N. Djidjev:
Logical qubit implementation for quantum annealing: augmented Lagrangian approach. CoRR abs/2301.12393 (2023) - [i29]Hristo N. Djidjev:
Quantum annealing with inequality constraints: the set cover problem. CoRR abs/2302.11185 (2023) - [i28]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Initial state encoding via reverse quantum annealing and h-gain features. CoRR abs/2303.13748 (2023) - [i27]Georg Hahn, Elijah Pelofske, Hristo N. Djidjev:
Posiform Planting: Generating QUBO Instances for Benchmarking. CoRR abs/2308.05859 (2023) - 2022
- [j35]Nasrin Akhter, Kazi Lutful Kabir, Gopinath Chennupati, Raviteja Vangara, Boian S. Alexandrov, Hristo N. Djidjev, Amarda Shehu:
Improved Protein Decoy Selection via Non-Negative Matrix Factorization. IEEE ACM Trans. Comput. Biol. Bioinform. 19(3): 1670-1682 (2022) - [j34]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Inferring the Dynamics of the State Evolution During Quantum Annealing. IEEE Trans. Parallel Distributed Syst. 33(2): 310-321 (2022) - [c60]Ismael Boureima, Manish Bhattarai, Maksim Ekin Eren, Nick Solovyev, Hristo N. Djidjev, Boian S. Alexandrov:
Distributed Out-of-Memory SVD on CPU/GPU Architectures. HPEC 2022: 1-8 - [i26]Manish Bhattarai, Namita Kharat, Erik Skau, Benjamin T. Nebgen, Hristo N. Djidjev, Sanjay V. Rajopadhye, James P. Smith, Boian S. Alexandrov:
Distributed non-negative RESCAL with Automatic Model Selection for Exascale Data. CoRR abs/2202.09512 (2022) - [i25]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving Larger Optimization Problems Using Parallel Quantum Annealing. CoRR abs/2205.12165 (2022) - [i24]Ismael Boureima, Manish Bhattarai, Maksim Ekin Eren, Nick Solovyev, Hristo N. Djidjev, Boian S. Alexandrov:
Distributed Out-of-Memory SVD on CPU/GPU Architectures. CoRR abs/2208.08410 (2022) - [i23]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits. CoRR abs/2209.05648 (2022) - 2021
- [j33]Raviteja Vangara, Manish Bhattarai, Erik Skau, Gopinath Chennupati, Hristo N. Djidjev, Thomas Tierney, James P. Smith, Valentin G. Stanev, Boian S. Alexandrov:
Finding the Number of Latent Topics With Semantic Non-Negative Matrix Factorization. IEEE Access 9: 117217-117231 (2021) - [j32]Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Using Machine Learning for Quantum Annealing Accuracy Prediction. Algorithms 14(6): 187 (2021) - [j31]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer. J. Signal Process. Syst. 93(4): 405-420 (2021) - [c59]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Reducing quantum annealing biases for solving the graph partitioning problem. CF 2021: 133-139 - [c58]Elijah Pelofske, Georg Hahn, Daniel O'Malley, Hristo N. Djidjev, Boian S. Alexandrov:
Boolean Hierarchical Tucker Networks on Quantum Annealers. LSSC 2021: 351-358 - [i22]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Reducing quantum annealing biases for solving the graph partitioning problem. CoRR abs/2103.04963 (2021) - [i21]Elijah Pelofske, Georg Hahn, Daniel O'Malley, Hristo N. Djidjev, Boian S. Alexandrov:
Boolean Hierarchical Tucker Networks on Quantum Annealers. CoRR abs/2103.07399 (2021) - [i20]Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Using machine learning for quantum annealing accuracy prediction. CoRR abs/2106.00065 (2021) - [i19]Elijah Pelofske, Georg Hahn, Daniel O'Malley, Hristo N. Djidjev, Boian S. Alexandrov:
Quantum Annealing Algorithms for Boolean Tensor Networks. CoRR abs/2107.13659 (2021) - [i18]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Parallel Quantum Annealing. CoRR abs/2111.05995 (2021) - 2020
- [j30]Hector Carrillo-Cabada, Erik Skau, Gopinath Chennupati, Boian S. Alexandrov, Hristo N. Djidjev:
An Out of Memory tSVD for Big-Data Factorization. IEEE Access 8: 107749-107759 (2020) - [j29]Nasrin Akhter, Gopinath Chennupati, Hristo N. Djidjev, Amarda Shehu:
Decoy selection for protein structure prediction via extreme gradient boosting and ranking. BMC Bioinform. 21-S(1): 189 (2020) - [j28]Nirmal Prajapati, Sanjay V. Rajopadhye, Hristo N. Djidjev, Nandakishore Santhi, Tobias Grosser, Rumen Andonov:
Optimization Approach to Accelerator Codesign. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(6): 1300-1313 (2020) - [j27]Gopinath Chennupati, Raviteja Vangara, Erik Skau, Hristo N. Djidjev, Boian S. Alexandrov:
Distributed non-negative matrix factorization with determination of the number of latent features. J. Supercomput. 76(9): 7458-7488 (2020) - [c57]Kazi Lutful Kabir, Gopinath Chennupati, Raviteja Vangara, Hristo N. Djidjev, Boian S. Alexandrov, Amarda Shehu:
Decoy Selection in Protein Structure Determination via Symmetric Non-negative Matrix Factorization. BIBM 2020: 23-28 - [c56]Hristo N. Djidjev:
Automaton-based methodology for implementing optimization constraints for quantum annealing. CF 2020: 118-125 - [c55]Manish Bhattarai, Gopinath Chennupati, Erik Skau, Raviteja Vangara, Hristo N. Djidjev, Boian S. Alexandrov:
Distributed Non-Negative Tensor Train Decomposition. HPEC 2020: 1-10 - [c54]Raviteja Vangara, Erik Skau, Gopinath Chennupati, Hristo N. Djidjev, Thomas Tierney, James P. Smith, Manish Bhattarai, Valentin G. Stanev, Boian S. Alexandrov:
Semantic Nonnegative Matrix Factorization with Automatic Model Determination for Topic Modeling. ICMLA 2020: 328-335 - [c53]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Advanced unembedding techniques for quantum annealers. ICRC 2020: 34-41 - [c52]Daniel O'Malley, Hristo N. Djidjev, Boian S. Alexandrov:
Tucker-1 Boolean Tensor Factorization with Quantum Annealers. ICRC 2020: 58-65 - [c51]Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Optimizing Embedding-Related Quantum Annealing Parameters for Reducing Hardware Bias. PAAP 2020: 162-173 - [c50]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Advanced anneal paths for improved quantum annealing. QCE 2020: 256-266 - [c49]Stefanie Zbinden, Andreas Bärtschi, Hristo N. Djidjev, Stephan J. Eidenbenz:
Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies. ISC 2020: 187-206 - [i17]Manish Bhattarai, Gopinath Chennupati, Erik Skau, Raviteja Vangara, Hristo N. Djidjev, Boian S. Alexandrov:
Distributed Non-Negative Tensor Train Decomposition. CoRR abs/2008.01340 (2020) - [i16]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Advanced anneal paths for improved quantum annealing. CoRR abs/2009.05008 (2020) - [i15]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Advanced unembedding techniques for quantum annealers. CoRR abs/2009.05028 (2020) - [i14]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Inferring the Dynamics of the State Evolution During Quantum Annealing. CoRR abs/2009.06387 (2020) - [i13]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Decomposition algorithms for solving NP-hard problems on a quantum annealer. CoRR abs/2009.06726 (2020) - [i12]Nasrin Akhter, Gopinath Chennupati, Hristo N. Djidjev, Amarda Shehu:
Decoy Selection for Protein Structure Prediction Via Extreme Gradient Boosting and Ranking. CoRR abs/2010.01441 (2020) - [i11]Aaron Barbosa, Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Optimizing embedding-related quantum annealing parameters for reducing hardware bias. CoRR abs/2011.00719 (2020)
2010 – 2019
- 2019
- [j26]Tomás Vyskocil, Hristo N. Djidjev:
Embedding Equality Constraints of Optimization Problems into a Quantum Annealer. Algorithms 12(4): 77 (2019) - [j25]Hristo N. Djidjev, Georg Hahn, Susan M. Mniszewski, Christian F. A. Negre, Anders M. N. Niklasson:
Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics. Algorithms 12(9): 187 (2019) - [j24]Rumen Andonov, Hristo N. Djidjev, Sebastien François, Dominique Lavenier:
Complete assembly of circular and chloroplast genomes based on global optimization. J. Bioinform. Comput. Biol. 17(3): 1950014:1-1950014:23 (2019) - [j23]Guillaume Chapuis, Hristo N. Djidjev, Georg Hahn, Guillaume Rizk:
Finding Maximum Cliques on the D-Wave Quantum Annealer. J. Signal Process. Syst. 91(3-4): 363-377 (2019) - [c48]Nasrin Akhter, Raviteja Vangara, Gopinath Chennupati, Boian S. Alexandrov, Hristo N. Djidjev, Amarda Shehu:
Non-Negative Matrix Factorization for Selection of Near-Native Protein Tertiary Structures. BIBM 2019: 70-73 - [c47]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving large minimum vertex cover problems on a quantum annealer. CF 2019: 76-84 - [c46]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Optimizing the Spin Reversal Transform on the D-Wave 2000Q. ICRC 2019: 63-70 - [c45]Tomás Vyskocil, Hristo N. Djidjev:
Constraint Embedding for Solving Optimization Problems on Quantum Annealers. IPDPS Workshops 2019: 635-644 - [c44]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Peering Into the Anneal Process of a Quantum Annealer. PDCAT 2019: 184-189 - [i10]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving large Maximum Clique problems on a quantum annealer. CoRR abs/1901.07657 (2019) - [i9]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving large Minimum Vertex Cover problems on a quantum annealer. CoRR abs/1904.00051 (2019) - [i8]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Optimizing the spin reversal transform on the D-Wave 2000Q. CoRR abs/1906.10955 (2019) - [i7]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Peering into the Anneal Process of a Quantum Annealer. CoRR abs/1908.02691 (2019) - 2018
- [j22]Sebastien François, Rumen Andonov, Dominique Lavenier, Hristo N. Djidjev:
Global Optimization for Scaffolding and Completing Genome Assemblies. Electron. Notes Discret. Math. 64: 185-194 (2018) - [c43]Nasrin Akhter, Gopinath Chennupati, Hristo N. Djidjev, Amarda Shehu:
Improved Decoy Selection via Machine Learning and Ranking. ICCABS 2018: 1 - [c42]Tomás Vyskocil, Hristo N. Djidjev:
Simple Constraint Embedding for Quantum Annealers. ICRC 2018: 1-11 - [i6]Georg Hahn, Hristo N. Djidjev:
Reducing Binary Quadratic Forms for More Scalable Quantum Annealing. CoRR abs/1801.08652 (2018) - [i5]Nirmal Prajapati, Sanjay V. Rajopadhye, Hristo N. Djidjev:
Analytical Cost Metrics : Days of Future Past. CoRR abs/1802.01957 (2018) - [i4]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 Dennis Lee Mascarenas, Susan M. Mniszewski, Balu Nadiga, Dan O'Malley, Diane Oyen, Lakshman Prasad, Randy Roberts, Philip Romero, Nandakishore Santhi, Nikolai Sinitsyn, Pieter Swart, Marc Vuffray, Jim Wendelberger, Boram Yoon, Richard J. Zamora, Wei Zhu:
Quantum Algorithm Implementations for Beginners. CoRR abs/1804.03719 (2018) - 2017
- [c41]Guillaume Chapuis, Hristo N. Djidjev, Georg Hahn, Guillaume Rizk:
Finding Maximum Cliques on a Quantum Annealer. Conf. Computing Frontiers 2017: 63-70 - [c40]Georg Hahn, Hristo N. Djidjev:
Reducing Binary Quadratic Forms for More Scalable Quantum Annealing. ICRC 2017: 1-8 - [c39]Hristo N. Djidjev, Daniel O'Malley, Hari S. Viswanathan, Jeffrey D. Hyman, Satish Karra, Gowri Srinivasan:
Learning on Graphs for Predictions of Fracture Propagation, Flow and Transport. IPDPS Workshops 2017: 1532-1539 - [c38]Tomás Vyskocil, Scott Pakin, Hristo N. Djidjev:
Embedding Inequality Constraints for Quantum Annealing Optimization. QTOP@NetSys 2017: 11-22 - [c37]Elijah Pelofske, Georg Hahn, Hristo N. Djidjev:
Solving Large Maximum Clique Problems on a Quantum Annealer. QTOP@NetSys 2017: 123-135 - [c36]Nirmal Prajapati, Waruna Ranasinghe, Sanjay V. Rajopadhye, Rumen Andonov, Hristo N. Djidjev, Tobias Grosser:
Simple, Accurate, Analytical Time Modeling and Optimal Tile Size Selection for GPGPU Stencils. PPoPP 2017: 163-177 - [i3]Nirmal Prajapati, Sanjay V. Rajopadhye, Hristo N. Djidjev, Nandakishore Santhi, Tobias Grosser, Rumen Andonov:
Accelerator Codesign as Non-Linear Optimization. CoRR abs/1712.04892 (2017) - 2016
- [c35]Lyudmil Aleksandrov, Guillaume Chapuis, Hristo N. Djidjev:
Parallel Shortest-Path Queries in Planar Graphs. HPGP@HPDC 2016: 9-16 - [c34]Hristo N. Djidjev, Georg Hahn, Susan M. Mniszewski, Christian F. A. Negre, Anders M. N. Niklasson, Vivek B. Sardeshmukh:
Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics. CSC 2016: 42-51 - 2015
- [j21]Rumen Andonov, Hristo N. Djidjev, Gunnar W. Klau, Mathilde Le Boudic-Jamin, Inken Wohlers:
Automatic Classification of Protein Structure Using the Maximum Contact Map Overlap Metric. Algorithms 8(4): 850-869 (2015) - [j20]Hristo N. Djidjev, Guillaume Chapuis, Rumen Andonov, Sunil Thulasidasan, Dominique Lavenier:
All-Pairs Shortest Path algorithms for planar graph for GPU-accelerated clusters. J. Parallel Distributed Comput. 85: 91-103 (2015) - [j19]Guillaume Chapuis, Mathilde Le Boudic-Jamin, Rumen Andonov, Hristo N. Djidjev, Dominique Lavenier:
Parallel Seed-Based Approach to Multiple Protein Structure Similarities Detection. Sci. Program. 2015: 279715:1-279715:12 (2015) - [c33]Nirmal Prajapati, Waruna Ranasinghe, Vamshi Tandrapati, Rumen Andonov, Hristo N. Djidjev, Sanjay V. Rajopadhye:
Energy Modeling and Optimization for Tiled Nested-Loop Codes. IPDPS Workshops 2015: 888-895 - [c32]Guillaume Chapuis, Hristo N. Djidjev:
Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures. LSSC 2015: 53-60 - [i2]Guillaume Chapuis, Hristo N. Djidjev:
Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures. CoRR abs/1503.07192 (2015) - 2014
- [c31]Inken Wohlers, Mathilde Le Boudic-Jamin, Hristo N. Djidjev, Gunnar W. Klau, Rumen Andonov:
Exact Protein Structure Classification Using the Maximum Contact Map Overlap Metric. AlCoB 2014: 262-273 - [c30]Hristo N. Djidjev, Sunil Thulasidasan, Guillaume Chapuis, Rumen Andonov, Dominique Lavenier:
Efficient Multi-GPU Computation of All-Pairs Shortest Paths. IPDPS 2014: 360-369 - 2013
- [j18]Lyudmil Aleksandrov, Hristo N. Djidjev, Anil Maheshwari, Jörg-Rüdiger Sack:
An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains. Discret. Comput. Geom. 50(1): 124-184 (2013) - [j17]Hristo N. Djidjev, Melih Onus:
Scalable and Accurate Graph Clustering and Community Structure Detection. IEEE Trans. Parallel Distributed Syst. 24(5): 1022-1029 (2013) - [c29]Guillaume Chapuis, Mathilde Le Boudic-Jamin, Rumen Andonov, Hristo N. Djidjev, Dominique Lavenier:
Parallel Seed-Based Approach to Protein Structure Similarity Detection. PPAM (2) 2013: 278-287 - [c28]Hristo N. Djidjev, Lyudmil Aleksandrov:
Generation of SSH Network Traffic Data for IDS Testbeds. CSET 2013 - 2012
- [j16]Hristo N. Djidjev, Imrich Vrt'o:
Planar Crossing Numbers of Graphs of Bounded Genus. Discret. Comput. Geom. 48(2): 393-415 (2012) - [c27]Hristo N. Djidjev, Melih Onus:
Using graph partitioning for efficient network modularity optimization. Graph Partitioning and Graph Clustering 2012: 103-112 - 2011
- [c26]Hristo N. Djidjev, Christian Sommer:
Approximate Distance Queries for Weighted Polyhedral Surfaces. ESA 2011: 579-590 - [i1]Lyudmil Aleksandrov, Hristo N. 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) - 2010
- [j15]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discret. Comput. Geom. 44(4): 762-801 (2010) - [j14]Hristo N. Djidjev:
A faster algorithm for computing the girth of planar and bounded genus graphs. ACM Trans. Algorithms 7(1): 3:1-3:16 (2010) - [j13]Hristo N. Djidjev:
Approximation algorithms for computing minimum exposure paths in a sensor field. ACM Trans. Sens. Networks 7(3): 23:1-23:25 (2010)
2000 – 2009
- 2007
- [c25]Hristo N. Djidjev:
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field. DCOSS 2007: 295-308 - 2006
- [j12]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari:
Partitioning planar graphs with costs and weights. ACM J. Exp. Algorithmics 11 (2006) - [j11]Hristo N. Djidjev:
A Linear-Time Algorithm for Finding a Maximal Planar Subgraph. SIAM J. Discret. Math. 20(2): 444-462 (2006) - [c24]Hristo N. Djidjev, Imrich Vrto:
Planar Crossing Numbers of Genus g Graphs. ICALP (1) 2006: 419-430 - [c23]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS 2006: 98-109 - [c22]Hristo N. Djidjev:
A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection. WAW 2006: 117-128 - 2003
- [j10]Hristo N. Djidjev, Imrich Vrto:
Crossing Numbers and Cutwidths. J. Graph Algorithms Appl. 7(3): 245-251 (2003) - 2002
- [c21]Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari:
Partitioning Planar Graphs with Costs and Weights. ALENEX 2002: 98-110 - 2001
- [c20]Hristo N. Djidjev, Imrich Vrto:
An Improved Lower Bound for Crossing Numbers. GD 2001: 96-101 - 2000
- [j9]Hristo N. Djidjev:
Partitioning Planar Graphs with Vertex Costs: Algorithms and Applications. Algorithmica 28(1): 51-75 (2000) - [j8]Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis:
Improved Algorithms for Dynamic Shortest Paths. Algorithmica 28(4): 367-389 (2000) - [j7]Lyudmil Aleksandrov, Hristo N. Djidjev, Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Finding a Shortest Central Link Segment. Int. J. Comput. Geom. Appl. 10(2): 157-188 (2000) - [c19]Hristo N. Djidjev:
Computing the Girth of a Planar Graph. ICALP 2000: 821-831 - [c18]Hristo N. Djidjev:
Force-Directed Methods for Smoothing Unstructured Triangular and Tetrahedral Meshes. IMR 2000: 395-406 - [c17]Lyudmil Aleksandrov, Hristo N. Djidjev:
A Dynamic Algorithm for Maintaining Graph Partitions. SWAT 2000: 71-82 - [p1]Anil Maheshwari, Jörg-Rüdiger Sack, Hristo N. Djidjev:
Link Distance Problems. Handbook of Computational Geometry 2000: 519-558
1990 – 1999
- 1999
- [j6]Hristo N. Djidjev, John R. Gilbert:
Separators in Graphs with Negative and Multiple Vertex Weights. Algorithmica 23(1): 57-71 (1999) - 1998
- [c16]Lyudmil Aleksandrov, Hristo N. Djidjev:
Maintaining partitions of dynamic planar meshes. CCCG 1998 - 1997
- [j5]Hristo N. Djidjev, Shankar M. Venkatesan:
Reduced Constants for Simple Cycle Graph Separation. Acta Informatica 34(3): 231-243 (1997) - [c15]Hristo N. Djidjev:
Weighted Graph Separators and Their Applications. ESA 1997: 130-143 - 1996
- [j4]Lyudmil Aleksandrov, Hristo N. Djidjev:
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus. SIAM J. Discret. Math. 9(1): 129-150 (1996) - [c14]Hristo N. Djidjev:
On-Line Algorithms for Shortest Path Problems on Planar Digraphs. WG 1996: 151-165 - 1995
- [j3]Hristo N. Djidjev, Andrzej Lingas:
On computing Voronoi diagrams for sorted point sets. Int. J. Comput. Geom. Appl. 5(3): 327-337 (1995) - [c13]Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis:
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs. FCT 1995: 191-200 - [c12]Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis:
On-line and Dynamic Algorithms for Shorted Path Problems. STACS 1995: 193-204 - [c11]Hristo N. Djidjev:
A Linear Algorithm for the Maximal Planar Subgraph Problem. WADS 1995: 369-380 - [c10]Hristo N. Djidjev, Shankar M. Venkatesan:
Planarization of Graphs Embedded on Surfaces. WG 1995: 62-72 - 1994
- [c9]Hristo N. Djidjev:
On Drawing a Graph Convexly in the Plane. GD 1994: 76-83 - 1993
- [j2]Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto:
Edge Separators of Planar and Outerplanar Graphs with Applications. J. Algorithms 14(2): 258-279 (1993) - 1992
- [j1]Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack:
An O(n log n) Algorithm for Computing the Link Center of a Simple Polygon. Discret. Comput. Geom. 8: 131-152 (1992) - 1991
- [c8]Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis:
Computing Shortest Paths and Distances in Planar Graphs. ICALP 1991: 327-338 - [c7]Hristo N. Djidjev, John H. Reif:
An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs. STOC 1991: 337-347 - [c6]Hristo N. Djidjev, Andrzej Lingas:
On Computing the Voronoi Diagram for Restricted Planar Figures. WADS 1991: 54-64
1980 – 1989
- 1989
- [c5]Lyudmil Aleksandrov, Hristo N. Djidjev:
Improved Bounds on the Size of Separators of Toroidal Graphs. Optimal Algorithms 1989: 126-138 - [c4]Hristo N. 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 - [e1]Hristo N. Djidjev:
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 [contents] - 1988
- [c3]Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto:
Edge Separators for Planar Graphs and Their Applications. MFCS 1988: 280-290 - [c2]Hristo N. Djidjev:
Linear Algorithms for Graph Separation Problems. SWAT 1988: 216-222 - 1986
- [c1]Hristo N. Djidjev:
VLSI Algorithms for Combinatorial Problems. IFIP Congress 1986: 649-654
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
