We stand with Ukraine  

Hauke Brinkop

Orcid: 0000-0002-7791-2353

According to our database1, Hauke Brinkop authored at least 7 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Robust Scheduling on Uniform Machines - New Results Using a Relaxed Approximation Guarantee.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Hauke Brinkop
,
Klaus Jansen
,
Tim Weißenfels
CoRR, 2021

2019
Amortized Complexity Verified.
[BibTeX]
[DOI]
Tobias Nipkow
,
Hauke Brinkop
J. Autom. Reason., 2019

2016
Pairing Heap.
[BibTeX]
[DOI]
Hauke Brinkop
,
Tobias Nipkow
Arch. Formal Proofs, 2016


  Loading...