( en | de | ru )

 

Disambiguation of "Djidjev, Hristo N."

Author of the publication

copydeleteadd this publication to your clipboard
Solving larger maximum clique problems using parallel quantum annealing.

, , and . Quantum Inf. Process., 22 (5): 219 (May 2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

n n n

Hristo Hitev

Hristo Bahtchevanski

Hristo Todoriev

Hristo Melovski

 

Other publications of authors with the same name

Partitioning planar graphs with costs and weights., , , and . ACM J. Exp. Algorithmics, (2006)Quantum Algorithm Implementations for Beginners., , , , , , , , , and 22 other author(s). CoRR, (2018)Noise Dynamics of Quantum Annealers: Estimating the Effective Noise Using Idle Qubits., , and . CoRR, (2022)Planarization of Graphs Embedded on Surfaces., and . WG, volume 1017 of Lecture Notes in Computer Science, page 62-72. Springer, (1995)On Drawing a Graph Convexly in the Plane.. GD, volume 894 of Lecture Notes in Computer Science, page 76-83. Springer, (1994)Distributed Out-of-Memory SVD on CPU/GPU Architectures., , , , , and . HPEC, page 1-8. IEEE, (2022)Generation of SSH Network Traffic Data for IDS Testbeds., and . CSET, USENIX Association, (2013)On Computing the Voronoi Diagram for Restricted Planar Figures., and . WADS, volume 519 of Lecture Notes in Computer Science, page 54-64. Springer, (1991)Simple Constraint Embedding for Quantum Annealers., and . ICRC, page 1-11. IEEE, (2018)Complete assembly of circular and chloroplast genomes based on global optimization., , , and . J. Bioinform. Comput. Biol., 17 (3): 1950014:1-1950014:23 (2019)