Packing a trunk: now with a twist! - Friedrich Eisenbrand; Stefan Funke; Andreas Karrenbauer; Joachim Reichel; Elmar Schömer (Symposium on Solid and Physical Modeling, 2005)

Packing a Truck - Now with a Twist! - Friedrich Eisenbrand; Stefan Funke; Andreas Karrenbauer; Joachim Reichel; Elmar Schömer (Int. J. Comput. Geom. Appl., 2007)

Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays. - Andreas Karrenbauer (2007)

Computing H/D-exchange speeds of single residues from data of peptic fragments. - Ernst Althaus; Stefan Canzar; Mark R. Emmett; Andreas Karrenbauer; Alan G. Marshall; Anke Meyer-Bäse; Huimin Zhang (SAC, 2008)

Approximating the Interval Constrained Coloring Problem. - Ernst Althaus; Stefan Canzar; Khaled M. Elbassioni; Andreas Karrenbauer; Julián Mestre (SWAT, 2008)

Energy-Aware Stage Illumination. - Friedrich Eisenbrand; Stefan Funke; Andreas Karrenbauer; Domagoj Matijevic (Int. J. Comput. Geom. Appl., 2008)

Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments. - Ernst Althaus; Stefan Canzar; Carsten Ehrler; Mark R. Emmett; Andreas Karrenbauer; Alan G. Marshall; Anke Meyer-Bäse; Jeremiah Tiptopn; Huimin Zhang (BIOCOMP, 2009)

Matching Techniques Ride to Rescue OLED Displays. - Andreas Karrenbauer (COCOA, 2009)

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling. - Andreas Karrenbauer; Thomas Rothvoß (ESA, 2009)

Multiline Addressing by Network Flow. - Friedrich Eisenbrand; Andreas Karrenbauer; Martin Skutella; Chihao Xu (Algorithmica, 2009)

Algorithms for longer OLED lifetime. - Friedrich Eisenbrand; Andreas Karrenbauer; Chihao Xu (ACM J. Exp. Algorithmics, 2009)

A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks. - Andreas Karrenbauer; Thomas Rothvoß (WAOA, 2010)

Computing H/D-Exchange rates of single residues from data of proteolytic fragments. - Ernst Althaus; Stefan Canzar; Carsten Ehrler; Mark R. Emmett; Andreas Karrenbauer; Alan G. Marshall; Anke Meyer-Bäse; Jeremiah D. Tipton; Huimin Zhang (BMC Bioinform., 2010)

Sorted Sector Covering Combined with Image Condensation - An Efficient Method for Local Dimming of Direct-Lit and Edge-Lit LCDs. - Marc Albrecht; Andreas Karrenbauer; Tobias Jung; Chihao Xu (IEICE Trans. Electron., 2010)

A combinatorial algorithm for the 1-median problem in Rd with the Chebyshev norm. - Johannes Hatzl; Andreas Karrenbauer (Oper. Res. Lett., 2010)

Recovering missing coefficients in DCT-transformed images. - Shujun Li; Andreas Karrenbauer; Dietmar Saupe; C.-C. Jay Kuo (ICIP, 2011)

Approximation Algorithms for the Interval Constrained Coloring Problem. - Ernst Althaus; Stefan Canzar; Khaled M. Elbassioni; Andreas Karrenbauer; Julián Mestre (Algorithmica, 2011)

Leveling the Grid. - Sabine Cornelsen; Andreas Karrenbauer; Shujun Li (ALENEX, 2012)

Accelerated Bend Minimization. - Sabine Cornelsen; Andreas Karrenbauer (J. Graph Algorithms Appl., 2012)

Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds. - Luca Becchetti; Vincenzo Bonifaci; Michael Dirnberger; Andreas Karrenbauer; Kurt Mehlhorn (ICALP (2), 2013)

Blinking Molecule Tracking. - Andreas Karrenbauer; Dominik Wöll (SEA, 2013)

A Combinatorial $ tilde{O}(m^{3/2})$-time Algorithm for the Min-Cost Flow Problem. - Ruben Becker; Andreas Karrenbauer (CoRR, 2013)

Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. - Parinya Chalermsook; Sandy Heydrich; Eugenia Holm; Andreas Karrenbauer (ESA, 2014)

A Simple Efficient Interior Point Method for Min-Cost Flow. - Ruben Becker; Andreas Karrenbauer (ISAAC, 2014)

Improvements to keyboard optimization with integer programming. - Andreas Karrenbauer; Antti Oulasvirta (UIST, 2014)

On Guillotine Cutting Sequences. - Fidaa Abed; Parinya Chalermsook; José Correa 001; Andreas Karrenbauer; Pablo Pérez-Lantero; José A. Soto; Andreas Wiese (APPROX-RANDOM, 2015)

P. polycephalum Can Compute Shortest Paths. - Luca Becchetti; Vincenzo Bonifaci; Michael Dirnberger; Andreas Karrenbauer; Kurt Mehlhorn; Girish Varma (BICT, 2015)

Near-Optimal Distributed Maximum Flow: Extended Abstract. - Mohsen Ghaffari 001; Andreas Karrenbauer; Fabian Kuhn; Christoph Lenzen 001; Boaz Patt-Shamir (PODC, 2015)

The interval constrained 3-coloring problem. - Jaroslaw Byrka; Andreas Karrenbauer; Laura Sanità (Theor. Comput. Sci., 2015)

A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. - Ruben Becker; Maximilian Fickert; Andreas Karrenbauer (ALENEX, 2016)

Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks. - Ulrik Brandes; Eugenia Holm; Andreas Karrenbauer (COCOA, 2016)

A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases. - Maximilian John; Andreas Karrenbauer (ISCO, 2016)

On the Parameterized Complexity of Biclique Cover and Partition. - L. Sunil Chandran; Davis Issac; Andreas Karrenbauer (IPEC, 2016)

Approximate Undirected Transshipment and Shortest Paths via Gradient Descent. - Ruben Becker; Andreas Karrenbauer; Sebastian Krinninger; Christoph Lenzen 001 (CoRR, 2016)

An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions. - Ruben Becker; Andreas Karrenbauer; Kurt Mehlhorn (CoRR, 2016)

From DQBF to QBF by Dependency Elimination. - Ralf Wimmer 001; Andreas Karrenbauer; Ruben Becker; Christoph Scholl 001; Bernd Becker 001 (SAT, 2017)

Computational Support for Functionality Selection in Interaction Design. - Antti Oulasvirta; Anna Maria Feit; Perttu Lähteenlahti; Andreas Karrenbauer (ACM Trans. Comput. Hum. Interact., 2017)

Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering. - Jan-Hendrik Lange; Andreas Karrenbauer; Bjoern Andres (ICML, 2018)

Near-Optimal Distributed Maximum Flow. - Mohsen Ghaffari 001; Andreas Karrenbauer; Fabian Kuhn; Christoph Lenzen 001; Boaz Patt-Shamir (SIAM J. Comput., 2018)

Dynamic Sparsification for Quadratic Assignment Problems. - Maximilian John; Andreas Karrenbauer (MOTOR, 2019)

Two results on slime mold computations. - Ruben Becker; Vincenzo Bonifaci; Andreas Karrenbauer; Pavel Kolev; Kurt Mehlhorn (Theor. Comput. Sci., 2019)

Reading Articles Online. - Andreas Karrenbauer; Elizaveta Kovalevskaya (COCOA, 2020)

Physarum Multi-Commodity Flow Dynamics. - Vincenzo Bonifaci; Enrico Facca; Frederic Folz; Andreas Karrenbauer; Pavel Kolev; Kurt Mehlhorn; Giovanna Morigi; Golnoosh Shahkarami; Quentin Vermande (CoRR, 2020)

Scanning the Issue. - Weiqiang Liu 001; Maximilian John; Andreas Karrenbauer; Adam Allerhand; Fabrizio Lombardi; Michael Shulte; David J. Miller 001; Zhen Xiang; George Kesidis; Antti Oulasvirta; Niraj Ramesh Dayama; Morteza Shiripour (Proc. IEEE, 2020)

Combinatorial Optimization of Graphical User Interface Designs. - Antti Oulasvirta; Niraj Ramesh Dayama; Morteza Shiripour; Maximilian John; Andreas Karrenbauer (Proc. IEEE, 2020)

Convergence of the non-uniform directed Physarum model. - Enrico Facca; Andreas Karrenbauer; Pavel Kolev; Kurt Mehlhorn (Theor. Comput. Sci., 2020)

Convergence of the non-uniform Physarum dynamics. - Andreas Karrenbauer; Pavel Kolev; Kurt Mehlhorn (Theor. Comput. Sci., 2020)

Improved Online Algorithm for Fractional Knapsack in the Random Order Model. - Jeff Giliberti; Andreas Karrenbauer (WAOA, 2021)

AZERTY amélioré: computational design on a national scale. - Anna Maria Feit; Mathieu Nancel; Maximilian John; Andreas Karrenbauer; Daryl Weir; Antti Oulasvirta (Commun. ACM, 2021)

Physarum Inspired Dynamics to Solve Semi-Definite Programs. - Hamidreza Kamkari; Andreas Karrenbauer; Mohammadamin Sharifi (CoRR, 2021)

Foraging-based optimization of menu systems. - Niraj Ramesh Dayama; Morteza Shiripour; Antti Oulasvirta; Evgeny Ivanko; Andreas Karrenbauer (Int. J. Hum. Comput. Stud., 2021)

Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. - Ruben Becker; Sebastian Forster; Andreas Karrenbauer; Christoph Lenzen 001 (SIAM J. Comput., 2021)

Improving Order with Queues. - Andreas Karrenbauer; Leonie Krull; Kurt Mehlhorn; Pranabendu Misra; Paolo Luigi Rinaldi; Anna Twelsiek (CoRR, 2022)

Physarum-inspired multi-commodity flow dynamics. - Vincenzo Bonifaci; Enrico Facca; Frederic Folz; Andreas Karrenbauer; Pavel Kolev; Kurt Mehlhorn; Giovanna Morigi; Golnoosh Shahkarami; Quentin Vermande (Theor. Comput. Sci., 2022)

A Systematic Review of Approximability Results for Traveling Salesman Problems leveraging the TSP-T3CO Definition Scheme. - Sophia Saller; Jana Koehler; Andreas Karrenbauer (CoRR, 2023)

Algorithm Engineering of SSSP with Negative Edge Weights. - Alejandro Cassis; Andreas Karrenbauer; André Nusser; Paolo Luigi Rinaldi (SEA, 2025)

Engineering Insights into Biclique Partitions and Fractional Binary Ranks of Matrices. - Angikar Ghosal; Andreas Karrenbauer (SEA, 2025)

Optimizing Car Resequencing on Mixed-Model Assembly Lines: Algorithm Development and Deployment. - Andreas Karrenbauer; Bernd Kuhn; Kurt Mehlhorn; Paolo Luigi Rinaldi (CoRR, 2025)