Andreas Karrenbauer

From MaRDI portal
Person:500991

Available identifiers

zbMath Open karrenbauer.andreasDBLP30/4385WikidataQ84720584 ScholiaQ84720584MaRDI QIDQ500991

List of research outcomes





PublicationDate of PublicationType
Reading articles online2023-03-21Paper
Near-optimal approximate shortest paths and transshipment in distributed and streaming models2023-02-03Paper
Improved online algorithm for fractional knapsack in the random order model2022-10-19Paper
Physarum-inspired multi-commodity flow dynamics2022-05-17Paper
Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models2021-05-27Paper
Dynamic sparsification for quadratic assignment problems2020-05-19Paper
Convergence of the non-uniform physarum dynamics2020-03-20Paper
Convergence of the non-uniform directed physarum model2020-03-20Paper
Leveling the Grid2019-09-12Paper
A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem2019-09-12Paper
Two results on slime mold computations2019-05-21Paper
Near-Optimal Distributed Maximum Flow2018-12-05Paper
On the Parameterized Complexity of Biclique Cover and Partition2018-04-10Paper
From DQBF to QBF by dependency elimination2017-11-15Paper
Energy-aware stage illumination2017-10-20Paper
https://portal.mardi4nfdi.de/entity/Q53518862017-08-31Paper
Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks2017-02-01Paper
A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases2016-11-30Paper
Near-optimal distributed maximum flow (extended abstract)2016-03-23Paper
The interval constrained 3-coloring problem2015-10-08Paper
A Simple Efficient Interior Point Method for Min-Cost Flow2015-09-11Paper
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition2014-10-08Paper
Algorithms for longer OLED lifetime2014-04-01Paper
Physarum can compute shortest paths: convergence proofs and complexity bounds2013-08-07Paper
Accelerated bend minimization2012-12-07Paper
Accelerated bend minimization2012-03-09Paper
Approximation algorithms for the interval constrained coloring problem2011-09-20Paper
A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks2011-02-15Paper
A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm2010-12-20Paper
The interval constrained 3-coloring problem2010-04-27Paper
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling2009-10-29Paper
Matching Techniques Ride to Rescue OLED Displays2009-07-07Paper
Multiline addressing by network flow2009-05-06Paper
ENERGY-AWARE STAGE ILLUMINATION2008-08-26Paper
Approximating the Interval Constrained Coloring Problem2008-07-15Paper
PACKING A TRUCK — NOW WITH A TWIST!2008-05-20Paper
Multiline Addressing by Network Flow2008-03-11Paper

Research outcomes over time

This page was built for person: Andreas Karrenbauer