Andreas Karrenbauer

  • Max Planck Institute for Informatics, Saarbrücken, Germany
  • University of Konstanz, Zukunftskolleg, Germany
  • EPFL, Institute of Mathematics, Lausanne, Switzerland
  • Saarland University, Informatics Campus, Saarbrücken, Germany (PhD 2007)

According to our database1, Andreas Karrenbauer authored at least 52 papers between 2005 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models.
SIAM J. Comput., 2021

Foraging-based optimization of menu systems.
Int. J. Hum. Comput. Stud., 2021

Physarum Inspired Dynamics to Solve Semi-Definite Programs.
CoRR, 2021

Improved Online Algorithm for Fractional Knapsack in the Random Order Model.
CoRR, 2021

AZERTY amélioré: computational design on a national scale.
Commun. ACM, 2021

Convergence of the non-uniform Physarum dynamics.
Theor. Comput. Sci., 2020

Convergence of the non-uniform directed Physarum model.
Theor. Comput. Sci., 2020

Combinatorial Optimization of Graphical User Interface Designs.
Proc. IEEE, 2020

Scanning the Issue.
Proc. IEEE, 2020

Physarum Multi-Commodity Flow Dynamics.
CoRR, 2020

Reading Articles Online.
Proceedings of the Combinatorial Optimization and Applications, 2020

Two results on slime mold computations.
Theor. Comput. Sci., 2019

Dynamic Sparsification for Quadratic Assignment Problems.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Near-Optimal Distributed Maximum Flow.
SIAM J. Comput., 2018

From DQBF to QBF by Dependency Elimination.
Proceedings of the Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen, 2018

Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering.
Proceedings of the 35th International Conference on Machine Learning, 2018

Computational Support for Functionality Selection in Interaction Design.
ACM Trans. Comput. Hum. Interact., 2017

An Integer Interior Point Method for Min-Cost Flow Using Arc Contractions and Deletions.
CoRR, 2016

Approximate Undirected Transshipment and Shortest Paths via Gradient Descent.
CoRR, 2016

On the Parameterized Complexity of Biclique Cover and Partition.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks.
Proceedings of the Combinatorial Optimization and Applications, 2016

A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

The interval constrained 3-coloring problem.
Theor. Comput. Sci., 2015

Near-Optimal Distributed Maximum Flow: Extended Abstract.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

P. polycephalum Can Compute Shortest Paths.
Proceedings of the BICT 2015, 2015

On Guillotine Cutting Sequences.
Proceedings of the Approximation, 2015

Improvements to keyboard optimization with integer programming.
Proceedings of the 27th Annual ACM Symposium on User Interface Software and Technology, 2014

A Simple Efficient Interior Point Method for Min-Cost Flow.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Nearly Tight Approximability Results for Minimum Biclique Cover and Partition.
Proceedings of the Algorithms - ESA 2014, 2014

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

Blinking Molecule Tracking.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Accelerated Bend Minimization.
J. Graph Algorithms Appl., 2012

Leveling the Grid.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

Approximation Algorithms for the Interval Constrained Coloring Problem.
Algorithmica, 2011

Recovering missing coefficients in DCT-transformed images.
Proceedings of the 18th IEEE International Conference on Image Processing, 2011

A combinatorial algorithm for the 1-median problem in R<sup>d</sup> with the Chebyshev norm.
Oper. Res. Lett., 2010

Sorted Sector Covering Combined with Image Condensation - An Efficient Method for Local Dimming of Direct-Lit and Edge-Lit LCDs.
IEICE Trans. Electron., 2010

Computing H/D-Exchange rates of single residues from data of proteolytic fragments.
BMC Bioinform., 2010

A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Algorithms for longer OLED lifetime.
ACM J. Exp. Algorithmics, 2009

Multiline Addressing by Network Flow.
Algorithmica, 2009

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling.
Proceedings of the Algorithms, 2009

Matching Techniques Ride to Rescue OLED Displays.
Proceedings of the Combinatorial Optimization and Applications, 2009

Discrete Fitting of Hydrogen-Deuterium-Exchange-data of Overlapping Fragments.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2009

Energy-Aware Stage Illumination.
Int. J. Comput. Geom. Appl., 2008

Approximating the Interval Constrained Coloring Problem.
Proceedings of the Algorithm Theory, 2008

Computing H/D-exchange speeds of single residues from data of peptic fragments.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays.
PhD thesis, 2007

Packing a Truck - Now with a Twist!
Int. J. Comput. Geom. Appl., 2007

Packing a trunk: now with a twist!
Proceedings of the Tenth ACM Symposium on Solid and Physical Modeling 2005, 2005