Andreas Wiese

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 100

Top Venues

Berlin Institute of Technology (PHD)

Education History

Berlin Institute of Technology

PHD

Publications

Alexander Armbruster, Lars Rohwedder, Andreas Wiese
-norm. SOSA (2024)
Moritz Buchem, Paul Deuker, Andreas Wiese
Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically. SoCG (2024)
Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior, Andreas Wiese
Scheduling on a Stochastic Number of Machines. CoRR (2024)
Moritz Buchem, Paul Deuker, Andreas Wiese
Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically. CoRR (2024)
Arindam Khan, Aditya Subramanian, Tobias Widmann, Andreas Wiese
On Approximation Schemes for Stabbing Rectilinear Polygons. CoRR (2024)
Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. CoRR (2024)
Arturo Merino, Andreas Wiese
On the Two-Dimensional Knapsack Problem for Convex Polygons. ACM Trans. Algorithms 20 (2) (2024)
Moritz Buchem, Katja Ettmayr, Hugo K. K. Rosado, Andreas Wiese
A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds. SODA (2024)
Arindam Khan, Aditya Subramanian, Andreas Wiese
A PTAS for the horizontal rectangle stabbing problem. Math. Program. 206 (1) (2024)
Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects. ICALP (2024)
Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. SoCG (2023)
Moritz Buchem, Katja Ettmayr, Hugo Kooki Kasuya Rosado, Andreas Wiese
A (3+ε)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds. CoRR (2023)
MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese
-Center Clustering for Adaptive and Oblivious Adversaries. SODA (2023)
Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. CoRR (2023)
Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese
Exact and Approximation Algorithms for Routing a Convoy Through a Graph. MFCS (2023)
MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries. CoRR (2023)
Andrés Cristi, Mathieu Mari, Andreas Wiese
Fixed-Parameter Algorithms for Unsplittable Flow Cover. Theory Comput. Syst. 67 (1) (2023)
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm. CoRR (2023)
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
A PTAS for Minimizing Weighted Flow Time on a Single Machine. STOC (2023)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
Unsplittable Flow on a Path: The Game!. SODA (2022)
Debajyoti Kar, Arindam Khan, Andreas Wiese
Approximation Algorithms for ROUND-UFP and ROUND-SAP. CoRR (2022)
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing. ICALP (2022)
Debajyoti Kar, Arindam Khan, Andreas Wiese
Approximation Algorithms for Round-UFP and Round-SAP. ESA (2022)
Arindam Khan, Aditya Subramanian, Andreas Wiese
A PTAS for the Horizontal Rectangle Stabbing Problem. IPCO (2022)
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. SODA (2022)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
A PTAS for unsplittable flow on a path. STOC (2022)
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
A PTAS for Minimizing Weighted Flow Time on a Single Machine. CoRR (2022)
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing. CoRR (2022)
Syamantak Das, Andreas Wiese
A Simpler QPTAS for Scheduling Jobs with Precedence Constraints. ESA (2022)
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-packings. ACM Trans. Algorithms 17 (4) (2021)
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. CoRR (2021)
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem. CoRR (2021)
Tomás Martínez-Muñoz, Andreas Wiese
FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees. ESA (2021)
Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. FSTTCS (2021)
Arindam Khan, Aditya Subramanian, Andreas Wiese
A PTAS for the horizontal rectangle stabbing problem. CoRR (2021)
Hendrik Fichtenberger, Monika Henzinger, Andreas Wiese
On fully dynamic constant-factor approximation algorithms for clustering problems. CoRR (2021)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back. ESA (2021)
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. SoCG (2021)
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. CoRR (2021)
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem. SoCG (2021)
Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese
Additive Approximation Schemes for Load Balancing Problems. ICALP (2021)
Lars Rohwedder, Andreas Wiese
)-approximation algorithm for preemptive weighted flow time on a single machine. STOC (2021)
Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. CoRR (2020)
Lars Rohwedder, Andreas Wiese
A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine. CoRR (2020)
Tobias Mömke, Andreas Wiese
Breaking the Barrier of 2 for the Storage Allocation Problem. ICALP (2020)
Arturo I. Merino, Andreas Wiese
On the Two-Dimensional Knapsack Problem for Convex Polygons. CoRR (2020)
Monika Henzinger, Stefan Neumann, Andreas Wiese
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. SoCG (2020)
Andrés Cristi, Mathieu Mari, Andreas Wiese
Fixed-Parameter Algorithms for Unsplittable Flow Cover. STACS (2020)
Victor Verdugo, José Verschae, Andreas Wiese
Breaking symmetries to rescue sum of squares in the case of makespan scheduling. Math. Program. 183 (1) (2020)
Arturo I. Merino, Andreas Wiese
On the Two-Dimensional Knapsack Problem for Convex Polygons. ICALP (2020)
Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese
Additive Approximation Schemes for Load Balancing Problems. CoRR (2020)
Hans Raj Tiwary, Victor Verdugo, Andreas Wiese
On the extension complexity of scheduling polytopes. Oper. Res. Lett. 48 (4) (2020)
Andrés Cristi, Andreas Wiese
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation. STACS (2020)
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. Algorithmica 82 (6) (2020)
Monika Henzinger, Stefan Neumann, Andreas Wiese
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. CoRR (2020)
Monika Henzinger, Stefan Neumann, Andreas Wiese
Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity. CoRR (2020)
Fabrizio Grandoni, Andreas Wiese
Packing Cars into Narrow Roads: PTASs for Limited Supply Highway. ESA (2019)
Hans Raj Tiwary, Victor Verdugo, Andreas Wiese
On the extension complexity of scheduling. CoRR (2019)
Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. J. ACM 66 (4) (2019)
Vincenzo Bonifaci, Andreas Wiese, Sanjoy K. Baruah, Alberto Marchetti-Spaccamela, Sebastian Stiller, Leen Stougie
A Generalized Parallel Task Model for Recurrent Real-Time Processes. ACM Trans. Parallel Comput. 6 (1) (2019)
Sandy Heydrich, Andreas Wiese
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem. ACM Trans. Algorithms 15 (4) (2019)
Tobias Mömke, Andreas Wiese
Breaking the Barrier of 2 for the Storage Allocation Problem. CoRR (2019)
Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. ESA (2019)
Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack. CoRR (2019)
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
Submodular unsplittable flow on trees. Math. Program. 172 (1-2) (2018)
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs. CoRR (2018)
Wiebke Höhn, Julián Mestre, Andreas Wiese
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions. Algorithmica 80 (4) (2018)
Andreas Wiese
Fixed-Parameter Approximation Schemes for Weighted Flowtime. APPROX-RANDOM (2018)
Andreas Wiese
Independent Set of Convex Polygons: From $$n^{\epsilon }$$ n ϵ to $$1+\epsilon $$ 1 + ϵ via Shrinking. Algorithmica 80 (3) (2018)
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs. ESA (2018)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes. STOC (2018)
Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. 172 (1-2) (2018)
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path. ACM Trans. Algorithms 14 (4) (2018)
Sandy Heydrich, Andreas Wiese
Faster approximation schemes for the two-dimensional knapsack problem. SODA (2017)
Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
Approximation Schemes for Independent Set and Sparse Subsets of Polygons. CoRR (2017)
Syamantak Das, Andreas Wiese
On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine. ESA (2017)
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack. SODA (2017)
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-Packings. FOCS (2017)
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking. MFCS (2017)
Andreas Wiese
A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time. ICALP (2017)
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-packings. CoRR (2017)
Antonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae, Andreas Wiese
A QPTAS for the General Scheduling Problem with Identical Release Dates. ICALP (2017)
Stefan Neumann, Andreas Wiese
This House Proves That Debating is Harder Than Soccer. FUN (2016)
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
Approximation and parameterized algorithms for geometric independent set with shrinking. CoRR (2016)
Giorgi Nadiradze, Andreas Wiese
On approximating strip packing with a better ratio than 3/2. SODA (2016)
Maryam Nazarieh, Andreas Wiese, Thorsten Will, Mohamed Hamed, Volkhard Helms
Identification of key player genes in gene regulatory networks. BMC Syst. Biol. 10 (2016)
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
Submodular Unsplittable Flow on Trees. IPCO (2016)
Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO (2016)
Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese
The Power of Recourse for Online MST and TSP. SIAM J. Comput. 45 (3) (2016)
Elisabeth Lübbecke, Olaf Maurer, Nicole Megow, Andreas Wiese
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. ACM Trans. Algorithms 13 (1) (2016)
Andreas Wiese
to 1+ϵ via Shrinking. LATIN (2016)
Stefan Neumann, Andreas Wiese
This House Proves that Debating is Harder than Soccer. CoRR (2016)
Tobias Mömke, Andreas Wiese
A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem. ICALP (1) (2015)
Matthias Mnich, Andreas Wiese
Scheduling and fixed-parameter tractability. Math. Program. 154 (1-2) (2015)
Anna Adamaszek, Andreas Wiese
A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem. SODA (2015)
Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, Andreas Wiese
New Approximation Schemes for Unsplittable Flow on a Path. SODA (2015)
Fidaa Abed, Parinya Chalermsook, José R. Correa, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, Andreas Wiese
On Guillotine Cutting Sequences. APPROX-RANDOM (2015)
Martin Niemeier, Andreas Wiese
Scheduling with an Orthogonal Resource Constraint. Algorithmica 71 (4) (2015)
Anna Adamaszek, Parinya Chalermsook, Andreas Wiese
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. APPROX-RANDOM (2015)
Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese
Assigning sporadic tasks to unrelated machines. Math. Program. 152 (1-2) (2015)

Andreas Wiese.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Andreas Wiese