Susanne Albers

G. Wessel van der Heijden

CoRR, 2024

2023

Algorithms for Right-sizing Heterogeneous Data Centers.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., December, 2023

Machine Covering in the Random-Order Model.

[BibT_eX]

[DOI]

Waldo Gálvez

Algorithmica, June, 2023

2022

Optimal Algorithms for Right-sizing Data Centers.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., December, 2022

EATCS Distinguished Dissertation Award 2022 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2022

Online Ad Allocation in Bounded-Degree Graphs.

[BibT_eX]

[DOI]

Sebastian Schubert

Proceedings of the Web and Internet Economics - 18th International Conference, 2022

Tight Bounds for Online Matching in Bounded-Degree Graphs with Vertex Capacities.

[BibT_eX]

[DOI]

Sebastian Schubert

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Energy-Efficient Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021

On the Value of Penalties in Time-Inconsistent Planning.

[BibT_eX]

[DOI]

Dennis Kraft

ACM Trans. Economics and Comput., 2021

Algorithms for energy conservation in heterogeneous data centers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

New results for the <i>k</i>-secretary problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Tight Bounds for Online Coloring of Basic Graph Classes.

[BibT_eX]

[DOI]

Sebastian Schraink

Algorithmica, 2021

Best Fit Bin Packing with Random Order Revisited.

[BibT_eX]

[DOI]

Arindam Khan

Algorithmica, 2021

Improved Online Algorithms for Knapsack and GAP in the Random Order Model.

[BibT_eX]

[DOI]

Arindam Khan

Algorithmica, 2021

Scheduling in the Random-Order Model.

[BibT_eX]

[DOI]

Algorithmica, 2021

Online Makespan Minimization with Budgeted Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Scheduling with Testing on Multiple Identical Parallel Machines.

[BibT_eX]

[DOI]

Alexander Eckl

Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Scheduling in the Secretary Model.

[BibT_eX]

[DOI]

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Optimal Algorithms for Online b-Matching with Variable Vertex Capacities.

[BibT_eX]

[DOI]

Sebastian Schubert

Proceedings of the Approximation, 2021

2020

EATCS Distinguished Dissertation Award 2020 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

Explorable Uncertainty in Scheduling with Non-uniform Testing Times.

[BibT_eX]

[DOI]

Alexander Eckl

Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020

New Bounds for Randomized List Update in the Paid Exchange Model.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

2019

On Energy Conservation in Data Centers.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2019

Motivating Time-Inconsistent Agents: A Computational Approach.

[BibT_eX]

[DOI]

Dennis Kraft

Theory Comput. Syst., 2019

EATCS Distinguished Dissertation Award 2019 - Call for Nominations.

[BibT_eX]

[DOI]

Bull. EATCS, 2019

Minimization of Weighted Completion Times in Path-based Coflow Scheduling.

[BibT_eX]

[DOI]

CoRR, 2019

New Online Algorithms for Story Scheduling in Web Advertising.

[BibT_eX]

[DOI]

Achim Passen

Algorithmica, 2019

New Results for the k-Secretary Problem.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018

Optimal Algorithms for Right-Sizing Data Centers - Extended Version.

[BibT_eX]

[DOI]

CoRR, 2018

Quantifying Competitiveness in Paging with Locality of Reference.

[BibT_eX]

[DOI]

Dario Frascaria

Algorithmica, 2018

2017

Algorithmic Economics und Operations Research.

[BibT_eX]

[DOI]

Inform. Spektrum, 2017

Scheduling on power-heterogeneous processors.

[BibT_eX]

[DOI]

Inf. Comput., 2017

On the Value of Job Migration in Online Makespan Minimization.

[BibT_eX]

[DOI]

Matthias Hellwig

Algorithmica, 2017

Online Makespan Minimization with Parallel Schedules.

[BibT_eX]

[DOI]

Matthias Hellwig

Algorithmica, 2017

The Price of Uncertainty in Present-Biased Planning.

[BibT_eX]

[DOI]

Dennis Kraft

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Algorithmic Economics und Operations Research.

[BibT_eX]

[DOI]

Proceedings of the 50 Jahre Universitäts-Informatik in München, 2017

2016

On list update with locality of reference.

[BibT_eX]

[DOI]

Sonja Lauer

J. Comput. Syst. Sci., 2016

2015

On multi-processor speed scaling with migration.

[BibT_eX]

[DOI]

Antonios Antoniadis

Gero Greiner

J. Comput. Syst. Sci., 2015

Modeling Real-World Data Sets (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

On Nash Equilibria for a Network Creation Game.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2014

Race to idle: New algorithms for speed scaling with a sleep state.

[BibT_eX]

[DOI]

Antonios Antoniadis

ACM Trans. Algorithms, 2014

Speed Scaling on Parallel Processors.

[BibT_eX]

[DOI]

Fabian Müller

Swen Schmelzer

Algorithmica, 2014

2013

On Approximate Nash Equilibria in Network Design.

[BibT_eX]

[DOI]

Pascal Lenzner

Internet Math., 2013

Scheduling (Dagstuhl Seminar 13111).

[BibT_eX]

[DOI]

Onno J. Boxma

Kirk Pruhs

Dagstuhl Reports, 2013

Recent Advances for a Classical Scheduling Problem.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Recent Results for Online Makespan Minimization.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

2012

Semi-online scheduling revisited.

[BibT_eX]

[DOI]

Matthias Hellwig

Theor. Comput. Sci., 2012

2011

Preface.

[BibT_eX]

[DOI]

Alberto Marchetti-Spaccamela

Theor. Comput. Sci., 2011

Preface: Special Issue on Theoretical Aspects of Computer Science (STACS).

[BibT_eX]

[DOI]

Jean-Yves Marion

Theory Comput. Syst., 2011

Algorithms for Dynamic Speed Scaling.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

On multi-processor speed scaling with migration: extended abstract.

[BibT_eX]

[DOI]

Antonios Antoniadis

Gero Greiner

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Energy-Efficient Algorithms (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Online Algorithms - What Is It Worth to Know the Future?

[BibT_eX]

[DOI]

Swen Schmelzer

Proceedings of the Algorithms Unplugged, 2011

2010

Editorial note.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

STACS 2008 Foreword.

[BibT_eX]

[DOI]

Pascal Weil

Theory Comput. Syst., 2010

Onlinealgorithmen - Was ist es wert, die Zukunft zu kennen?

[BibT_eX]

[DOI]

Inform. Spektrum, 2010

Energy-efficient algorithms.

[BibT_eX]

[DOI]

Commun. ACM, 2010

An Experimental Study of New and Known Online Packet Buffering Algorithms.

[BibT_eX]

[DOI]

Tobias Jacobs

Algorithmica, 2010

New Results on Web Caching with Request Reordering.

[BibT_eX]

[DOI]

Algorithmica, 2010

10071 Executive Summary - Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

10071 Abstracts Collection - Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

Algorithms for Energy Management.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2010

2009

On the Value of Coordination in Network Design.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Preface - 26th International Symposium on Theoretical Aspects of Computer Science.

[BibT_eX]

[DOI]

Jean-Yves Marion

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Resource Management in Large Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Algorithms for Energy Saving.

[BibT_eX]

[DOI]

Proceedings of the Efficient Algorithms, 2009

Online Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Introduction to Scheduling., 2009

2008

Online-Algorithmen: Was ist es wert, die Zukunft zu kennen?.

[BibT_eX]

[DOI]

Swen Schmelzer

Proceedings of the Taschenbuch der Algorithmen, 2008

Online List Update.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science.

[BibT_eX]

[DOI]

Pascal Weil

Proceedings of the STACS 2008, 2008

Preface - 25th International Symposium on Theoretical Aspects of Computer Science.

[BibT_eX]

[DOI]

Pascal Weil

Proceedings of the STACS 2008, 2008

2007

Online Computation in Large Networks.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Energy-efficient algorithms for flow time minimization.

[BibT_eX]

[DOI]

Hiroshi Fujiwara

ACM Trans. Algorithms, 2007

A Study of Integrated Document and Connection Caching in the WWW.

[BibT_eX]

[DOI]

Rob van Stee

Algorithmica, 2007

2006

Foreword.

[BibT_eX]

[DOI]

Tomasz Radzik

Algorithmica, 2006

2005

Dynamic TCP Acknowledgment: Penalizing Long Delays.

[BibT_eX]

[DOI]

Helge Bals

SIAM J. Discret. Math., 2005

On the Performance of Greedy Algorithms in Packet Buffering.

[BibT_eX]

[DOI]

Markus Schmidt

SIAM J. Comput., 2005

On paging with locality of reference.

[BibT_eX]

[DOI]

Lene M. Favrholdt

Oliver Giel

J. Comput. Syst. Sci., 2005

Integrated prefetching and caching in single and parallel disk systems.

[BibT_eX]

[DOI]

Markus Büttner

Inf. Comput., 2005

05031 Summary-- Algorithms for Optimization with Incomplete Information.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004

04091 Abstracts Collection - Data Structures.

[BibT_eX]

[DOI]

Robert Sedgewick

Dorothea Wagner

Proceedings of the Data Structures, 22.-27. February 2004, 2004

2003

Online algorithms: a survey.

[BibT_eX]

[DOI]

Math. Program., 2003

Integrated Prefetching and Caching with Read and Write Requests.

[BibT_eX]

[DOI]

Markus Büttner

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Dynamic TCP acknowledgement: penalizing long delays.

[BibT_eX]

[DOI]

Helge Bals

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

A Study of Integrated Document and Connection Caching.

[BibT_eX]

[DOI]

Rob van Stee

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

On Generalized Connection Caching.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2002

An Experimental Study of Online Scheduling Algorithms.

[BibT_eX]

[DOI]

Bianca Schröder

ACM J. Exp. Algorithmics, 2002

Randomized splay trees: Theoretical and experimental results.

[BibT_eX]

[DOI]

Marek Karpinski

Inf. Process. Lett., 2002

Exploring Unknown Environments with Obstacles.

[BibT_eX]

[DOI]

Klaus Kursawe

Sven Schuierer

Algorithmica, 2002

On randomized online scheduling.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001

Delayed Information and Action in On-Line Algorithms.

[BibT_eX]

[DOI]

Moses Charikar

Inf. Comput., 2001

Scheduling with unexpected machine breakdowns.

[BibT_eX]

[DOI]

Günter Schmidt

Discret. Appl. Math., 2001

Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows.

[BibT_eX]

[DOI]

Carsten Witt

Proceedings of the Approximation, 2001

Some Algorithmic Problems in Large Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

Exploring Unknown Environments.

[BibT_eX]

[DOI]

Monika Rauch Henzinger

SIAM J. Comput., 2000

Average-case analyses of first fit and random fit bin packing.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Minimizing stall time in single and parallel disk systems.

[BibT_eX]

[DOI]

Naveen Garg

Stefano Leonardi

J. ACM, 2000

1999

Better Bounds for Online Scheduling.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

On-line Algorithms.

[BibT_eX]

[DOI]

Stefano Leonardi

ACM Comput. Surv., 1999

Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Page Replacement for General Caching Problems.

[BibT_eX]

[DOI]

Sanjeev Arora

Sanjeev Khanna

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

A Competitive Analysis of the List Update Problem with Lookahead.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Improved Randomized On-Line Algorithms for the List Update Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

New On-Line Algorithms for the Page Replication Problem.

[BibT_eX]

[DOI]

Hisashi Koga

J. Algorithms, 1998

Average Case Analyses of List Update Algorithms, with Applications to Data Compression.

[BibT_eX]

[DOI]

Algorithmica, 1998

1997

Revisiting the Counter Algorithms for List Update.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Improved Parallel Integer Sorting without Concurrent Writing.

[BibT_eX]

[DOI]

Torben Hagerup

Inf. Comput., 1997

On the Influence of Lookahead in Competitive Paging Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 1997

1996

Self-Organizing Data Structures.

[BibT_eX]

[DOI]

Jeffery R. Westbrook

Proceedings of the Online Algorithms, 1996

1995

A Combined BIT and TIMESTAMP Algorithm for the List Update Problem.

[BibT_eX]

[DOI]

Bernhard von Stengel

Ralph Werchner

Inf. Process. Lett., 1995

Page Migration with Limited Local Memory Capacity.

[BibT_eX]

[DOI]

Hisashi Koga

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1993

The Complexity of One-Machine Batching Problems.

[BibT_eX]

[DOI]

Peter Brucker

Discret. Appl. Math., 1993

The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

The influence of lookahead in competitive on-line algorithms.

[BibT_eX]

[DOI]