Classical and quantum dynamic programming for Subset-Sum and variants. - Jonathan Allcock; Yassine Hamoudi; Antoine Joux; Felix Klingelhöfer; Miklos Santha (CoRR, 2021)

Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming. - Jonathan Allcock; Yassine Hamoudi; Antoine Joux; Felix Klingelhöfer; Miklos Santha (ESA, 2022)

Problems, proofs, and disproofs on the inversion number. - Guillaume Aubian; Frédéric Havet; Florian Hörsch; Felix Klingelhöfer; Nicolas Nisse; Clément Rambaud; Quentin Vermande (CoRR, 2022)

Algorithms for Promise Coloring Problems on Tournaments and Graphs. (Algorithmes pour des Problèmes de Coloration avec Promesse sur les Tournois et les Graphes). - Felix Klingelhöfer (2023)

Coloring Tournaments with Few Colors: Algorithms and Complexity. - Felix Klingelhöfer; Alantha Newman (SIAM J. Discret. Math., 2024)

Bounding the Chromatic Number of Dense Digraphs by Arc Neighborhoods. - Felix Klingelhöfer; Alantha Newman (Comb., 2024)