Andreas Wiese

发表

Assigning Sporadic Tasks to Unrelated Parallel Machines

Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, 2012, ICALP.

New Approximation Schemes for Unsplittable Flow on a Path

Amit Kumar, Andreas Wiese, Tobias Mömke, 2015, SODA.

Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs

Evangelos Kranakis, Andreas Wiese, 2008, ADHOC-NOW.

Semidefinite and linear programming integrality gaps for scheduling identical machines

Claire Mathieu, Andreas Wiese, Tobias Mömke, 2018, Math. Program..

Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs

Evangelos Kranakis, Andreas Wiese, 2009, Discret. Math. Algorithms Appl..

Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity pdf

Andreas Wiese, Monika Henzinger, Stefan Neumann, 2020, ArXiv.

Universal Packet Routing with Arbitrary Bandwidths and Transit Times

Andreas Wiese, Britta Peis, Andreas Wiese, 2011, IPCO.

On approximating strip packing with a better ratio than 3/2

Giorgi Nadiradze, Andreas Wiese, 2016, SODA.

A New Approach to Competitive Analysis: Approximating the Optimal Competitive Ratio

Nicole Megow, Andreas Wiese, Elisabeth Günther, 2012 .

Analysing local algorithms in location-aware quasi-unit-disk graphs

Evangelos Kranakis, Valentin Polishchuk, Andreas Wiese, 2011, Discret. Appl. Math..

The Power of Recourse for Online MST and TSP

Martin Skutella, Nicole Megow, José Verschae, 2012, SIAM J. Comput..

On Guillotine Cutting Sequences

José R. Correa, Pablo Pérez-Lantero, Andreas Wiese, 2015, APPROX-RANDOM.

On the Configuration-LP for Scheduling on Unrelated Machines

José Verschae, Andreas Wiese, 2011, ESA.

Partitioned EDF scheduling on a few types of unrelated multiprocessors

Sanjoy K. Baruah, Vincenzo Bonifaci, Andreas Wiese, 2012, Real-Time Systems.

Approximation Schemes for Maximum Weight Independent Set of Rectangles

Andreas Wiese, Anna Adamaszek, Andreas Wiese, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Potentials and Costs of Renewable Sources of Energy in the Federal Republic of Germany

Andreas Wiese, Martin Kaltschmitt, 1994 .

Constant Integrality Gap LP Formulations of Unsplittable Flow on a Path

Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese, 2013, IPCO.

Scheduling Periodic Tasks in a Hard Real-Time Environment

Martin Skutella, Friedrich Eisenbrand, José Verschae, 2010, ICALP.

A Mazing 2+ε Approximation for Unsplittable Flow on a Path

Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese, 2018, ACM Trans. Algorithms.

A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices pdf

Andreas Wiese, Anna Adamaszek, Andreas Wiese, 2013, SODA.

This House Proves that Debating is Harder than Soccer

Andreas Wiese, Stefan Neumann, 2016, FUN.

A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time

Andreas Wiese, 2017, ICALP.

Breaking symmetries to rescue sum of squares in the case of makespan scheduling

José Verschae, Andreas Wiese, Victor Verdugo, 2020, Math. Program..

A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio

Nicole Megow, Andreas Wiese, Elisabeth Günther, 2012, SODA.

Packing Cars into Narrow Roads: PTASs for Limited Supply Highway

Fabrizio Grandoni, Andreas Wiese, 2019, ESA.

Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs?

Evangelos Kranakis, Andreas Wiese, 2008, Ad Hoc Sens. Wirel. Networks.

Global Link of renewable energy sources : Technical, economical, and environmental aspects of an intercontinental electricity transmission and distribution system

Andreas Wiese, Martin Kaltschmitt, 1996 .

A (2+ε)-approximation algorithm for preemptive weighted flow time on a single machine pdf

Lars Rohwedder, Andreas Wiese, 2020, ArXiv.

Packet routing and scheduling

Andreas Wiese, 2011 .

Faster Approximation Schemes for the Two-Dimensional Knapsack Problem

Andreas Wiese, Sandy Heydrich, 2019, ACM Trans. Algorithms.

A (2+\epsilon ) ( 2 + ϵ ) -Approximation Algorithm for the Storage Allocation Problem

Andreas Wiese, Tobias Mömke, Andreas Wiese, 2015, ICALP.

A New Approach to Online Scheduling

Nicole Megow, Andreas Wiese, Olaf Maurer, 2012, ACM Transactions on Algorithms.

Feasibility Analysis in the Sporadic DAG Task Model

Sebastian Stiller, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, 2013, 2013 25th Euromicro Conference on Real-Time Systems.

Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines

Maxim Sviridenko, Andreas Wiese, 2013, IPCO.

How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions

Julián Mestre, Andreas Wiese, Wiebke Höhn, 2017, Algorithmica.

Better Approximations for General Caching and UFP-Cover Under Resource Augmentation

Andrés Cristi, Andreas Wiese, Andreas Wiese, 2020, STACS.

On the extension complexity of scheduling pdf

Hans Raj Tiwary, Andreas Wiese, Victor Verdugo, 2019, ArXiv.

How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions

Julián Mestre, Andreas Wiese, Wiebke Höhn, 2014, ICALP.

Partitioned Real-time Scheduling on Heterogeneous Shared-Memory Multiprocessors

Sanjoy K. Baruah, Andreas Wiese, Martin Niemeier, 2011, 2011 23rd Euromicro Conference on Real-Time Systems.

To Augment or Not to Augment: Solving Unsplittable Flow on a Path by Creating Slack

Fabrizio Grandoni, Andreas Wiese, Tobias Mömke, 2017, SODA.

Fixed-Parameter Algorithms for Unsplittable Flow Cover

Andrés Cristi, Andreas Wiese, Mathieu Mari, 2020, STACS.

Independent Set of Convex Polygons: From $$n^{\epsilon }$$nϵ to $$1+\epsilon $$1+ϵ via Shrinking

Andreas Wiese, 2017, Algorithmica.

A Mazing 2+∊ Approximation for Unsplittable Flow on a Path

Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese, 2014, SODA.

How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking

Andreas Wiese, Parinya Chalermsook, Anna Adamaszek, 2015, APPROX-RANDOM.

Policies for Periodic Packet Routing

Sebastian Stiller, Andreas Wiese, Britta Peis, 2010, ISAAC.

Approximation Schemes for Independent Set and Sparse Subsets of Polygons

Sariel Har-Peled, Andreas Wiese, Anna Adamaszek, 2017, J. ACM.

Competitive-Ratio Approximation Schemes for Minimizing the Makespan in the Online-List Model pdf

Nicole Megow, Andreas Wiese, Andreas Wiese, 2013, ArXiv.

Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking pdf

Erik Jan van Leeuwen, Michal Pilipczuk, Andreas Wiese, 2016, MFCS.

On the configuration-LP for scheduling on unrelated machines

José Verschae, Andreas Wiese, 2014, J. Sched..

Scheduling and fixed-parameter tractability

Matthias Mnich, Andreas Wiese, 2015, Math. Program..

Scheduling and fixed-parameter tractability

Matthias Mnich, Andreas Wiese, Andreas Wiese, 2014, Mathematical Programming.

Scheduling with an Orthogonal Resource Constraint

Andreas Wiese, Martin Niemeier, Andreas Wiese, 2012, Algorithmica.

Increasing Speed Scheduling and Flow Scheduling

Sebastian Stiller, Andreas Wiese, 2010, ISAAC.

Identification of key player genes in gene regulatory networks

Volkhard Helms, Mohamed Hamed, Andreas Wiese, 2016, BMC Systems Biology.

Real-Time Message Routing and Scheduling

Ronald Koch, Martin Skutella, Andreas Wiese, 2009, APPROX-RANDOM.

Submodular unsplittable flow on trees

Andreas Wiese, Parinya Chalermsook, Anna Adamaszek, 2016, IPCO.

Impact of Locality on Location Aware Unit Disk Graphs

Evangelos Kranakis, Andreas Wiese, E. Kranakis, 2008, Algorithms.

Local Algorithms for Edge Colorings in UDGs

Fenghui Zhang, Andreas Wiese, Iyad A. Kanj, 2009, WG.

Real-time Avionics Optimization

Martin Skutella, Friedrich Eisenbrand, José Verschae, 2011, it Inf. Technol..

Breaking the Barrier of 2 for the Storage Allocation Problem

Andreas Wiese, Tobias Mömke, Andreas Wiese, 2019, ICALP.

Packet Routing: Complexity and Algorithms

Martin Skutella, Andreas Wiese, Britta Peis, 2009, WAOA.

Throughput Maximization for Periodic Packet Routing on Trees and Grids

Andreas Wiese, Britta Peis, Andreas Wiese, 2010, WAOA.

Approximating Geometric Knapsack via L-Packings

Fabrizio Grandoni, Andreas Wiese, Arindam Khan, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles

Andreas Wiese, Monika Henzinger, Stefan Neumann, 2020, SoCG.

Additive Approximation Schemes for Load Balancing Problems pdf

Lars Rohwedder, Andreas Wiese, Tjark Vredeveld, 2020, ICALP.

Potential of renewable energy in Poland

Andreas Wiese, Thomas Kraneis, Tobias Leschinsky, 2006 .

Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack

Fabrizio Grandoni, Stefan Kratsch, Andreas Wiese, 2019, ESA.

On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine

Andreas Wiese, Syamantak Das, Andreas Wiese, 2017, ESA.

A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem

Andreas Wiese, Anna Adamaszek, Andreas Wiese, 2015, SODA.

Independent Set of Convex Polygons: From nϵ to 1+ϵ via Shrinking

Andreas Wiese, 2016, LATIN.

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time pdf

Nicole Megow, Lukas Nolke, Bertrand Simon, 2020, ArXiv.

Assigning sporadic tasks to unrelated machines

Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, 2015, Math. Program..

Vincenzo Bonifaci, Andreas Wiese, Andreas Wiese, 2012, ArXiv.

Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods

Martin Skutella, Friedrich Eisenbrand, Raju S. Mattikalli, 2010, ESA.

On the Two-Dimensional Knapsack Problem for Convex Polygons

Andreas Wiese, Arturo I. Merino, Andreas Wiese, 2020, ICALP.

Optimal movement of mobile sensors for barrier coverage of a planar region

Mike Burmester, Evangelos Kranakis, Andreas Wiese, 2009, Theor. Comput. Sci..

A Generalized Parallel Task Model for Recurrent Real-time Processes

Sanjoy K. Baruah, Leen Stougie, Sebastian Stiller, 2012, 2012 IEEE 33rd Real-Time Systems Symposium.

Local algorithms for edge colorings in UDGs

Fenghui Zhang, Andreas Wiese, Iyad A. Kanj, 2011, Theor. Comput. Sci..

Scheduling Meets Fixed-Parameter Tractability pdf

Matthias Mnich, Andreas Wiese, Andreas Wiese, 2013, ArXiv.

Semidefinite and linear programming integrality gaps for scheduling identical machines

Claire Mathieu, Andreas Wiese, Tobias Mömke, 2016, IPCO.

Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs pdf

Erik Jan van Leeuwen, Michal Pilipczuk, Andreas Wiese, 2018, ESA.

The Power of Recourse for Online MST and TSP

Martin Skutella, Nicole Megow, José Verschae, 2012, ICALP.

A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths

Paul S. Bonsma, Andreas Wiese, Jens Schulz, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region

Mike Burmester, Evangelos Kranakis, Andreas Wiese, 2008, COCOA.

Renewable Energy: technology, economics and environment

Andreas Wiese, Martin Kaltschmitt, Wolfgang Streicher, 2008 .

A Generalized Parallel Task Model for Recurrent Real-time Processes

Sanjoy K. Baruah, Leen Stougie, Vincenzo Bonifaci, 2012, 2012 IEEE 33rd Real-Time Systems Symposium.

Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs

Andreas Wiese, Michał Pilipczuk, Erik Jan van Leeuwen, 2020, Algorithmica.

Electricity generation from renewable energy sources in Germany — Potentials, costs and implementation strategies

Andreas Wiese, 1994 .

A (5/3 + ε)-approximation for unsplittable flow on a path: placing small tasks into boxes

Fabrizio Grandoni, Andreas Wiese, Tobias Mömke, 2018, STOC.

Submodular unsplittable flow on trees

Andreas Wiese, Parinya Chalermsook, Anna Adamaszek, 2018, Math. Program..

Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks

Nicole Megow, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, 2013, 2013 IEEE 34th Real-Time Systems Symposium.

A Mazing 2+eps Approximation for Unsplittable Flow on a Path pdf

Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese, 2012, ArXiv.

Fixed-Parameter Approximation Schemes for Weighted Flowtime

Andreas Wiese, 2018, APPROX-RANDOM.

Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs

Evangelos Kranakis, Andreas Wiese, 2008, WG.

Faster approximation schemes for the two-dimensional knapsack problem

Andreas Wiese, Sandy Heydrich, 2017, SODA.

Packet Routing on the Grid

Martin Skutella, Andreas Wiese, Britta Peis, 2010, LATIN.

Communication in wireless networks with directional antennas

Ioannis Caragiannis, Christos Kaklamanis, Evangelos Kranakis, 2008, SPAA '08.

Feasibility Tests for Recurrent Real-Time Tasks in the Sporadic DAG Model pdf

Sebastian Stiller, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, 2012, ArXiv.

A QPTAS for the General Scheduling Problem with Identical Release Dates

Ruben Hoeksma, José Verschae, Antonios Antoniadis, 2017, ICALP.

On the extension complexity of scheduling polytopes

Hans Raj Tiwary, Andreas Wiese, Victor Verdugo, 2020, Oper. Res. Lett..

Scheduling with an Orthogonal Resource Constraint

Andreas Wiese, Martin Niemeier, 2012, WAOA.

A $(2+\varepsilon)$-approximation algorithm for preemptive weighted flow time on a single machine

Lars Rohwedder, Andreas Wiese, 2020 .

A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths

Paul S. Bonsma, Andreas Wiese, Jens Schulz, 2011, FOCS.

Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs

Evangelos Kranakis, Andreas Wiese, E. Kranakis, 2009, WAOA.

Technical Potentials of Renewable Energies at the Example of a Bundesland in the Federal Republic of Germany

Andreas Wiese, Martin Kaltschmitt, 1992 .

A 4-Approximation Algorithm for Maximum Independent Set of Rectangles pdf

Andreas Wiese, Tobias Mömke, Waldo Gálvez, 2022, SODA.

Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More

Fabrizio Grandoni, Andreas Wiese, Arindam Khan, 2021, SoCG.

Fixed-Parameter Algorithms for Unsplittable Flow Cover

Andrés Cristi, Andreas Wiese, Mathieu Mari, 2021, Theory of Computing Systems.

FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees

Andreas Wiese, Tomás Martínez-Muñoz, 2021, ESA.

On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem pdf

Andreas Wiese, Arnab Maiti, Arindam Khan, 2021, SoCG.

On fully dynamic constant-factor approximation algorithms for clustering problems pdf

Monika Henzinger, Andreas Wiese, Hendrik Fichtenberger, 2021, ArXiv.

A (2+\epsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles

Andreas Wiese, Mathieu Mari, Tobias Momke, 2021 .

Approximating Geometric Knapsack via L-packings

Fabrizio Grandoni, Andreas Wiese, Waldo Gálvez, 2021, ACM Trans. Algorithms.

A PTAS for the horizontal rectangle stabbing problem pdf

Andreas Wiese, Arindam Khan, Aditya Subramanian, 2021, ArXiv.

Computing the k-hop neighborhoods in wireless networks locally

Fenghui Zhang, Andreas Wiese, Iyad A. Kanj, 2008 .