Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs. - Andreas Wiese; Evangelos Kranakis (ADHOC-NOW, 2008)

Communication in wireless networks with directional antennas. - Ioannis Caragiannis; Christos Kaklamanis; Evangelos Kranakis; Danny Krizanc; Andreas Wiese (SPAA, 2008)

Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs. - Andreas Wiese; Evangelos Kranakis (WAOA, 2008)

Impact of Locality on Location Aware Unit Disk Graphs. - Andreas Wiese; Evangelos Kranakis (Algorithms, 2008)

Real-Time Message Routing and Scheduling. - Ronald Koch; Britta Peis; Martin Skutella; Andreas Wiese (APPROX-RANDOM, 2009)

Packet Routing: Complexity and Algorithms. - Britta Peis; Martin Skutella; Andreas Wiese (WAOA, 2009)

Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs? - Andreas Wiese; Evangelos Kranakis (Ad Hoc Sens. Wirel. Networks, 2009)

Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. - Andreas Wiese; Evangelos Kranakis (Discret. Math. Algorithms Appl., 2009)

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 (Theor. Comput. Sci., 2009)

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 (ESA (1), 2010)

Scheduling Periodic Tasks in a Hard Real-Time Environment. - Friedrich Eisenbrand; Nicolai Hähnle; Martin Niemeier; Martin Skutella; José Verschae; Andreas Wiese (ICALP (1), 2010)

Policies for Periodic Packet Routing. - Britta Peis; Sebastian Stiller; Andreas Wiese (ISAAC (2), 2010)

Increasing Speed Scheduling and Flow Scheduling. - Sebastian Stiller; Andreas Wiese (ISAAC (2), 2010)

Packet Routing on the Grid. - Britta Peis; Martin Skutella; Andreas Wiese (LATIN, 2010)

Throughput Maximization for Periodic Packet Routing on Trees and Grids. - Britta Peis; Andreas Wiese (WAOA, 2010)

Partitioned Real-time Scheduling on Heterogeneous Shared-Memory Multiprocessors. - Martin Niemeier; Andreas Wiese; Sanjoy K. Baruah (ECRTS, 2011)

Universal Packet Routing with Arbitrary Bandwidths and Transit Times. - Britta Peis; Andreas Wiese (IPCO, 2011)

Analysing local algorithms in location-aware quasi-unit-disk graphs. - Marja Hassinen; Joel Kaasinen; Evangelos Kranakis; Valentin Polishchuk; Jukka Suomela; Andreas Wiese (Discret. Appl. Math., 2011)

Real-time Avionics Optimization. - Friedrich Eisenbrand; Martin Niemeier; Martin Skutella; José Verschae; Andreas Wiese (it Inf. Technol., 2011)

Local algorithms for edge colorings in UDGs. - Iyad A. Kanj; Andreas Wiese; Fenghui Zhang (Theor. Comput. Sci., 2011)

Packet routing and scheduling. - Andreas Wiese (2011)

Assigning Sporadic Tasks to Unrelated Parallel Machines. - Alberto Marchetti-Spaccamela; Cyriel Rutten; Suzanne van der Ster; Andreas Wiese (ICALP (1), 2012)

A Generalized Parallel Task Model for Recurrent Real-time Processes. - Sanjoy K. Baruah; Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Leen Stougie; Andreas Wiese (RTSS, 2012)

Scheduling Unrelated Machines of Few Different Types - Vincenzo Bonifaci; Andreas Wiese (CoRR, 2012)

A Mazing 2+eps Approximation for Unsplittable Flow on a Path - Aris Anagnostopoulos; Fabrizio Grandoni 001; Stefano Leonardi 001; Andreas Wiese (CoRR, 2012)

Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model - Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Sebastian Stiller; Andreas Wiese (CoRR, 2012)

Feasibility Analysis in the Sporadic DAG Task Model. - Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Sebastian Stiller; Andreas Wiese (ECRTS, 2013)

Approximation Schemes for Maximum Weight Independent Set of Rectangles. - Anna Adamaszek; Andreas Wiese (FOCS, 2013)

Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path. - Aris Anagnostopoulos; Fabrizio Grandoni 001; Stefano Leonardi 001; Andreas Wiese (IPCO, 2013)

Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines. - Maxim Sviridenko; Andreas Wiese (IPCO, 2013)

Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks. - Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Nicole Megow; Andreas Wiese (RTSS, 2013)

A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. - Elisabeth Günther; Olaf Maurer; Nicole Megow; Andreas Wiese (SODA, 2013)

Scheduling Meets Fixed-Parameter Tractability. - Matthias Mnich; Andreas Wiese (CoRR, 2013)

Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model - Nicole Megow; Andreas Wiese (CoRR, 2013)

Partitioned EDF scheduling on a few types of unrelated multiprocessors. - Andreas Wiese; Vincenzo Bonifaci; Sanjoy K. Baruah (Real Time Syst., 2013)

A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices. - Anna Adamaszek; Andreas Wiese (SODA, 2014)

A Mazing 2+∊ Approximation for Unsplittable Flow on a Path. - Aris Anagnostopoulos; Fabrizio Grandoni 001; Stefano Leonardi 001; Andreas Wiese (SODA, 2014)

On the configuration-LP for scheduling on unrelated machines. - José Verschae; Andreas Wiese (J. Sched., 2014)

A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths. - Paul S. Bonsma; Jens Schulz; Andreas Wiese (SIAM J. Comput., 2014)

On Guillotine Cutting Sequences. - Fidaa Abed; Parinya Chalermsook; José Correa 001; Andreas Karrenbauer; Pablo Pérez-Lantero; José A. Soto; Andreas Wiese (APPROX-RANDOM, 2015)

How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. - Anna Adamaszek; Parinya Chalermsook; Andreas Wiese (APPROX-RANDOM, 2015)

A (2+ epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem. - Tobias Mömke; Andreas Wiese (ICALP (1), 2015)

A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem. - Anna Adamaszek; Andreas Wiese (SODA, 2015)

New Approximation Schemes for Unsplittable Flow on a Path. - Jatin Batra; Naveen Garg 001; Amit Kumar 001; Tobias Mömke; Andreas Wiese (SODA, 2015)

Scheduling with an Orthogonal Resource Constraint. - Martin Niemeier; Andreas Wiese (Algorithmica, 2015)

Assigning sporadic tasks to unrelated machines. - Alberto Marchetti-Spaccamela; Cyriel Rutten; Suzanne van der Ster; Andreas Wiese (Math. Program., 2015)

Scheduling and fixed-parameter tractability. - Matthias Mnich; Andreas Wiese (Math. Program., 2015)

This House Proves That Debating is Harder Than Soccer. - Stefan Neumann 003; Andreas Wiese (FUN, 2016)

Independent Set of Convex Polygons: From nϵ to 1+ϵ via Shrinking. - Andreas Wiese (LATIN, 2016)

On approximating strip packing with a better ratio than 3/2. - Giorgi Nadiradze; Andreas Wiese (SODA, 2016)

Identification of key player genes in gene regulatory networks. - Maryam Nazarieh; Andreas Wiese; Thorsten Will; Mohamed Hamed; Volkhard Helms (BMC Syst. Biol., 2016)

The Power of Recourse for Online MST and TSP. - Nicole Megow; Martin Skutella; José Verschae; Andreas Wiese (SIAM J. Comput., 2016)

A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. - Elisabeth Lübbecke; Olaf Maurer; Nicole Megow; Andreas Wiese (ACM Trans. Algorithms, 2016)

On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine. - Syamantak Das; Andreas Wiese (ESA, 2017)

A QPTAS for the General Scheduling Problem with Identical Release Dates. - Antonios Antoniadis 001; Ruben Hoeksma; Julie Meißner; José Verschae; Andreas Wiese (ICALP, 2017)

A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time. - Andreas Wiese (ICALP, 2017)

Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. - Michal Pilipczuk; Erik Jan van Leeuwen; Andreas Wiese (MFCS, 2017)

To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. - Fabrizio Grandoni 001; Tobias Mömke; Andreas Wiese; Hang Zhou 001 (SODA, 2017)

Fixed-Parameter Approximation Schemes for Weighted Flowtime. - Andreas Wiese (APPROX-RANDOM, 2018)

A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. - Fabrizio Grandoni 001; Tobias Mömke; Andreas Wiese; Hang Zhou 001 (STOC, 2018)

How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. - Wiebke Höhn; Julián Mestre; Andreas Wiese (Algorithmica, 2018)

Independent Set of Convex Polygons: From $$n^{ epsilon }$$ n ϵ to $$1+ epsilon $$ 1 + ϵ via Shrinking. - Andreas Wiese (Algorithmica, 2018)

Submodular unsplittable flow on trees. - Anna Adamaszek; Parinya Chalermsook; Alina Ene; Andreas Wiese (Math. Program., 2018)

Semidefinite and linear programming integrality gaps for scheduling identical machines. - Adam Kurpisz; Monaldo Mastrolilli; Claire Mathieu; Tobias Mömke; Victor Verdugo; Andreas Wiese (Math. Program., 2018)

A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path. - Aris Anagnostopoulos; Fabrizio Grandoni 001; Stefano Leonardi 001; Andreas Wiese (ACM Trans. Algorithms, 2018)

Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. - Fabrizio Grandoni 001; Stefan Kratsch; Andreas Wiese (ESA, 2019)

Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. - Fabrizio Grandoni 001; Andreas Wiese (ESA, 2019)

On the extension complexity of scheduling. - Hans Raj Tiwary; Victor Verdugo; Andreas Wiese (CoRR, 2019)

Approximation Schemes for Independent Set and Sparse Subsets of Polygons. - Anna Adamaszek; Sariel Har-Peled; Andreas Wiese (J. ACM, 2019)

Faster Approximation Schemes for the Two-Dimensional Knapsack Problem. - Sandy Heydrich; Andreas Wiese (ACM Trans. Algorithms, 2019)

A Generalized Parallel Task Model for Recurrent Real-Time Processes. - Vincenzo Bonifaci; Andreas Wiese; Sanjoy K. Baruah; Alberto Marchetti-Spaccamela; Sebastian Stiller; Leen Stougie (ACM Trans. Parallel Comput., 2019)

Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. - Monika Henzinger; Stefan Neumann 003; Andreas Wiese (SoCG, 2020)

Breaking the Barrier of 2 for the Storage Allocation Problem. - Tobias Mömke; Andreas Wiese (ICALP, 2020)

Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. - Andrés Cristi; Andreas Wiese (STACS, 2020)

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. - Michal Pilipczuk; Erik Jan van Leeuwen; Andreas Wiese (Algorithmica, 2020)

Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. - Monika Henzinger; Stefan Neumann 003; Andreas Wiese (CoRR, 2020)

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. - Martin Böhm 001; Franziska Eberle; Nicole Megow; Lukas Nölke; Jens Schlöter; Bertrand Simon 001; Andreas Wiese (CoRR, 2020)

A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine. - Lars Rohwedder; Andreas Wiese (CoRR, 2020)

Breaking symmetries to rescue sum of squares in the case of makespan scheduling. - Victor Verdugo; José Verschae; Andreas Wiese (Math. Program., 2020)

On the extension complexity of scheduling polytopes. - Hans Raj Tiwary; Victor Verdugo; Andreas Wiese (Oper. Res. Lett., 2020)

On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem. - Arindam Khan 001; Arnab Maiti; Amatya Sharma; Andreas Wiese (SoCG, 2021)

Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. - Waldo Gálvez; Fabrizio Grandoni 001; Arindam Khan 001; Diego Ramírez-Romero; Andreas Wiese (SoCG, 2021)

Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. - Fabrizio Grandoni 001; Tobias Mömke; Andreas Wiese (ESA, 2021)

FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees. - Tomás Martínez-Muñoz; Andreas Wiese (ESA, 2021)

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. - Franziska Eberle; Nicole Megow; Lukas Nölke; Bertrand Simon 001; Andreas Wiese (FSTTCS, 2021)

Additive Approximation Schemes for Load Balancing Problems. - Moritz Buchem; Lars Rohwedder; Tjark Vredeveld; Andreas Wiese (ICALP, 2021)

A (2 + ε)-approximation algorithm for preemptive weighted flow time on a single machine. - Lars Rohwedder; Andreas Wiese (STOC, 2021)

A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. - Waldo Gálvez; Arindam Khan 001; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas Wiese (CoRR, 2021)

On fully dynamic constant-factor approximation algorithms for clustering problems. - Hendrik Fichtenberger; Monika Henzinger; Andreas Wiese (CoRR, 2021)

Approximating Geometric Knapsack via L-packings. - Waldo Gálvez; Fabrizio Grandoni 001; Salvatore Ingala; Sandy Heydrich; Arindam Khan 001; Andreas Wiese (ACM Trans. Algorithms, 2021)

A Simpler QPTAS for Scheduling Jobs with Precedence Constraints. - Syamantak Das; Andreas Wiese (ESA, 2022)

Approximation Algorithms for Round-UFP and Round-SAP. - Debajyoti Kar; Arindam Khan 001; Andreas Wiese (ESA, 2022)

Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. - Arindam Khan 001; Aditya Lonkar; Arnab Maiti; Amatya Sharma; Andreas Wiese (ICALP, 2022)

A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. - Waldo Gálvez; Arindam Khan 001; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas Wiese (SODA, 2022)

Unsplittable Flow on a Path: The Game!. - Fabrizio Grandoni 001; Tobias Mömke; Andreas Wiese (SODA, 2022)

A PTAS for unsplittable flow on a path. - Fabrizio Grandoni 001; Tobias Mömke; Andreas Wiese (STOC, 2022)

Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. - Arindam Khan 001; Aditya Lonkar; Saladi Rahul; Aditya Subramanian 001; Andreas Wiese (SoCG, 2023)

Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. - MohammadHossein Bateni; Hossein Esfandiari; Hendrik Fichtenberger; Monika Henzinger; Rajesh Jayaram; Vahab Mirrokni; Andreas Wiese (SODA, 2023)

A PTAS for Minimizing Weighted Flow Time on a Single Machine. - Alexander Armbruster; Lars Rohwedder; Andreas Wiese (STOC, 2023)

Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. - MohammadHossein Bateni; Hossein Esfandiari; Hendrik Fichtenberger; Monika Henzinger; Rajesh Jayaram; Vahab Mirrokni; Andreas Wiese (CoRR, 2023)

Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. - Alexander Armbruster; Lars Rohwedder; Andreas Wiese (CoRR, 2023)

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 (CoRR, 2023)

Fixed-Parameter Algorithms for Unsplittable Flow Cover. - Andrés Cristi; Mathieu Mari; Andreas Wiese (Theory Comput. Syst., 2023)

Scheduling on a Stochastic Number of Machines. - Moritz Buchem; Franziska Eberle; Hugo Kooki Kasuya Rosado; Kevin Schewior; Andreas Wiese (APPROX/RANDOM, 2024)

Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically. - Moritz Buchem; Paul Deuker; Andreas Wiese (SoCG, 2024)

On Approximation Schemes for Stabbing Rectilinear Polygons. - Arindam Khan 001; Aditya Subramanian 001; Tobias Widmann; Andreas Wiese (FSTTCS, 2024)

Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. - Pritam Acharya; Sujoy Bhore; Aaryan Gupta; Arindam Khan 001; Bratin Mondal; Andreas Wiese (ICALP, 2024)

A Deadline-Aware Scheduler for Smart Factory using WiFi 6. - Mohit Jain; Anis Mishra; Andreas Wiese; Syamantak Das; Arani Bhattacharya; Mukulika Maity (MobiHoc, 2024)

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 (SODA, 2024)

Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. - Alexander Armbruster; Lars Rohwedder; Andreas Wiese (SOSA, 2024)

On the Two-Dimensional Knapsack Problem for Convex Polygons. - Arturo Merino; Andreas Wiese (ACM Trans. Algorithms, 2024)

A PTAS for the horizontal rectangle stabbing problem. - Arindam Khan 001; Aditya Subramanian 001; Andreas Wiese (Math. Program., 2024)

On the Approximability of Unsplittable Flow on a Path with Time Windows. - Alexander Armbruster; Fabrizio Grandoni 001; Edin Husic; Antoine Tinguely; Andreas Wiese (IPCO, 2025)

Multiplicative assignment with upgrades. - Alexander Armbruster; Lars Rohwedder; Stefan Weltge; Andreas Wiese; Ruilong Zhang 001 (CoRR, 2025)

Finding Possible Winners in Spatial Voting with Incomplete Information. - Hadas Shachnai; Rotem Shavitt; Andreas Wiese (CoRR, 2025)

Tight Approximation Algorithms for 2D Guillotine Strip Packing. - Arindam Khan 001; Aditya Lonkar; Arnab Maiti; Amatya Sharma; Andreas Wiese (ACM Trans. Algorithms, 2025)

Exact and approximation algorithms for routing a convoy through a graph. - Martijn van Ee; Tim Oosterwijk; René Sitters; Andreas Wiese (Math. Program., 2025)