The following pages link to Andreas Karrenbauer (Q500991):
Displaying 37 items.
- The interval constrained 3-coloring problem (Q500992) (← links)
- A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm (Q613330) (← links)
- Approximation algorithms for the interval constrained coloring problem (Q639285) (← links)
- Multiline addressing by network flow (Q1016524) (← links)
- From DQBF to QBF by dependency elimination (Q1680263) (← links)
- Improved online algorithm for fractional knapsack in the random order model (Q2085749) (← links)
- Physarum-inspired multi-commodity flow dynamics (Q2139048) (← links)
- Dynamic sparsification for quadratic assignment problems (Q2181762) (← links)
- Convergence of the non-uniform directed physarum model (Q2306021) (← links)
- Convergence of the non-uniform physarum dynamics (Q2306025) (← links)
- Two results on slime mold computations (Q2415321) (← links)
- Reading articles online (Q2692246) (← links)
- Near-Optimal Distributed Maximum Flow (Q2796244) (← links)
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
- Nearly Tight Approximability Results for Minimum Biclique Cover and Partition (Q2921408) (← links)
- A Simple Efficient Interior Point Method for Min-Cost Flow (Q2942676) (← links)
- Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks (Q2958312) (← links)
- A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks (Q3075459) (← links)
- PACKING A TRUCK — NOW WITH A TWIST! (Q3503017) (← links)
- Approximating the Interval Constrained Coloring Problem (Q3512460) (← links)
- ENERGY-AWARE STAGE ILLUMINATION (Q3521594) (← links)
- The Interval Constrained 3-Coloring Problem (Q3557052) (← links)
- Matching Techniques Ride to Rescue OLED Displays (Q3637055) (← links)
- An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling (Q3639265) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- On the Parameterized Complexity of Biclique Cover and Partition (Q4634394) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem (Q5232554) (← links)
- Leveling the Grid (Q5233716) (← links)
- Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (Q5327457) (← links)
- (Q5351886) (← links)
- Energy-aware stage illumination (Q5370630) (← links)
- Algorithms for longer OLED lifetime (Q5406218) (← links)
- Multiline Addressing by Network Flow (Q5449577) (← links)
- Accelerated Bend Minimization (Q5894781) (← links)
- Accelerated Bend Minimization (Q5895514) (← links)
- Near-optimal approximate shortest paths and transshipment in distributed and streaming models (Q6487479) (← links)
