742 citations · 775 across the 4 of their papers we have counts for
4 papers
Efficient Combinatorial Optimization Using Quantum Annealing
Hristo N. Djidjev, Guillaume Chapuis, Georg Hahn +1
The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techn…
Finding Maximum Cliques on the D-Wave Quantum Annealer
Guillaume Chapuis, Hristo N. Djidjev, Georg Hahn +1
This paper assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Beca…
Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures
Guillaume Chapuis, Hristo Djidjev
We develop an efficient parallel algorithm for answering shortest-path queries in planar graphs and implement it on a multi-node CPU/GPU clusters. The algorithm uses a divide-and-c…
Assemblathon 2: evaluating de novo methods of genome assembly in three vertebrate species
Keith R. Bradnam, Joseph N. Fass, Anton Alexandrov +88
Background - The process of generating raw genome sequence data continues to become cheaper, faster, and more accurate. However, assembly of such data into high-quality, finished g…