Homepage
Contact
Andreas Karrenbauer
Max Planck Institut for InformaticsDepartment 1: Algorithms and Complexity
| office: |
Campus E1 4,
Room 307 Saarland Informatics Campus 66123 Saarbrücken Germany |
| email: | firstname.lastname@mpi-inf.mpg.de |
| phone: | +49 681 9325-1007 |
| fax: | +49 681 9325-1099 |
Teaching (current semester)
- Bachelor's/Master's seminar topics available on request
Research Interests
- Integer Programming
- Combinatorial Optimization
- Applied and Industrial Optimization
- Algorithm Engineering
- Computational Interaction
Publications
- Physarum-inspired multi-commodity flow dynamics
V. Bonifaci, E. Facca, F. Folz, A. Karrenbauer, P. Kolev, K. Mehlhorn, G. Morigi, G. Shahkarami, Q. Vermande
Theoretical Computer Science, vol. 920, pp. 1-20, 2022, doi: 10.1016/j.tcs.2022.02.001
- Computational design and optimization of electro-physiological sensors
A. S. Nittala, A. Karrenbauer, A. Khan, T. Kraus, J. Steimle
Nature Communications, vol. 12, no. 1, p. 6351, 2021, doi: 10.1038/s41467-021-26442-1 - Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
R. Becker, S. Forster, A. Karrenbauer, C. Lenzen
SIAM Journal on Computing, 50(3), pp. 815-856, 2021, doi: 10.1137/19m1286955
The conference version appeared in
Proceedings of the 31st International Symposium on Distributed Computing (DISC 2017), pp. 7:1-7:16, 2017 - Azerty amélioré: Computational design on a national scale
A. Feit, M. Nancel, M. John, A. Karrenbauer, D. Weir, A. Oulasvirta
Communications of the ACM, vol. 64, p. 48–58, 2021, doi: 10.1145/3382035 - Foraging-based optimization of menu systems
N. R. Dayama, M. Shiripour, A. Oulasvirta, E. Ivanko, A. Karrenbauer
International Journal of Human-Computer Studies, vol. 151, p. 102624, 2021, doi: 10.1016/j.ijhcs.2021.102624 - Combinatorial optimization of graphical user interface designs
A. Oulasvirta, N. R. Dayama, M. Shiripour, M. John, A. Karrenbauer,
Proceedings of the IEEE, 2020, doi: 10.1109/JPROC.2020.2969687 - Reading Articles Online
A. Karrenbauer, E. Kovalevskaya
Proceedings of The 14th Annual International Conference on Combinatorial Optimization and Applications (COCOA'20), pp. 639-654, 2020, doi: 10.1007/978-3-030-64843-5_43 - Convergence of the non-uniform directed physarum model
E. Facca, A. Karrenbauer, P. Kolev, K. Mehlhorn
Theoretical Computer Science, 2020, doi: 10.1016/j.tcs.2020.01.034
- Convergence of the non-uniform Physarum dynamics
A. Karrenbauer, P. Kolev, K. Mehlhorn
Theoretical Computer Science, 2020, doi: 10.1016/j.tcs.2020.02.032
- Two results on slime mold computations
R. Becker, V. Bonifaci, A. Karrenbauer, P. Kolev, K. Mehlhorn
Theoretical Computer Science, 773, pp. 79-106, 2019
- Dynamic Sparsification for Quadratic Assignment Problems
M. John, A. Karrenbauer
Proceedings of the International Conference Mathematical Optimization Theory and Operations Research (MOTOR), pp. 232-246, 2019 - Near-Optimal Distributed Maximum Flow
M. Ghaffari, A. Karrenbauer, F. Kuhn, C. Lenzen, B. Patt-Shamir
SIAM Journal on Computing, 47(6), pp. 2078-2117, 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. 2898-2907, 2018 - Computational Support for Functionality Selection in Interaction Design
A. Oulasvirta, A. Feit, P. Lähteenlahti A. Karrenbauer,
ACM Transactions on Computer-Human Interaction (TOCHI), 24(5), pp. 34:1-34:30, 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. 326-343, 2017 - Cliques in Regular Graphs and the Core-Periphery 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. 175-186, 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:1-11: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. 414-425, 2016 - A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem
R. Becker, M. Fickert, A. Karrenbauer
Proceedings of SIAM Meeting on Algorithm Engineering and Experiments (ALENEX), pp. 151-159, 2016 - On Guillotine Cutting Sequences
F. Abed, P. Chalermsook, J. Correa, A. Karrenbauer, P. Ṕerez-Lantero, 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 3-coloring problem
J. Byrka, A. Karrenbauer, L. Sanità
Theoretical Computer Science, vol. 593, 2015, pp. 42-50, 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 Min-Cost Flow
R. Becker, A. Karrenbauer
Proceedings of The 25th International Symposium on Algorithms and Computation (ISAAC 2014), 2014, pp. 753-765 - Improving Keyboard Optimization with Integer Programming
A. Karrenbauer, A. Oulasvirta
Proceedings of 27th ACM User Interface Software and Technology Symposium (UIST ’14), 2014, pp. 621-626 -
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. 235-246
- 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. 472-483
- Blinking Molecule Tracking
A. Karrenbauer, D. Wöll
Proceedings of the 12th International Symposium on Experimental Algorithms (SEA), 2013, pp. 308-319
- 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. 635-650, 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. 111-122
- Recovering missing coefficients in DCT-transformed images
S. Li, A. Karrenbauer, D. Saupe, C.C.J. Kuo
Proceedings of the 18th IEEE International Conference on Image Processing (ICIP), 2011, pp. 1569-1572
- 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/s00453-010-9406-0
The conference version appeared in
Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 210-221 - A combinatorial algorithm for the 1-median problem in R^d with the Chebyshev-norm
J. Hatzl, A. Karrenbauer
Operations Research Letters, vol. 38, no. 5, September 2010, pp. 383-385, doi:10.1016/j.orl.2010.07.002
- A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
A. Karrenbauer, T. Rothvoß
Approximation and Online Algorithms, LNCS 6534, 2011, pp. 166-177, doi:10.1007/978-3-642-18318-8_15 - Computing H/D-Exchange rates of single residues from data of proteolytic fragments
E. Althaus, S. Canzar, M. R. Emmett, C. Ehrler, A. Karrenbauer, A. G. Marshall, A. Meyer-Baese, J. D. Tipton, and H. Zhang
BMC Bioinformatics 2010, 11:424, doi:10.1186/1471-2105-11-424
The conference version appeared in
Proceedings of the 23rd Annual ACM Symposium on Applied Computing, 2008, pp. 1273-1277 - An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time 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. 583-596, 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. 744-755 - 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. 110-122 - A Video-Capable Algorithm for Local-Dimming RGB Backlight
M. Albrecht, A. Karrenbauer, and C. Xu
SID 2009 International Symposium Digest of Technical Papers, 2009, pp. 753-756 - A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
M. Albrecht, A. Karrenbauer, and C. Xu,
Proceedings of the 28th International Display Research Conference (IDRC), 2008, pp. 286-289 - Algorithms for longer OLED Lifetime
F. Eisenbrand, A. Karrenbauer, C. Xu
in Camil Demetrescu (ed.): WEA 2007, LNCS 4525, Springer, 2007, pp. 338-351, 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. 97-100 - 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. 197-206 - Energy-Aware 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. 336-345
Recent Positions
- since March 2018
CEO of andaminika GmbH, St. Wendel, Germany. - since January 2013
Senior Researcher in the Algorithms and Complexity department at the Max Planck Institute for Informatics, Saarbrücken, Germany. - July 2010 - December 2012
Fellow at the Zukunftskolleg of the University of Konstanz, Germany. - October 2008 - June 2010
Postdoctoral Researcher in the Discrete Optimization group at EPFL, Lausanne, Switzerland. -
January 2008 - September 2008
Postdoctoral Researcher in the Algorithms and Complexity department at the Max Planck Institute for Informatics.
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.