| 2026 | ICALP | Multiplicative Assignment with Upgrades. | Alexander Armbruster, Lars Rohwedder, Stefan Weltge, Andreas Wiese, Ruilong Zhang |
| 2026 | SODA | Augmenting Packing Dynamic Programs to Handle (Many) Additional Budget Constraints. | Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese |
| 2026 | SODA | A (2 + ε)-approximation algorithm for the general scheduling problem in quasipolynomial time. | Alexander Armbruster, Lars Rohwedder, Andreas Wiese |
| 2026 | STOC | Improved Approximation Algorithms for Non-preemptive Throughput Maximization. | Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese |
| 2026 | STOC | Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations. | Debajyoti Kar, Arindam Khan, Andreas Wiese |
| 2025 | IJCAI | Finding Possible Winners in Spatial Voting with Incomplete Information. | Hadas Shachnai, Rotem Shavitt, Andreas Wiese |
| 2025 | IPCO | On the Approximability of Unsplittable Flow on a Path with Time Windows. | Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely, Andreas Wiese |
| 2024 | ICALP | Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. | Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese |
| 2024 | MOBIHOC | A Deadline-Aware Scheduler for Smart Factory using WiFi 6. | Mohit Jain, Anis Mishra, Andreas Wiese, Syamantak Das, Arani Bhattacharya, Mukulika Maity |
| 2024 | SODA | A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds. | Moritz Buchem, Katja Ettmayr, Hugo K. K. Rosado, Andreas Wiese |
| 2023 | MFCS | Exact and Approximation Algorithms for Routing a Convoy Through a Graph. | Martijn van Ee, Tim Oosterwijk, Ren Sitters, Andreas Wiese |
| 2023 | SODA | Optimal Fully Dynamic | MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese |
| 2023 | STOC | A PTAS for Minimizing Weighted Flow Time on a Single Machine. | Alexander Armbruster, Lars Rohwedder, Andreas Wiese |
| 2022 | ESA | A Simpler QPTAS for Scheduling Jobs with Precedence Constraints. | Syamantak Das, Andreas Wiese |
| 2022 | ESA | Approximation Algorithms for Round-UFP and Round-SAP. | Debajyoti Kar, Arindam Khan, Andreas Wiese |
| 2022 | ICALP | Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. | Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese |
| 2022 | IPCO | A PTAS for the Horizontal Rectangle Stabbing Problem. | Arindam Khan, Aditya Subramanian, Andreas Wiese |
| 2022 | SODA | A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. | Waldo Glvez, Arindam Khan, Mathieu Mari, Tobias Mmke, Madhusudhan Reddy Pittu, Andreas Wiese |
| 2022 | SODA | Unsplittable Flow on a Path: The Game!. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese |
| 2022 | STOC | A PTAS for unsplittable flow on a path. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese |
| 2021 | ESA | Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese |
| 2021 | ESA | FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees. | Toms Martnez-Muoz, Andreas Wiese |
| 2021 | ICALP | Additive Approximation Schemes for Load Balancing Problems. | Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese |
| 2021 | STOC | A (2 + | Lars Rohwedder, Andreas Wiese |
| 2020 | ICALP | On the Two-Dimensional Knapsack Problem for Convex Polygons. | Arturo Merino, Andreas Wiese |
| 2020 | ICALP | Breaking the Barrier of 2 for the Storage Allocation Problem. | Tobias Mmke, Andreas Wiese |
| 2020 | STACS | Fixed-Parameter Algorithms for Unsplittable Flow Cover. | Andrs Cristi, Mathieu Mari, Andreas Wiese |
| 2020 | STACS | Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. | Andrs Cristi, Andreas Wiese |
| 2019 | ESA | Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. | Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese |
| 2019 | ESA | Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. | Fabrizio Grandoni, Andreas Wiese |
| 2018 | ESA | Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. | Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese |
| 2018 | STOC | A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese, Hang Zhou |
| 2017 | ESA | On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine. | Syamantak Das, Andreas Wiese |
| 2017 | FOCS | Approximating Geometric Knapsack via L-Packings. | Waldo Glvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese |
| 2017 | ICALP | A QPTAS for the General Scheduling Problem with Identical Release Dates. | Antonios Antoniadis, Ruben Hoeksma, Julie Meiner, Jos Verschae, Andreas Wiese |
| 2017 | ICALP | A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time. | Andreas Wiese |
| 2017 | MFCS | Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. | Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese |
| 2017 | SODA | To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. | Fabrizio Grandoni, Tobias Mmke, Andreas Wiese, Hang Zhou |
| 2017 | SODA | Faster approximation schemes for the two-dimensional knapsack problem. | Sandy Heydrich, Andreas Wiese |
| 2016 | FUN | This House Proves That Debating is Harder Than Soccer. | Stefan Neumann, Andreas Wiese |
| 2016 | IPCO | Submodular Unsplittable Flow on Trees. | Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese |
| 2016 | IPCO | Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. | Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mmke, Victor Verdugo, Andreas Wiese |
| 2016 | LATIN | Independent Set of Convex Polygons: From n | Andreas Wiese |
| 2016 | SODA | On approximating strip packing with a better ratio than 3/2. | Giorgi Nadiradze, Andreas Wiese |
| 2015 | ICALP | A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem. | Tobias Mmke, Andreas Wiese |
| 2015 | SODA | A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem. | Anna Adamaszek, Andreas Wiese |
| 2015 | SODA | New Approximation Schemes for Unsplittable Flow on a Path. | Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mmke, Andreas Wiese |
| 2014 | ICALP | How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. | Wiebke Hhn, Julin Mestre, Andreas Wiese |
| 2014 | IPCO | Scheduling and Fixed-Parameter Tractability. | Matthias Mnich, Andreas Wiese |
| 2014 | SODA | A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. | Anna Adamaszek, Andreas Wiese |
| 2014 | SODA | A Mazing 2+ | Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese |
| 2013 | ECRTS | Feasibility Analysis in the Sporadic DAG Task Model. | Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller, Andreas Wiese |
| 2013 | FOCS | Approximation Schemes for Maximum Weight Independent Set of Rectangles. | Anna Adamaszek, Andreas Wiese |
| 2013 | IPCO | Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. | Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese |
| 2013 | IPCO | Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines. | Maxim Sviridenko, Andreas Wiese |
| 2013 | SODA | A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. | Elisabeth Gnther, Olaf Maurer, Nicole Megow, Andreas Wiese |
| 2013 | RTSS | Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks. | Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Nicole Megow, Andreas Wiese |
| 2012 | ICALP | Assigning Sporadic Tasks to Unrelated Parallel Machines. | Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese |
| 2012 | ICALP | The Power of Recourse for Online MST and TSP. | Nicole Megow, Martin Skutella, Jos Verschae, Andreas Wiese |
| 2012 | RTSS | A Generalized Parallel Task Model for Recurrent Real-time Processes. | Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Leen Stougie, Andreas Wiese |
| 2012 | WAOA | Scheduling with an Orthogonal Resource Constraint. | Martin Niemeier, Andreas Wiese |
| 2011 | ECRTS | Partitioned Real-time Scheduling on Heterogeneous Shared-Memory Multiprocessors. | Martin Niemeier, Andreas Wiese, Sanjoy K. Baruah |
| 2011 | ESA | On the Configuration-LP for Scheduling on Unrelated Machines. | Jos Verschae, Andreas Wiese |
| 2011 | FOCS | A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths. | Paul S. Bonsma, Jens Schulz, Andreas Wiese |
| 2011 | IPCO | Universal Packet Routing with Arbitrary Bandwidths and Transit Times. | Britta Peis, Andreas Wiese |
| 2010 | ESA | Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. | Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, Jos Verschae, Andreas Wiese |
| 2010 | ICALP | Scheduling Periodic Tasks in a Hard Real-Time Environment. | Friedrich Eisenbrand, Nicolai Hhnle, Martin Niemeier, Martin Skutella, Jos Verschae, Andreas Wiese |
| 2010 | ISAAC | Policies for Periodic Packet Routing. | Britta Peis, Sebastian Stiller, Andreas Wiese |
| 2010 | ISAAC | Increasing Speed Scheduling and Flow Scheduling. | Sebastian Stiller, Andreas Wiese |
| 2010 | LATIN | Packet Routing on the Grid. | Britta Peis, Martin Skutella, Andreas Wiese |
| 2010 | WAOA | Throughput Maximization for Periodic Packet Routing on Trees and Grids. | Britta Peis, Andreas Wiese |
| 2009 | WAOA | Packet Routing: Complexity and Algorithms. | Britta Peis, Martin Skutella, Andreas Wiese |
| 2009 | WG | Local Algorithms for Edge Colorings in UDGs. | Iyad A. Kanj, Andreas Wiese, Fenghui Zhang |
| 2008 | COCOA | Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region. | Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese |
| 2008 | DCOSS | Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs. | Andreas Wiese, Evangelos Kranakis |
| 2008 | SPAA | Communication in wireless networks with directional antennas. | Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, Andreas Wiese |
| 2008 | WAOA | Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs. | Andreas Wiese, Evangelos Kranakis |
| 2008 | WG | Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. | Andreas Wiese, Evangelos Kranakis |