Man

Andreas Wiese

Profesor asociado

UNIVERSIDAD DE CHILE

Santiago, Chile

Líneas de Investigación


Theoretical computer science, discrete mathematics. In particular, approximation algorithms, FPT-algorithms for packing problems and scheduling.

Educación

  •  Matemáticas, TECHNISCHE UNIVERSITÄT BERLIN. Alemania, 2011
  •  Matemáticas, TECHNISCHE UNIVERSITÄT BERLIN. Alemania, 2008

Experiencia Académica

  •   Profesor adjunto Full Time

    UNIVERSIDAD DE CHILE

    Facultad de Ciencias Físicas y Matemáticas

    Santiago, Chile

    2016 - 2019

  •   Investigador senior Full Time

    Max-Planck Institut für Informatik, Saarbrücken

    Saarbruecken, Alemania

    2014 - 2016

  •   Post-Doc Full Time

    Max-Planck Institut for Informatics, Saarbrücken

    Saarbruecken, Alemania

    2012 - 2014

  •   Post-Doc Full Time

    Università di Roma "La Sapienza"

    Rome, Italia

    2011 - 2012

  •   Post-Doc Full Time

    TECHNISCHE UNIVERSITÄT BERLIN

    Berlin, Alemania

    2011 - 2011

  •   Doctorando Full Time

    TECHNISCHE UNIVERSITÄT BERLIN

    Berlin, Alemania

    2008 - 2011

  •   Profesor asociado Full Time

    UNIVERSIDAD DE CHILE

    Facultad de Ciencias Físicas y Matemáticas

    Santiago, Chile

    2019 - A la fecha

Experiencia Profesional

  •   Doctorando Full Time

    Technische Universität Berlin

    Berlin, Alemania

    2008 - 2011

  •   Post-Doc Full Time

    Technische Universität Berlin

    Berlin, Alemania

    2011 - 2011

  •   Post-Doc Full Time

    Università di Roma ?La Sapienza?

    Roma, Italia

    2011 - 2012

  •   Post-Doc Full Time

    Max-Planck Institut for Informatics, Saarbrücken

    Saarbruecken, Alemania

    2012 - 2014

  •   Investigador senior Full Time

    Max-Planck Institut for Informatics, Saarbrücken

    Saarbruecken, Alemania

    2014 - 2016

  •   Profesor adjunto Full Time

    Universidad de Chile

    Chile

    2016 - 2019

  •   Profesor asociado Full Time

    Universidad de Chile

    Santiago, Chile

    2019 - A la fecha

  •   Editor Other

    Journal Information Processing Letters

    Holanda

    2019 - A la fecha

  •   Miembro de comite de contrataciones Other

    Departamento Ingeniería Industrial

    Santiago, Chile

    2019 - A la fecha

Formación de Capital Humano


Postdocs
2017 Kevin Schewior
2017 Andreas Tönnis
2017 Krzysztof Fleszar
2016 Syamantak Das
2015 Hang Zhou

PhD Students
2014 Sandy Heydrich (co-advised with Rob van Stee)

Master Students
2020 Tomas Martinez
2010 Sabrina Robert
2009 Sophie-Charlotte Bundle

Undergraduate students
2021 Sebastian Guerraty
2017 Cristobal Beltran

Research immersion lab
2015 Giorgi Nadiradze


Difusión y Transferencia


EVENTS
- Organizer/Co-organizer of the annual research workshop on combinatorial optimization at the Universidad de Chile, 2016-2021
- Co-organizer of the summer school “XIII Escuela de Verano en Matematicas Discretas” in Valparaíso in 2018
- Organizer of the summer school ADFOCS 2015 at the MPI for Informatics in Saarbrücken

APPLIED PROJECTS WITH INDUSTRY
2018-2021 Robust management of product delivery with multiple warehouses and variable time windows. Development of an algorithm library for routing of vehicles for product delivery, in particular vehicles with low capacity. Industrial partners: Bermann GPS and Santa Alberta (Chilean logistics companies).
2017-2018 Automated and optimized routing of delivery vehicles. Development of software for automated route planning of delivery vehicles. Industrial partner: Bermann GPS (Chilean logistics company).
2017-2019 Development of technologies for the control of fare evasion in public transport. Development of an automated tool for the planning of ticket controls in the public transportation system in Santiago. Industrial partner: Transantiago (public transportation system in Santiago).
2009-2010 Scheduling of on-board computers of aeroplanes. Development of optimization tools for the design of on-board computers of planes, in particular for the assignment and scheduling of the programs running on it. Industrial partner: Boeing (US airplane manufacturer).

RESEARCH VISITS
2016 Jose Correa and Jose Verschae at University of Chile
2016 Naveen Garg and Amit Kumar at IIT-Delhi
2015 Jose Correa and Jose Verschae at University of Chile
2014 Naveen Garg and Amit Kumar at IIT-Delhi
2014 Nikhil Bansal at TU Eindhoven
2013 Julian Mestre at University of Sydney
2012 Sanjoy Baruah at University of North Carolina at Chapel Hill

SERVICE TO THE ACADEMIC COMMUNITY
- Editor of Information Processing Letters (since February 2019)
- Member of the program committees of SODA 2022, APPROX 2021, LAGOS 2021, ESA 2020, WAOA 2019, SODA 2018, LATIN 2018, CIAC 2017, ESA 2015, APPROX 2015, WAOA 2015, WAOA 2014, MAPSP 2013, and WAOA 2012
- Reviewer for the Comisión Nacional de Investigación Científica y Tecnológica (CONICYT), the German Research Foundation (DFG), the National Science Centre Poland, the Natural Sciences and Engineering Research Council of Canada (NSERC), and the Israel Science Foundation (ISF)

TALKS AT INVITATION-ONLY WORKSHOPS
2020 Scheduling in Dagstuhl/Germany
2019 Scheduling Meets Fixed-Parameter Tractability in Leiden/The Netherlands
2018 Scheduling in Dagstuhl
2017 Approximation Algorithms and Parameterized Complexity in Banff/Canada
2016 Algorithms for Optimization Problems in Planar Graphs in Dagstuhl/Germany
2016 Scheduling in Dagstuhl/Germany
2015 Approximation Algorithms and Parameterized Complexity in Banff/Canada
2015 Scheduling under Uncertainty Workshop in Eindhoven/The Netherlands
2014 Approximation Algorithms and the Hardness of Approximation in Banff/Canada
2014 Flexible Network Design Workshop in Lugano/Switzerland
2014 New Challenges in Scheduling Theory in Aussois/France
2012 Flexible Network Design Workshop in Warschau/Poland
2012 New Challenges in Scheduling Theory in Frejus/France



 

Article (27)

Breaking symmetries to rescue sum of squares in the case of makespan scheduling
On the extension complexity of scheduling polytopes
A generalized parallel task model for recurrent real-time processes
Approximation Schemes for Independent Set and Sparse Subsets of Polygons
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
A mazing 2+? approximation for unsplittable flow on a path
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
Independent Set of Convex Polygons: From to via Shrinking
Semidefinite and linear programming integrality gaps for scheduling identical machines
Submodular unsplittable flow on trees
Approximation and parameterized algorithms for geometric independent set with shrinking
Faster approximation schemes for the two-dimensional knapsack problem (SODA 2017)
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack (SODA 2017)
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
The power of recourse for online MST and TSP
Assigning sporadic tasks to unrelated machines
Scheduling and fixed-parameter tractability
Scheduling with an Orthogonal Resource Constraint
A CONSTANT-FACTOR APPROXIMATION ALGORITHM FOR UNSPLITTABLE FLOW ON PATHS
On the configuration-LP for scheduling on unrelated machines
Partitioned EDF scheduling on a few types of unrelated multiprocessors
Analysing local algorithms in location-aware quasi-unit-disk graphs
Local algorithms for edge colorings in UDGs
Real-time Avionics Optimization
LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS
Optimal movement of mobile sensors for barrier coverage of a planar region
Impact of Locality on Location Aware Unit Disk Graphs

ConferencePaper (26)

Better Approximations for General Caching and UFP-Cover Under Resource Augmentation (STACS 2020)
Fixed-Parameter Algorithms for Unsplittable Flow Cover (STACS 2020)
Packing Cars into Narrow Roads: PTASs for Limited Supply Highway (ESA 2019)
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (ESA 2019)
A (5/3 +)-Approximation for unsplittable flow on a path: Placing small tasks into boxes
Fixed-Parameter approximation schemes for weighted flowtime
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
A (1 + ϵ)-approximation for Unsplittable Flow on a Path in fixed-parameter running time
A QPTAS for the general scheduling problem with identical release dates
Approximating Geometric Knapsack via L-packings
On minimizing the makespan when some jobs cannot be assigned on the same machine
Semidefinite and linear programming integrality gaps for scheduling identical machines
On guillotine cutting sequences
A (2+epsilon)-approximation algorithm for preemptive weighted flow time on a single machine (STOC 2021)
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths (FOCS 2011)
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio (SODA 2013)
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices (SODA 2014)
A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem (SODA 2015)
Approximation Schemes for Maximum Weight Independent Set of Rectangles (FOCS 2013)
Breaking the Barrier of 2 for the Storage Allocation Problem (ICALP 2020)
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles (SoCG 2020)
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More (SOCG 2021)
New Approximation Schemes for Unsplittable Flow on a Path (SODA 2015)
On approximating strip packing with a better ratio than 3/2 (SODA 2016)
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem (SOCG 2021)
On the Two-Dimensional Knapsack Problem for Convex Polygons (ICALP 2020)

Proyecto (13)

Optimization algorithms for geometric problems
E-retail=> algoritmos rápidos para la planificación logística
Gestión robusta para el despacho de productos desde múltiples bodegas con ventanas de tiempo variable
Gestión robusta para el despacho de productos desde múltiples bodegas con ventanas de tiempo variable
Approximation Algorithms for Packing Problems
Approximation algorithms for packing problems
Desarrollo de tecnologías para el control de la evasión en el transporte públic
Desarrollo de tecnologías para el control de la evasión en el transporte público
Fast Approximation Algorithms for Massive Data Sets
Fast Approximation Algorithms for Massive Data Sets
Núcleo Milenio Información y Coordinación en Redes
Estipendio por investigaciones de post-doc=> Approximation algorithms for Scheduling, Real-time scheduling, and Unsplittable Flow
Algorithm Engineering for Real-time Scheduling and Routing
57
Andreas Wiese

Profesor asociado

Departamento de Ingeniería Industrial

UNIVERSIDAD DE CHILE

Santiago, Chile

4
José Verschae

Profesor Asociado

Instituto de Ingeniería Matemática y Computacional

Pontificia Universidad Católica de Chile

Santiago, Chile

3
Víctor Verdugo

Associate Professor

Universidad de O'Higgins

Rancagua, Chile

1
José Soto

Associate Professor

Mathematical Engineering

Universidad de Chile

Santiago, Chile

1
PABLO PEREZ

Associate Professor

Matemática y Ciencia de la Computación

Universidad de Santiago de Chile

Santiago, Chile

1
Jose Correa

Full Professor

Industrial Engineering

Universidad de Chile

Santiago, Chile

1
Waldo Gálvez

Profesor Asistente

Universidad de O'Higgins

Rancagua, Chile