On the limitations of the chimera graph topology in using analog quantum computers. - Daniel Vert; Renaud Sirdey; Stéphane Louise (CF, 2019)

Revisiting Old Combinatorial Beasts in the Quantum Age: Quantum Annealing Versus Maximal Matching. - Daniel Vert; Renaud Sirdey; Stéphane Louise (ICCS (6), 2020)

Operational Quantum Annealers are Cursed by their Qubits Interconnection Topologies. - Daniel Vert; Renaud Sirdey; Stéphane Louise (ISVLSI, 2020)

Benchmarking Quantum Annealing Against "Hard" Instances of the Bipartite Matching Problem. - Daniel Vert; Renaud Sirdey; Stéphane Louise (SN Comput. Sci., 2021)

Étude des performances des machines à recuit quantique pour la résolution de problèmes combinatoires. (Study of the performance of quantum annealing machines for solving combinatorial problems). - Daniel Vert (2021)

Quantum Approaches for WCET-Related Optimization Problems. - Gabriella Bettonte; Valentin Gilbert; Daniel Vert; Stéphane Louise; Renaud Sirdey (ICCS (4), 2022)

Benchmarking quantum annealing with maximum cardinality matching problems. - Daniel Vert; Madita Willsch; Berat Yenilen; Renaud Sirdey; Stéphane Louise; Kristel Michielsen (Frontiers Comput. Sci., 2024)