Personal profile
Research interests
- Combinatorial optimization
- Approximation algorithms
- Packing problems
- Geometric problems
- Scheduling
- Operations research
Scientific Career
Andreas Wiese studied mathematics at the TU Berlin where he also did his PhD in mathematics. He was a postdoc at the "La Sapienza" University in Rome and at the MPI for Informatics in Saarbrücken. He has also been a professor at the Universidad de Chile in Santiago and at the Vrije Universiteit Amsterdam. Finally, Andreas Wiese joined TUM in 2022.
Education/Academic qualification
Management and Technology, PhD, PhD in Mathematics, TU Berlin
Award Date: 16 May 2011
Management and Technology, Master, Diploma in Mathematics, TU Berlin
Award Date: 31 Mar 2008
External positions
Associate Professor, Vrije Universiteit Amsterdam, Netherlands
1 Sep 2021 → 28 Feb 2022
Associate Professor, Universidad de Chile
1 Apr 2019 → 31 Jul 2021
Temporary Professorship, Universidad de Chile
1 Aug 2016 → 31 Mar 2019
Senior Researcher, Mpi Informatics
1 Mar 2014 → 31 Jul 2016
Post-Doc, Mpi Informatics
15 Oct 2012 → 28 Feb 2014
Post-Doc, Sapienza, Universita di Roma
1 Oct 2011 → 30 Sep 2012
Post-Doc, TU Berlin
1 May 2011 → 30 Sep 2011
Expertise related to UN Sustainable Development Goals
In 2015, UN member states agreed to 17 global Sustainable Development Goals (SDGs) to end poverty, protect the planet and ensure prosperity for all. This person’s work contributes towards the following SDG(s):
-
SDG 3 Good Health and Well-being -
SDG 8 Decent Work and Economic Growth -
SDG 9 Industry, Innovation, and Infrastructure
Fingerprint
- 1 Similar Profiles
Collaborations and top research areas from the last five years
-
A (2 + ε)-approximation algorithm for the general scheduling problem in quasipolynomial time
Armbruster, A., Rohwedder, L. & Wiese, A., 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026. Larsen, K. G. & Saha, B. (eds.). Association for Computing Machinery, p. 3498-3510 13 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2026-January).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Augmenting Packing Dynamic Programs to Handle (Many) Additional Budget Constraints
Armbruster, A., Grandoni, F., Tinguely, A. & Wiese, A., 2026, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026. Larsen, K. G. & Saha, B. (eds.). Association for Computing Machinery, p. 1521-1535 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2026-January).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Exact and approximation algorithms for routing a convoy through a graph
van Ee, M., Oosterwijk, T., Sitters, R. & Wiese, A., Sep 2025, In: Mathematical Programming. 213, 1-2, p. 985-1008 24 p.Research output: Contribution to journal › Article › peer-review
Open Access -
Finding Possible Winners in Spatial Voting with Incomplete Information
Shachnai, H., Shavitt, R. & Wiese, A., 2025, Proceedings of the 34th International Joint Conference on Artificial Intelligence, IJCAI 2025. Kwok, J. (ed.). International Joint Conferences on Artificial Intelligence, p. 4048-4056 9 p. (IJCAI International Joint Conference on Artificial Intelligence).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
On the Approximability of Unsplittable Flow on a Path with Time Windows
Armbruster, A., Grandoni, F., Husić, E., Tinguely, A. & Wiese, A., 2025, Integer Programming and Combinatorial Optimization - 26th International Conference, IPCO 2025, Proceedings. Megow, N. & Basu, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 29-42 14 p. (Lecture Notes in Computer Science; vol. 15620 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2 Scopus citations