Andreas Karrenbauer

Available identifiers

zbMath Open karrenbauer.andreasDBLP30/4385WikidataQ84720584 ScholiaQ84720584MaRDI QIDQ500991

List of research outcomes

Publication	Date of Publication	Type
Reading articles online	2023-03-21	Paper
Near-optimal approximate shortest paths and transshipment in distributed and streaming models	2023-02-03	Paper
Improved online algorithm for fractional knapsack in the random order model	2022-10-19	Paper
Physarum-inspired multi-commodity flow dynamics	2022-05-17	Paper
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models	2021-05-27	Paper
Dynamic sparsification for quadratic assignment problems	2020-05-19	Paper
Convergence of the non-uniform physarum dynamics	2020-03-20	Paper
Convergence of the non-uniform directed physarum model	2020-03-20	Paper
Leveling the Grid	2019-09-12	Paper
A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem	2019-09-12	Paper
Two results on slime mold computations	2019-05-21	Paper
Near-Optimal Distributed Maximum Flow	2018-12-05	Paper
On the Parameterized Complexity of Biclique Cover and Partition	2018-04-10	Paper
From DQBF to QBF by dependency elimination	2017-11-15	Paper
Energy-aware stage illumination	2017-10-20	Paper
https://portal.mardi4nfdi.de/entity/Q5351886	2017-08-31	Paper
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks	2017-02-01	Paper
A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases	2016-11-30	Paper
Near-optimal distributed maximum flow (extended abstract)	2016-03-23	Paper
The interval constrained 3-coloring problem	2015-10-08	Paper
A Simple Efficient Interior Point Method for Min-Cost Flow	2015-09-11	Paper
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition	2014-10-08	Paper
Algorithms for longer OLED lifetime	2014-04-01	Paper
Physarum can compute shortest paths: convergence proofs and complexity bounds	2013-08-07	Paper
Accelerated bend minimization	2012-12-07	Paper
Accelerated bend minimization	2012-03-09	Paper
Approximation algorithms for the interval constrained coloring problem	2011-09-20	Paper
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks	2011-02-15	Paper
A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm	2010-12-20	Paper
The interval constrained 3-coloring problem	2010-04-27	Paper
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling	2009-10-29	Paper
Matching Techniques Ride to Rescue OLED Displays	2009-07-07	Paper
Multiline addressing by network flow	2009-05-06	Paper
ENERGY-AWARE STAGE ILLUMINATION	2008-08-26	Paper
Approximating the Interval Constrained Coloring Problem	2008-07-15	Paper
PACKING A TRUCK — NOW WITH A TWIST!	2008-05-20	Paper
Multiline Addressing by Network Flow	2008-03-11	Paper

Research outcomes over time

This page was built for person: Andreas Karrenbauer