Departamento de Ingenieria Industrial
Facultad de Ciencias Fisicas y Matematicas
Universidad de Chile
Beauchef 851 Of. 707 Piso 7
Santiago Centro
CHILE
Combinatorial optimization
Approximation algorithms
Packing problems
Geometric problems
Scheduling
Approximation algorithms for packing problems (Fondecyt Regular, Principle Investigator)
IN3701 Modelamiento y Optimizacion (English section, fall term 2017)
Optimization (MPI for Informatics, summer term 2016)
Approximation algorithms and hardness of approximation (MPI for Informatics, winter term 2015/16)
Approximation algorithms and hardness of approximation (MPI for Informatics, summer term 2014)
Waldo Galvez, Fabrizio Grandoni, Sandy
Heydrich, Salvatore Ingala, Arindam Khan and Andreas Wiese
Approximating Geometric Knapsack via L-packings
In Proceedings of the
58th Annual IEEE Symposium on Foundations of Computer
Science (FOCS 2017)
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)
accepted for publication in Algorithmica
Giorgi Nadiradze and Andreas Wiese
On approximating strip packing with a better ratio than 3/2
In Proceedings of the 27th Annual ACM-SIAM 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,
José Correa, Andreas Karrenbauer, Pablo Perez-Lantero,
José 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 ACM-SIAM Symposium on
Discrete Algorithms (SODA 2015)
Anna Adamaszek and Andreas Wiese
A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
In Proceedings of the 26th Annual ACM-SIAM Symposium on
Discrete Algorithms (SODA 2015)
Wiebke Höhn, Julian Mestre, and
Andreas Wiese
How Unsplittable-Flow-Covering helps Scheduling with
Job-Dependent Cost Functions
In Proceedings of the 41st International Colloquium on
Automata, Languages, and Programming (ICALP 2014)
Matthias Mnich and Andreas Wiese
Scheduling and fixed-parameter tractability
In Proceedings of the 17th Conference on Integer Programming
and Combinatorial Optimization (IPCO 2014)
Mathematical Programming (2015)
Anna Adamaszek and Andreas Wiese
A QPTAS for Maximum Weight Independent Set of Polygons with
Polylogarithmically Many Vertices
In Proceedings of the 25th Annual ACM-SIAM 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 ACM-SIAM Symposium on
Discrete Algorithms (SODA 2014)
Vincenzo Bonifaci, Alberto
Marchetti-Spaccamela, Nicole Megow, and Andreas Wiese
Polynomial-Time Exact Schedulability Tests for Harmonic
Real-Time Tasks
In Proceedings of the 34th IEEE Real-Time 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
Marchetti-Spaccamela, Sebastian Stiller, and Andreas Wiese
Feasibility Analysis in the Sporadic DAG Task Model
In Proceedings of the 25th Euromicro Conference on Real-Time
Systems (ECRTS 2013)
Maxim Sviridenko and Andreas Wiese
Approximating the Configuration-LP 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 ACM-SIAM Symposium on
Discrete Algorithms (SODA 2013)
ACM Transactions on Algorithms
(2016)
Vincenzo Bonifaci, Alberto
Marchetti-Spaccamela, Andreas Wiese, Leen Stougie, and Sanjoy
Baruah
A generalized parallel task model for recurrent real-time
processes
In Proceedings of the 33rd IEEE Real-Time 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)
Algorithmica (2015)
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)
SIAM Journal of Computing
(2016)
Alberto Marchetti-Spaccamela, 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)
Mathematical Programming (2015)
Andreas Wiese, Vincenzo Bonifaci and
Sanjoy Baruah
Partitioned EDF scheduling on a few types of unrelated
multiprocessors
Real-Time Systems (2013)
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)
SIAM Journal on Computing (2014)
José Verschae and Andreas Wiese
On the Configuration-LP for Scheduling on Unrelated Machines
In Proceedings of the 19th European Symposium on Algorithms
(ESA 2011)
Journal of Scheduling (2014)
Martin Niemeier and Andreas Wiese and
Sanjoy Baruah
Partitioned Real-Time Scheduling on Heterogeneous Shared-Memory
Multiprocessors
In Proceedings of the 23rd Euromicro Conference on Real-Time
Systems (ECRTS 2011)