Teaching (current semester)
Research Interests
 Integer Programming
 Combinatorial Optimization
 Applied and Industrial Optimization
 Algorithm Engineering
 Computational Interaction
Publications
 Two results on slime mold computations
R. Becker, V. Bonifaci, A. Karrenbauer, P. Kolev, K. Mehlhorn
Theoretical Computer Science, 773, pp. 79106, 2019
 Dynamic Sparsification for Quadratic Assignment Problems
M. John, A. Karrenbauer
Proceedings of the International Conference Mathematical Optimization Theory and Operations Research (MOTOR), pp. 232246, 2019
 NearOptimal Distributed Maximum Flow
M. Ghaffari, A. Karrenbauer, F. Kuhn, C. Lenzen, B. PattShamir
SIAM Journal on Computing, 47(6), pp. 20782117, 2018
The conference version appeared in
Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC 2015), 2015, pp. 81–90
 Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering
J. Lange, A. Karrenbauer, B. Andres
Proceedings of the 35th International Conference on Machine Learning (ICML 2018), pp. 28982907, 2018
 Computational Support for Functionality Selection in Interaction Design
A. Oulasvirta,
A. Feit, P. Lähteenlahti
A. Karrenbauer,
ACM Transactions on ComputerHuman Interaction (TOCHI), 24(5), pp. 34:134:30, 2017
 NearOptimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
R. Becker, A. Karrenbauer, S. Krinninger, C. Lenzen
Proceedings of the 31st International Symposium on Distributed Computing (DISC 2017), pp. 7:17:16, 2017
 From DQBF to QBF by Dependency Elimination
R. Wimmer, A. Karrenbauer, R. Becker, C. Scholl, B. Becker
Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT 2017), pp. 326343, 2017
 Cliques in Regular Graphs and the CorePeriphery Problem in Social Networks
U. Brandes, E. Holm, A. Karrenbauer
Proceedings of The 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA'16), pp. 175186, 2016
 On the Parameterized Complexity of Biclique Cover and Partition
L. Sunil Chandran, D. Issac, A. Karrenbauer
Proceedings of the 11th International Symposium on Parameterized and Exact Computation (IPEC), pp. 11:111:13, 2016
 A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases
M. John, A. Karrenbauer
Proceedings of the 4th International Symposium on Combinatorial Optimization (ISCO), pp. 414425, 2016
 A Novel Dual Ascent Algorithm for Solving the MinCost Flow Problem
R. Becker, M. Fickert, A. Karrenbauer
Proceedings of SIAM Meeting on Algorithm Engineering and Experiments (ALENEX), pp. 151159, 2016
 On Guillotine Cutting Sequences
F. Abed, P. Chalermsook, J. Correa, A. Karrenbauer, P. ṔerezLantero, J. A. Soto, A. Wiese
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015), vol. 40 of LIPIcs, 2015, pp. 1–19
 The interval constrained 3coloring problem
J. Byrka, A. Karrenbauer, L. Sanità
Theoretical Computer Science, vol. 593, 2015, pp. 4250, DOI: 10.1016/j.tcs.2015.04.037
The conference version appeared in
9th Latin American Theoretical Informatics Symposium (LATIN), 2010, LNCS 6034, pp. 592 – 603
 A Simple Efficient Interior Point Method for MinCost Flow
R. Becker, A. Karrenbauer
Proceedings of The 25th International Symposium on Algorithms and Computation (ISAAC 2014), 2014, pp. 753765
 Improving Keyboard Optimization with Integer Programming
A. Karrenbauer, A. Oulasvirta
Proceedings of 27th ACM User Interface Software and Technology Symposium (UIST ’14), 2014, pp. 621626

Nearly Tight Approximability Results for Minimum Biclique Cover and Partition
P. Chalermsook, S. Heydrich, E. Holm, A. Karrenbauer
Proceedings of 22th Annual European Symposium on Algorithms (ESA), LNCS 8737, 2014, pp. 235246
 Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds Erratum
L. Becchetti, V. Bonifaci, M. Dirnberger, A. Karrenbauer, K. Mehlhorn
Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), 2013, pp. 472483
 Blinking Molecule Tracking
A. Karrenbauer, D. Wöll
Proceedings of the 12th International Symposium on Experimental Algorithms (SEA), 2013, pp. 308319
 A novel method for automatic single molecule tracking of blinking molecules at low intensities
D. Wöll, C. Kölbl, B. Stempfle, A. Karrenbauer
Physical Chemistry Chemical Physics, vol. 15, 2013, pp. 6196–6205, DOI: 10.1039/C3CP44693J
 Leveling the Grid
S. Cornelsen, A. Karrenbauer, S. Li
Proceedings of the SIAM Meeting on Algorithm Engineering and Experiments (ALENEX), 2012, pp. 45  54, DOI: 10.1137/1.9781611972924.4
 Accelerated Bend Minimization
S. Cornelsen, A. Karrenbauer
Journal of Graph Algorithms and Applications, Vol. 16, no. 3, pp. 635650, 2012, DOI: 10.7155/jgaa.00265
The conference version appeared in
Proceedings of the 19th International Symposium on Graph Drawing (GD 2011), LNCS 7034, 2012, pp. 111122
 Recovering missing coeﬃcients in DCTtransformed images
S. Li, A. Karrenbauer, D. Saupe, C.C.J. Kuo
Proceedings of the 18th IEEE International Conference on Image Processing (ICIP), 2011, pp. 15691572
 Approximating the interval constrained coloring problem
E. Althaus, S. Canzar, K. Elbassioni, A. Karrenbauer, J. Mestre
in Algorithmica, vol. 61, no. 2, pp. 342–361, 2011, doi: 10.1007/s0045301094060
The conference version appeared in
Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 210221
 A combinatorial algorithm for the 1median problem in R^d with the Chebyshevnorm
J. Hatzl, A. Karrenbauer
Operations Research Letters, vol. 38, no. 5, September 2010, pp. 383385, doi:10.1016/j.orl.2010.07.002
 A 3/2approximation algorithm for ratemonotonic multiprocessor scheduling of implicitdeadline tasks
A. Karrenbauer, T. Rothvoß
Approximation and Online Algorithms, LNCS 6534, 2011, pp. 166177, doi:10.1007/9783642183188_15
 Computing H/DExchange rates of single residues from data of proteolytic fragments
E. Althaus, S. Canzar, M. R. Emmett, C. Ehrler, A. Karrenbauer, A. G. Marshall, A. MeyerBaese, J. D. Tipton, and H. Zhang
BMC Bioinformatics 2010, 11:424, doi:10.1186/1471210511424
The conference version appeared in
Proceedings of the 23rd Annual ACM Symposium on Applied Computing, 2008, pp. 12731277
 An AverageCase Analysis for RateMonotonic Multiprocessor Realtime Scheduling
A. Karrenbauer, T. Rothvoß
17th Annual European Symposium on Algorithms (ESA), 2009, LNCS 5757, pp. 432–443
 Domain walls and chaos in the disordered SOS model
K. Schwarz, A. Karrenbauer, G. Schehr, H. Rieger
J. Stat. Mech.(2009) P08022
 Multiline Addressing by Network Flow
F. Eisenbrand, A. Karrenbauer, M. Skutella, C. Xu
in Algorithmica, vol. 53, no. 4, pp. 583596, 2009
The conference version appeared in
Yossi Azar & Thomas Erlebach (eds.): Algorithms  ESA 2006, Lecture Notes in Computer Science, Springer: Berlin, 2006, Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06), pp. 744755
 Matching techniques ride to rescue OLED displays
A. Karrenbauer
Proceedings of the 3rd Annual International Conference on Combinatorial Optimization and Applications (COCOA), Lecture Notes in Computer Science 5573, Springer, 2009, pp. 110122
 A VideoCapable Algorithm for LocalDimming RGB Backlight
M. Albrecht, A. Karrenbauer, and C. Xu
SID 2009 International Symposium Digest of Technical Papers, 2009, pp. 753756
 A clipperfree Algorithm for efficient HWImplementation of local dimming LEDBacklight
M. Albrecht, A. Karrenbauer, and C. Xu,
Proceedings of the 28th International Display Research Conference (IDRC), 2008, pp. 286289
 Algorithms for longer OLED Lifetime
F. Eisenbrand, A. Karrenbauer, C. Xu
in Camil Demetrescu (ed.): WEA 2007, LNCS 4525, Springer, 2007, pp. 338351, Proceedings of the 6th International Workshop on Experimental Algorithms (WEA'07)
 A new addressing scheme for PM OLED Display
C. Xu, A. Karrenbauer, K. M. Soh, J. Wahl
SID 2007 International Symposium Digest of Technical Papers, 2007, pp. 97100
 Packing a Trunk  now with a Twist, best paper award (2nd prize)
F. Eisenbrand, S. Funke, A. Karrenbauer, J. Reichel, E. Schömer
Proceedings of the 2005 ACM Symposium on Solid and Physical Modeling (SPM'05), 2005, pp. 197206
 EnergyAware Stage Illumination
F. Eisenbrand, S. Funke, A. Karrenbauer, D. Matijevic
in J. S. B. Mitchell, G. Rote (Eds.): Proceedings of the 21st ACM Symposium on Computational Geometry (SoCG), Pisa, Italy, 2005, pp. 336345
Education

October 2004  December 2007
Ph.D. student in Computer Science
at Saarland University and
at the Max Planck Institute for Computer Science.
Ph.D. Thesis: "Engineering Combinatorial Optimization Algorithms to Improve the Lifetime of OLED Displays"

October 2000  July 2004
Studies in Computer Science at Saarland University.
Master's Thesis: "Packing Boxes with Arbitrary Rotations".

October 2000  April 2007
Studies in Physics at Saarland University.
Master's Thesis: On the ground state and excited states in models for elastic media with random disorder.