
Anna Adamaszek, Parinya Chalermsook, Alina Ene and Andreas Wiese
Submodular Unsplittable Flow on Trees
In Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO 2016)

Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo and Andreas Wiese
Semidefinite and linear programming integrality gaps for scheduling identical machines
In Proceedings of the 18th Conference on Integer Programming and Combinatorial Optimization (IPCO 2016)

Andreas Wiese
Independent set of convex polygons: from n^{ε} to 1+ε via shrinking
In Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN 2016)

Giorgi Nadiradze and Andreas Wiese
On approximating strip packing with a better ratio than 3/2
In Proceedings of the 27th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2016)

Anna Adamaszek, Parinya Chalermsook and Andreas Wiese
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking
In Proceedings of the 18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2015)

Fidaa Abed, Parinya Chalermsook, Jose Correa, Andreas Karrenbauer, Pablo PerezLantero, Jose Soto and Andreas Wiese
On guillotine cutting sequences
In Proceedings of the 18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2015)

Tobias Mömke and Andreas Wiese
A (2+ε)Approximation Algorithm for the Storage Allocation Problem
In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015)

Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, and Andreas Wiese
New Approximation Schemes for Unsplittable Flow on a Path
In Proceedings of the 26th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2015)

Anna Adamaszek and Andreas Wiese
A quasiPTAS for the TwoDimensional Geometric Knapsack Problem
In Proceedings of the 26th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2015)

Wiebke Höhn, Julian Mestre, and Andreas Wiese
How UnsplittableFlowCovering helps Scheduling with JobDependent Cost Functions
In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014)

Matthias Mnich and Andreas Wiese
Scheduling and fixedparameter tractability
In Proceedings of the 17th Conference on Integer Programming and Combinatorial Optimization (IPCO 2014)

Anna Adamaszek and Andreas Wiese
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
In Proceedings of the 25th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2014)

Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, and Andreas Wiese
A Mazing 2+ε Approximation for Unsplittable Flow on a Path
In Proceedings of the 25th Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2014)

Vincenzo Bonifaci, Alberto MarchettiSpaccamela, Nicole Megow, and Andreas Wiese
PolynomialTime Exact Schedulability Tests for Harmonic RealTime Tasks
In Proceedings of the 34th IEEE RealTime Systems Symposium (RTSS 2013)

Anna Adamaszek and Andreas Wiese
Approximation Schemes for Maximum Weight Independent Set of Rectangles
In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013)

Vincenzo Bonifaci, Alberto MarchettiSpaccamela, Sebastian Stiller, and Andreas Wiese
Feasibility Analysis in the Sporadic DAG Task Model
In Proceedings of the 25th Euromicro Conference on RealTime Systems (ECRTS 2013)

Maxim Sviridenko and Andreas Wiese
Approximating the ConfigurationLP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013)

Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi and Andreas Wiese
Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013)

Elisabeth Günther, Olaf Maurer, Nicole Megow, and Andreas Wiese
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In Proceedings of the 24st Annual ACMSIAM Symposium on Discrete Algorithms (SODA 2013)

Vincenzo Bonifaci, Alberto MarchettiSpaccamela, Andreas Wiese, Leen Stougie, and Sanjoy Baruah
A generalized parallel task model for recurrent realtime processes
In Proceedings of the 33rd IEEE RealTime Systems Symposium (RTSS 2012)

Martin Niemeier and Andreas Wiese
Scheduling with an Orthogonal Resource Constraint
In Proceedings of 10th Workshop on Approximation and Online Algorithms (WAOA 2012)

Nicole Megow, Martin Skutella, José Verschae, and Andreas Wiese
The Power of Recourse for Online MST and TSP
In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012)
 Alberto MarchettiSpaccamela, Cyriel Rutten, Suzanne van der Ster, and Andreas Wiese
Assigning Sporadic Tasks to Unrelated Parallel Machines
In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012)
 Andreas Wiese, Vincenzo Bonifaci and Sanjoy Baruah
Partitioned EDF scheduling on a few types of unrelated multiprocessors
RealTime Systems, 2012

Paul Bonsma, Jens Schulz, and Andreas Wiese
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
In Proceedings of the 52th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011)
 José Verschae and Andreas Wiese
On the ConfigurationLP for Scheduling on Unrelated Machines
In Proceedings of the 19th European Symposium on Algorithms (ESA 2011)
Britta Peis and Andreas Wiese
Universal packet routing with arbitrary bandwidths and transit times
in Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization (IPCO 2011)
 Martin Niemeier and Andreas Wiese and Sanjoy Baruah
Partitioned RealTime Scheduling on Heterogeneous SharedMemory Multiprocessors
In Proceedings of the 23rd Euromicro Conference on RealTime Systems (ECRTS 2011)
Sebastian Stiller and Andreas Wiese
Increasing speed scheduling and Flow scheduling
in Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010)
Britta Peis, Sebastian Stiller, and Andreas Wiese
Policies for Periodic Packet Routing
in Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010)
Britta Peis and Andreas Wiese
Throughput Maximization for Periodic Packet Routing on Trees and Grids
in Proceedings of the 8th Workshop on Approximation and Online Algorithms (WAOA 2010)
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck,
Martin Skutella,
José Verschae, and
Andreas Wiese
Solving an Avionics RealTime Scheduling Problem by Advanced IPMethods
in Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010)
Friedrich Eisenbrand,
Nicolai Hähnle,
Martin Niemeier,
Martin Skutella,
José Verschae, and
Andreas Wiese
Scheduling periodic tasks in a hard realtime environment
in Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010)
Britta Peis, Martin Skutella, and Andreas Wiese
Packet Routing on the Grid
in Proceedings of the 9th Latin American Symposium (LATIN 2010)
Ronald Koch, Britta Peis, Martin Skutella, and Andreas Wiese
RealTime Message Routing and Scheduling
in Proc. of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2009)
Britta Peis, Martin Skutella, and Andreas Wiese
Packet Routing: Complexity and Algorithms
in Proceedings of the 7th Workshop on Approximation and Online Algorithms (WAOA 2009)
Iyad A. Kanj, Andreas Wiese, and Fenghui Zhang
Local Algorithms for Edge Coloring in UDGs
in Proceedings of the 35th International Workshop on GraphTheoretic Concepts in Computer Science (WG 2009)
Andreas Wiese and Evangelos Kranakis
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
in Proceedings of the International Conference on Distributed Computing in Sensor Systems 2008 (DCOSS'08)
Andreas Wiese and Evangelos Kranakis
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
in Proceedings of the 34th International Workshop on GraphTheoretic Concepts in Computer Science (WG 2008)
Andreas Wiese and Evangelos Kranakis
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
in Proceedings of the 6th Workshop on Approximation and Online Algorithms (WAOA 2008)
Andreas Wiese and Evangelos Kranakis
Local Maximal Matching and Local 2Approximation for Vertex Cover in Unit Disk Graphs
in Proceedings of the 7th International Conference on ADHOC Networks & Wireless (ADHOCNOW 2008)
Andreas Wiese and Evangelos Kranakis
Impact of Locality on Location Aware Unit Disk Graph
in Proceedings of the 2nd International Workshop on Localized Algorithms and Protocols for Wireless Sensor Networks 2008 (LOCALGOS08)
an extended version appeared in Algorithms 2008, Volume 1(1), Page 229,
Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, and Andreas Wiese
Communication in wireless networks with directional antennas
in Proceedings of the 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2008)
B. Bhattacharya, B. Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, and Andreas Wiese
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region
in Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08)