Andreas Wiese

176 papers A* 34A 14B 24C 1Misc 1Journal 82Unranked 17
YearRankTypeTitle / Venue / Authors
2026 A* conf
A (2 + ε)-approximation algorithm for the general scheduling problem in quasipolynomial time.
SODA
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2026 J jnl
Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations.
CoRR
Debajyoti Kar, Arindam Khan, Andreas Wiese
2026 A* conf
Augmenting Packing Dynamic Programs to Handle (Many) Additional Budget Constraints.
SODA
Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese
2026 J jnl
Improved Approximation Algorithms for Non-Preemptive Throughput Maximization.
CoRR
Alexander Armbruster, Fabrizio Grandoni, Antoine Tinguely, Andreas Wiese
2025 J jnl
A (2+ϵ)-approximation algorithm for the general scheduling problem in quasipolynomial time.
CoRR
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2025 J jnl
A simpler QPTAS for scheduling jobs with precedence constraints.
CoRR
Syamantak Das, Andreas Wiese
2025 J jnl
Exact and approximation algorithms for routing a convoy through a graph.
Math. Program.
Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese
2025 A* conf
Finding Possible Winners in Spatial Voting with Incomplete Information.
IJCAI
Hadas Shachnai, Rotem Shavitt, Andreas Wiese
2025 J jnl
Finding Possible Winners in Spatial Voting with Incomplete Information.
CoRR
Hadas Shachnai, Rotem Shavitt, Andreas Wiese
2025 J jnl
Multiplicative assignment with upgrades.
CoRR
Alexander Armbruster, Lars Rohwedder, Stefan Weltge, Andreas Wiese, Ruilong Zhang
2025 B conf
On the Approximability of Unsplittable Flow on a Path with Time Windows.
IPCO
Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely, Andreas Wiese
2025 J jnl
On the Approximability of Unsplittable Flow on a Path with Time Windows.
CoRR
Alexander Armbruster, Fabrizio Grandoni, Edin Husic, Antoine Tinguely, Andreas Wiese
2025 J jnl
Tight Approximation Algorithms for 2D Guillotine Strip Packing.
ACM Trans. Algorithms
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
2024 A* conf
A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds.
SODA
Moritz Buchem, Katja Ettmayr, Hugo K. K. Rosado, Andreas Wiese
2024 B conf
A Deadline-Aware Scheduler for Smart Factory using WiFi 6.
MobiHoc
Mohit Jain, Anis Mishra, Andreas Wiese, Syamantak Das, Arani Bhattacharya, Mukulika Maity
2024 J jnl
A Deadline-Aware Scheduler for Smart Factory using WiFi 6.
CoRR
Mohit Jain, Anis Mishra, Syamantak Das, Andreas Wiese, Arani Bhattacharya, Mukulika Maity
2024 J jnl
A PTAS for the horizontal rectangle stabbing problem.
Math. Program.
Arindam Khan, Aditya Subramanian, Andreas Wiese
2024 A* conf
Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically.
SoCG
Moritz Buchem, Paul Deuker, Andreas Wiese
2024 J jnl
Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically.
CoRR
Moritz Buchem, Paul Deuker, Andreas Wiese
2024 A* conf
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects.
ICALP
Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese
2024 J jnl
Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects.
CoRR
Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal, Andreas Wiese
2024 — ed.
LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part I
LATIN (1)
José A. Soto, Andreas Wiese
2024 — ed.
LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part II
LATIN (2)
José A. Soto, Andreas Wiese
2024 — conf
On Approximation Schemes for Stabbing Rectilinear Polygons.
FSTTCS
Arindam Khan, Aditya Subramanian, Tobias Widmann, Andreas Wiese
2024 J jnl
On Approximation Schemes for Stabbing Rectilinear Polygons.
CoRR
Arindam Khan, Aditya Subramanian, Tobias Widmann, Andreas Wiese
2024 J jnl
On the Two-Dimensional Knapsack Problem for Convex Polygons.
ACM Trans. Algorithms
Arturo Merino, Andreas Wiese
2024 A conf
Scheduling on a Stochastic Number of Machines.
APPROX/RANDOM
Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior, Andreas Wiese
2024 J jnl
Scheduling on a Stochastic Number of Machines.
CoRR
Moritz Buchem, Franziska Eberle, Hugo Kooki Kasuya Rosado, Kevin Schewior, Andreas Wiese
2024 — conf
Simpler constant factor approximation algorithms for weighted flow time - now for any
SOSA
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2023 J jnl
A (3+ε)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds.
CoRR
Moritz Buchem, Katja Ettmayr, Hugo K. K. Rosado, Andreas Wiese
2023 A* conf
A PTAS for Minimizing Weighted Flow Time on a Single Machine.
STOC
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2023 B ed.
Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Amsterdam, The Netherlands, September 7-8, 2023, Proceedings
WAOA
Jaroslaw Byrka, Andreas Wiese
2023 B conf
Exact and Approximation Algorithms for Routing a Convoy Through a Graph.
MFCS
Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese
2023 J jnl
Fixed-Parameter Algorithms for Unsplittable Flow Cover.
Theory Comput. Syst.
Andrés Cristi, Mathieu Mari, Andreas Wiese
2023 A* conf
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set.
SoCG
Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese
2023 J jnl
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set.
CoRR
Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese
2023 A* conf
Optimal Fully Dynamic
SODA
MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese
2023 J jnl
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries.
CoRR
MohammadHossein Bateni, Hossein Esfandiari, Hendrik Fichtenberger, Monika Henzinger, Rajesh Jayaram, Vahab Mirrokni, Andreas Wiese
2023 J jnl
Simpler constant factor approximation algorithms for weighted flow time - now for any p-norm.
CoRR
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2022 A* conf
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles.
SODA
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
2022 J jnl
A PTAS for Minimizing Weighted Flow Time on a Single Machine.
CoRR
Alexander Armbruster, Lars Rohwedder, Andreas Wiese
2022 B conf
A PTAS for the Horizontal Rectangle Stabbing Problem.
IPCO
Arindam Khan, Aditya Subramanian, Andreas Wiese
2022 A* conf
A PTAS for unsplittable flow on a path.
STOC
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
2022 A conf
A Simpler QPTAS for Scheduling Jobs with Precedence Constraints.
ESA
Syamantak Das, Andreas Wiese
2022 J jnl
Approximation Algorithms for ROUND-UFP and ROUND-SAP.
CoRR
Debajyoti Kar, Arindam Khan, Andreas Wiese
2022 A conf
Approximation Algorithms for Round-UFP and Round-SAP.
ESA
Debajyoti Kar, Arindam Khan, Andreas Wiese
2022 J jnl
Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing.
CoRR
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
2022 A* conf
Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing.
ICALP
Arindam Khan, Aditya Lonkar, Arnab Maiti, Amatya Sharma, Andreas Wiese
2022 A* conf
Unsplittable Flow on a Path: The Game!.
SODA
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
2021 A* conf
A (2 +
STOC
Lars Rohwedder, Andreas Wiese
2021 J jnl
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles.
CoRR
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
2021 J jnl
A PTAS for the horizontal rectangle stabbing problem.
CoRR
Arindam Khan, Aditya Subramanian, Andreas Wiese
2021 A* conf
Additive Approximation Schemes for Load Balancing Problems.
ICALP
Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese
2021 J jnl
Approximating Geometric Knapsack via L-packings.
ACM Trans. Algorithms
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese
2021 A conf
FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees.
ESA
Tomás Martínez-Muñoz, Andreas Wiese
2021 A conf
Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back.
ESA
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese
2021 — conf
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
FSTTCS
Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese
2021 A* conf
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More.
SoCG
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
2021 J jnl
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More.
CoRR
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
2021 A* conf
On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem.
SoCG
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
2021 J jnl
On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem.
CoRR
Arindam Khan, Arnab Maiti, Amatya Sharma, Andreas Wiese
2021 J jnl
On fully dynamic constant-factor approximation algorithms for clustering problems.
CoRR
Hendrik Fichtenberger, Monika Henzinger, Andreas Wiese
2020 J jnl
A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine.
CoRR
Lars Rohwedder, Andreas Wiese
2020 J jnl
Additive Approximation Schemes for Load Balancing Problems.
CoRR
Moritz Buchem, Lars Rohwedder, Tjark Vredeveld, Andreas Wiese
2020 A conf
Better Approximations for General Caching and UFP-Cover Under Resource Augmentation.
STACS
Andrés Cristi, Andreas Wiese
2020 J jnl
Breaking symmetries to rescue sum of squares in the case of makespan scheduling.
Math. Program.
Victor Verdugo, José Verschae, Andreas Wiese
2020 A* conf
Breaking the Barrier of 2 for the Storage Allocation Problem.
ICALP
Tobias Mömke, Andreas Wiese
2020 A* conf
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.
SoCG
Monika Henzinger, Stefan Neumann, Andreas Wiese
2020 J jnl
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles.
CoRR
Monika Henzinger, Stefan Neumann, Andreas Wiese
2020 J jnl
Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity.
CoRR
Monika Henzinger, Stefan Neumann, Andreas Wiese
2020 A conf
Fixed-Parameter Algorithms for Unsplittable Flow Cover.
STACS
Andrés Cristi, Mathieu Mari, Andreas Wiese
2020 J jnl
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time.
CoRR
Martin Böhm, Franziska Eberle, Nicole Megow, Lukas Nölke, Jens Schlöter, Bertrand Simon, Andreas Wiese
2020 A* conf
On the Two-Dimensional Knapsack Problem for Convex Polygons.
ICALP
Arturo Merino, Andreas Wiese
2020 J jnl
On the Two-Dimensional Knapsack Problem for Convex Polygons.
CoRR
Arturo Merino, Andreas Wiese
2020 J jnl
On the extension complexity of scheduling polytopes.
Oper. Res. Lett.
Hans Raj Tiwary, Victor Verdugo, Andreas Wiese
2020 J jnl
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.
Algorithmica
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2019 J jnl
A Generalized Parallel Task Model for Recurrent Real-Time Processes.
ACM Trans. Parallel Comput.
Vincenzo Bonifaci, Andreas Wiese, Sanjoy K. Baruah, Alberto Marchetti-Spaccamela, Sebastian Stiller, Leen Stougie
2019 J jnl
Approximation Schemes for Independent Set and Sparse Subsets of Polygons.
J. ACM
Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
2019 J jnl
Breaking the Barrier of 2 for the Storage Allocation Problem.
CoRR
Tobias Mömke, Andreas Wiese
2019 J jnl
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem.
ACM Trans. Algorithms
Sandy Heydrich, Andreas Wiese
2019 J jnl
On the extension complexity of scheduling.
CoRR
Hans Raj Tiwary, Victor Verdugo, Andreas Wiese
2019 A conf
Packing Cars into Narrow Roads: PTASs for Limited Supply Highway.
ESA
Fabrizio Grandoni, Andreas Wiese
2019 A conf
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack.
ESA
Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese
2019 J jnl
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack.
CoRR
Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese
2018 A* conf
A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes.
STOC
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
2018 J jnl
A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path.
ACM Trans. Algorithms
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
2018 — conf
Fixed-Parameter Approximation Schemes for Weighted Flowtime.
APPROX-RANDOM
Andreas Wiese
2018 J jnl
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions.
Algorithmica
Wiebke Höhn, Julián Mestre, Andreas Wiese
2018 J jnl
Independent Set of Convex Polygons: From $$n^{\epsilon }$$ n ϵ to $$1+\epsilon $$ 1 + ϵ via Shrinking.
Algorithmica
Andreas Wiese
2018 A conf
Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs.
ESA
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2018 J jnl
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs.
CoRR
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2018 J jnl
Semidefinite and linear programming integrality gaps for scheduling identical machines.
Math. Program.
Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
2018 J jnl
Submodular unsplittable flow on trees.
Math. Program.
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
2017 A* conf
A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time.
ICALP
Andreas Wiese
2017 A* conf
A QPTAS for the General Scheduling Problem with Identical Release Dates.
ICALP
Antonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae, Andreas Wiese
2017 A* conf
Approximating Geometric Knapsack via L-Packings.
FOCS
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
2017 J jnl
Approximating Geometric Knapsack via L-packings.
CoRR
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
2017 J jnl
Approximation Schemes for Independent Set and Sparse Subsets of Polygons.
CoRR
Anna Adamaszek, Sariel Har-Peled, Andreas Wiese
2017 B conf
Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking.
MFCS
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2017 A* conf
Faster approximation schemes for the two-dimensional knapsack problem.
SODA
Sandy Heydrich, Andreas Wiese
2017 A conf
On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine.
ESA
Syamantak Das, Andreas Wiese
2017 A* conf
To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack.
SODA
Fabrizio Grandoni, Tobias Mömke, Andreas Wiese, Hang Zhou
2016 J jnl
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio.
ACM Trans. Algorithms
Elisabeth Lübbecke, Olaf Maurer, Nicole Megow, Andreas Wiese
2016 J jnl
Approximation and parameterized algorithms for geometric independent set with shrinking.
CoRR
Michal Pilipczuk, Erik Jan van Leeuwen, Andreas Wiese
2016 J jnl
Identification of key player genes in gene regulatory networks.
BMC Syst. Biol.
Maryam Nazarieh, Andreas Wiese, Thorsten Will, Mohamed Hamed, Volkhard Helms
2016 B conf
Independent Set of Convex Polygons: From n
LATIN
Andreas Wiese
2016 A* conf
On approximating strip packing with a better ratio than 3/2.
SODA
Giorgi Nadiradze, Andreas Wiese
2016 B conf
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines.
IPCO
Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese
2016 B conf
Submodular Unsplittable Flow on Trees.
IPCO
Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese
2016 J jnl
The Power of Recourse for Online MST and TSP.
SIAM J. Comput.
Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese
2016 Misc conf
This House Proves That Debating is Harder Than Soccer.
FUN
Stefan Neumann, Andreas Wiese
2016 J jnl
This House Proves that Debating is Harder than Soccer.
CoRR
Stefan Neumann, Andreas Wiese
2015 — conf
A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem.
ICALP (1)
Tobias Mömke, Andreas Wiese
2015 A* conf
A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem.
SODA
Anna Adamaszek, Andreas Wiese
2015 J jnl
Assigning sporadic tasks to unrelated machines.
Math. Program.
Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese
2015 — conf
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking.
APPROX-RANDOM
Anna Adamaszek, Parinya Chalermsook, Andreas Wiese
2015 A* conf
New Approximation Schemes for Unsplittable Flow on a Path.
SODA
Jatin Batra, Naveen Garg, Amit Kumar, Tobias Mömke, Andreas Wiese
2015 — conf
On Guillotine Cutting Sequences.
APPROX-RANDOM
Fidaa Abed, Parinya Chalermsook, José Correa, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, Andreas Wiese
2015 J jnl
Scheduling and fixed-parameter tractability.
Math. Program.
Matthias Mnich, Andreas Wiese
2015 J jnl
Scheduling with an Orthogonal Resource Constraint.
Algorithmica
Martin Niemeier, Andreas Wiese
2014 J jnl
A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths.
SIAM J. Comput.
Paul S. Bonsma, Jens Schulz, Andreas Wiese
2014 A* conf
A Mazing 2+
SODA
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
2014 A* conf
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices.
SODA
Anna Adamaszek, Andreas Wiese
2014 — conf
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions.
ICALP (1)
Wiebke Höhn, Julián Mestre, Andreas Wiese
2014 J jnl
How Unsplittable-Flow-Covering helps Scheduling with Job-Dependent Cost Functions.
CoRR
Wiebke Höhn, Julián Mestre, Andreas Wiese
2014 J jnl
On the configuration-LP for scheduling on unrelated machines.
J. Sched.
José Verschae, Andreas Wiese
2014 B conf
Scheduling and Fixed-Parameter Tractability.
IPCO
Matthias Mnich, Andreas Wiese
2013 A* conf
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio.
SODA
Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese
2013 J jnl
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices.
CoRR
Anna Adamaszek, Andreas Wiese
2013 B conf
Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines.
IPCO
Maxim Sviridenko, Andreas Wiese
2013 A* conf
Approximation Schemes for Maximum Weight Independent Set of Rectangles.
FOCS
Anna Adamaszek, Andreas Wiese
2013 J jnl
Approximation Schemes for Maximum Weight Independent Set of Rectangles.
CoRR
Anna Adamaszek, Andreas Wiese
2013 J jnl
Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model
CoRR
Nicole Megow, Andreas Wiese
2013 B conf
Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path.
IPCO
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
2013 B conf
Feasibility Analysis in the Sporadic DAG Task Model.
ECRTS
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller, Andreas Wiese
2013 J jnl
Partitioned EDF scheduling on a few types of unrelated multiprocessors.
Real Time Syst.
Andreas Wiese, Vincenzo Bonifaci, Sanjoy K. Baruah
2013 A conf
Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks.
RTSS
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Nicole Megow, Andreas Wiese
2013 J jnl
Scheduling Meets Fixed-Parameter Tractability.
CoRR
Matthias Mnich, Andreas Wiese
2012 A conf
A Generalized Parallel Task Model for Recurrent Real-time Processes.
RTSS
Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Leen Stougie, Andreas Wiese
2012 J jnl
A Mazing 2+eps Approximation for Unsplittable Flow on a Path
CoRR
Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
2012 J jnl
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
CoRR
Elisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese
2012 — conf
Assigning Sporadic Tasks to Unrelated Parallel Machines.
ICALP (1)
Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese
2012 J jnl
Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model
CoRR
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller, Andreas Wiese
2012 J jnl
Scheduling Unrelated Machines of Few Different Types
CoRR
Vincenzo Bonifaci, Andreas Wiese
2012 B conf
Scheduling with an Orthogonal Resource Constraint.
WAOA
Martin Niemeier, Andreas Wiese
2012 — conf
The Power of Recourse for Online MST and TSP.
ICALP (1)
Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese
2011 J jnl
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
CoRR
Paul S. Bonsma, Jens Schulz, Andreas Wiese
2011 A* conf
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths.
FOCS
Paul S. Bonsma, Jens Schulz, Andreas Wiese
2011 J jnl
Analysing local algorithms in location-aware quasi-unit-disk graphs.
Discret. Appl. Math.
Marja Hassinen, Joel Kaasinen, Evangelos Kranakis, Valentin Polishchuk, Jukka Suomela, Andreas Wiese
2011 J jnl
Local algorithms for edge colorings in UDGs.
Theor. Comput. Sci.
Iyad A. Kanj, Andreas Wiese, Fenghui Zhang
2011 A conf
On the Configuration-LP for Scheduling on Unrelated Machines.
ESA
José Verschae, Andreas Wiese
2011 — —
Packet routing and scheduling.
Andreas Wiese
2011 B conf
Partitioned Real-time Scheduling on Heterogeneous Shared-Memory Multiprocessors.
ECRTS
Martin Niemeier, Andreas Wiese, Sanjoy K. Baruah
2011 J jnl
Real-time Avionics Optimization.
it Inf. Technol.
Friedrich Eisenbrand, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese
2011 B conf
Universal Packet Routing with Arbitrary Bandwidths and Transit Times.
IPCO
Britta Peis, Andreas Wiese
2010 — conf
Increasing Speed Scheduling and Flow Scheduling.
ISAAC (2)
Sebastian Stiller, Andreas Wiese
2010 J jnl
On the Configuration-LP for Scheduling on Unrelated Machines
CoRR
José Verschae, Andreas Wiese
2010 B conf
Packet Routing on the Grid.
LATIN
Britta Peis, Martin Skutella, Andreas Wiese
2010 — conf
Policies for Periodic Packet Routing.
ISAAC (2)
Britta Peis, Sebastian Stiller, Andreas Wiese
2010 — conf
Scheduling Periodic Tasks in a Hard Real-Time Environment.
ICALP (1)
Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese
2010 — conf
Scheduling periodic tasks in a hard real-time environment.
Scheduling
Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese
2010 — conf
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods.
ESA (1)
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, Andreas Wiese
2010 B conf
Throughput Maximization for Periodic Packet Routing on Trees and Grids.
WAOA
Britta Peis, Andreas Wiese
2009 B conf
Local Algorithms for Edge Colorings in UDGs.
WG
Iyad A. Kanj, Andreas Wiese, Fenghui Zhang
2009 J jnl
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs.
Discret. Math. Algorithms Appl.
Andreas Wiese, Evangelos Kranakis
2009 J jnl
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs?
Ad Hoc Sens. Wirel. Networks
Andreas Wiese, Evangelos Kranakis
2009 J jnl
Optimal movement of mobile sensors for barrier coverage of a planar region.
Theor. Comput. Sci.
Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese
2009 B conf
Packet Routing: Complexity and Algorithms.
WAOA
Britta Peis, Martin Skutella, Andreas Wiese
2009 — conf
Real-Time Message Routing and Scheduling.
APPROX-RANDOM
Ronald Koch, Britta Peis, Martin Skutella, Andreas Wiese
2008 B conf
Communication in wireless networks with directional antennas.
SPAA
Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, Danny Krizanc, Andreas Wiese
2008 J jnl
Impact of Locality on Location Aware Unit Disk Graphs.
Algorithms
Andreas Wiese, Evangelos Kranakis
2008 B conf
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs.
WG
Andreas Wiese, Evangelos Kranakis
2008 — conf
Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs.
ADHOC-NOW
Andreas Wiese, Evangelos Kranakis
2008 B conf
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs.
WAOA
Andreas Wiese, Evangelos Kranakis
2008 B conf
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs.
DCOSS
Andreas Wiese, Evangelos Kranakis
2008 C conf
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region.
COCOA
Binay K. Bhattacharya, Mike Burmester, Yuzhuang Hu, Evangelos Kranakis, Qiaosheng Shi, Andreas Wiese