Hauke Brinkop

According to our database, Hauke Brinkop authored at least 8 papers between 2016 and 2026.

Collaborative distances:

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

2026

Approximation Algorithms for Integer Programming with Resource Augmentation.

Hauke Brinkop, Hua Chen, Lin Chen, Klaus Jansen, Guochuan Zhang

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025

Robust Scheduling on Uniform Machines - New Results Using a Relaxed Approximation Guarantee.

Hauke Brinkop, David Fischer, Klaus Jansen

Proceedings of the Approximation and Online Algorithms - 23rd International Workshop, 2025

2023

Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth.

Hauke Brinkop, Klaus Jansen

Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines.

Sebastian Berndt, Hauke Brinkop, Klaus Jansen, Matthias Mnich, Tobias Stamm

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022

High Multiplicity Scheduling on Uniform Machines in FPT-Time.

Hauke Brinkop, Klaus Jansen

CoRR, 2022

2021

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

2019

Amortized Complexity Verified.

Tobias Nipkow, Hauke Brinkop

J. Autom. Reason., 2019

2016

Pairing Heap.

Hauke Brinkop, Tobias Nipkow

Arch. Formal Proofs, 2016