# Andreas Wiese

According to our database1, Andreas Wiese authored at least 86 papers between 2008 and 2021.

Collaborative distances:

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2021
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More.
CoRR, 2021

On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem.
CoRR, 2021

2020
On the extension complexity of scheduling polytopes.
Oper. Res. Lett., 2020

Breaking symmetries to rescue sum of squares in the case of makespan scheduling.
Math. Program., 2020

A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine.
CoRR, 2020

CoRR, 2020

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
CoRR, 2020

Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity.
CoRR, 2020

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.
Algorithmica, 2020

Better Approximations for General Caching and UFP-Cover Under Resource Augmentation.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Fixed-Parameter Algorithms for Unsplittable Flow Cover.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Breaking the Barrier of 2 for the Storage Allocation Problem.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

On the Two-Dimensional Knapsack Problem for Convex Polygons.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
A Generalized Parallel Task Model for Recurrent Real-Time Processes.
ACM Trans. Parallel Comput., 2019

Faster Approximation Schemes for the Two-Dimensional Knapsack Problem.
ACM Trans. Algorithms, 2019

Approximation Schemes for Independent Set and Sparse Subsets of Polygons.
J. ACM, 2019

On the extension complexity of scheduling.
CoRR, 2019

Packing Cars into Narrow Roads: PTASs for Limited Supply Highway.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path.
ACM Trans. Algorithms, 2018

Semidefinite and linear programming integrality gaps for scheduling identical machines.
Math. Program., 2018

Submodular unsplittable flow on trees.
Math. Program., 2018

Independent Set of Convex Polygons: From $$n^{\epsilon }$$ n ϵ to $$1+\epsilon$$ 1 + ϵ via Shrinking.
Algorithmica, 2018

How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions.
Algorithmica, 2018

A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Fixed-Parameter Approximation Schemes for Weighted Flowtime.
Proceedings of the Approximation, 2018

2017
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

A QPTAS for the General Scheduling Problem with Identical Release Dates.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Approximating Geometric Knapsack via L-Packings.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio.
ACM Trans. Algorithms, 2016

The Power of Recourse for Online MST and TSP.
SIAM J. Comput., 2016

Identification of key player genes in gene regulatory networks.
BMC Syst. Biol., 2016

On approximating strip packing with a better ratio than 3/2.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Independent Set of Convex Polygons: From n<sup>ϵ</sup> to 1+ϵ via Shrinking.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

This House Proves That Debating is Harder Than Soccer.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Scheduling and fixed-parameter tractability.
Math. Program., 2015

Math. Program., 2015

Scheduling with an Orthogonal Resource Constraint.
Algorithmica, 2015

New Approximation Schemes for Unsplittable Flow on a Path.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking.
Proceedings of the Approximation, 2015

On Guillotine Cutting Sequences.
Proceedings of the Approximation, 2015

2014
A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths.
SIAM J. Comput., 2014

On the configuration-LP for scheduling on unrelated machines.
J. Sched., 2014

A Mazing 2+<i>∊</i> Approximation for Unsplittable Flow on a Path.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Partitioned EDF scheduling on a few types of unrelated multiprocessors.
Real Time Syst., 2013

Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model
CoRR, 2013

Scheduling Meets Fixed-Parameter Tractability.
CoRR, 2013

A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks.
Proceedings of the IEEE 34th Real-Time Systems Symposium, 2013

Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Approximation Schemes for Maximum Weight Independent Set of Rectangles.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Proceedings of the 25th Euromicro Conference on Real-Time Systems, 2013

2012
CoRR, 2012

A Mazing 2+eps Approximation for Unsplittable Flow on a Path
CoRR, 2012

Scheduling Unrelated Machines of Few Different Types
CoRR, 2012

A Generalized Parallel Task Model for Recurrent Real-time Processes.
Proceedings of the 33rd IEEE Real-Time Systems Symposium, 2012

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Packet routing and scheduling.
PhD thesis, 2011

Local algorithms for edge colorings in UDGs.
Theor. Comput. Sci., 2011

Real-time Avionics Optimization.
it Inf. Technol., 2011

Analysing local algorithms in location-aware quasi-unit-disk graphs.
Discret. Appl. Math., 2011

Universal Packet Routing with Arbitrary Bandwidths and Transit Times.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Partitioned Real-time Scheduling on Heterogeneous Shared-Memory Multiprocessors.
Proceedings of the 23rd Euromicro Conference on Real-Time Systems, 2011

2010
Throughput Maximization for Periodic Packet Routing on Trees and Grids.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Packet Routing on the Grid.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Increasing Speed Scheduling and Flow Scheduling.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Policies for Periodic Packet Routing.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods.
Proceedings of the Algorithms, 2010

Scheduling periodic tasks in a hard real-time environment.
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

2009
Optimal movement of mobile sensors for barrier coverage of a planar region.
Theor. Comput. Sci., 2009

Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs.
Discret. Math. Algorithms Appl., 2009

Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs?
Ad Hoc Sens. Wirel. Networks, 2009

Packet Routing: Complexity and Algorithms.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Real-Time Message Routing and Scheduling.
Proceedings of the Approximation, 2009

2008
Impact of Locality on Location Aware Unit Disk Graphs.
Algorithms, 2008

Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Communication in wireless networks with directional antennas.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs.
Proceedings of the Ad-hoc, Mobile and Wireless Networks, 7th International Conference, 2008