Pairing Heap. - Hauke Brinkop; Tobias Nipkow (Arch. Formal Proofs, 2016)

Amortized Complexity Verified. - Tobias Nipkow; Hauke Brinkop (J. Autom. Reason., 2019)

An optimal FPT algorithm parametrized by treewidth for Weighted-Max-Bisection given a tree decomposition as advice assuming SETH and the hardness of MinConv. - Hauke Brinkop; Klaus Jansen; Tim Weißenfels (CoRR, 2021)

High Multiplicity Scheduling on Uniform Machines in FPT-Time. - Hauke Brinkop; Klaus Jansen (CoRR, 2022)

New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines. - Sebastian Berndt 001; Hauke Brinkop; Klaus Jansen; Matthias Mnich; Tobias Stamm (ISAAC, 2023)

Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth. - Hauke Brinkop; Klaus Jansen (SOFSEM, 2023)

Robust Scheduling on Uniform Machines - New Results Using a Relaxed Approximation Guarantee. - Hauke Brinkop; David Fischer; Klaus Jansen (CoRR, 2025)