Felix Klingelhöfer

According to our database, Felix Klingelhöfer authored at least 7 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2026

Hardness and Approximation for Coloring Digraphs.

Parinya Chalermsook, Harmender Gahlawat, Felix Klingelhöfer, Alantha Newman, Chaoliang Tang

CoRR, May, 2026

2024

Bounding the Chromatic Number of Dense Digraphs by Arc Neighborhoods.

Felix Klingelhöfer, Alantha Newman

Comb., August, 2024

2023

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

PhD thesis, 2023

Coloring Tournaments with Few Colors: Algorithms and Complexity.

Felix Klingelhöfer, Alantha Newman

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

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

Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming.

Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Classical and quantum dynamic programming for Subset-Sum and variants.

Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha

CoRR, 2021