| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6187017 | 2024-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187820 | 2024-01-15 | Paper |
| Optimal Algorithms for Online b-Matching with Variable Vertex Capacities | 2023-11-20 | Paper |
| Online ad allocation in bounded-degree graphs | 2023-08-04 | Paper |
| Machine covering in the random-order model | 2023-06-05 | Paper |
| Algorithms for energy conservation in heterogeneous data centers | 2023-03-22 | Paper |
| New Bounds for Randomized List Update in the Paid Exchange Model. | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875579 | 2023-02-03 | Paper |
| Improved Online Algorithms for Knapsack and GAP in the Random Order Model | 2023-02-03 | Paper |
| Page migration with limited local memory capacity | 2022-12-16 | Paper |
| New on-line algorithms for the page replication problem | 2022-12-09 | Paper |
| A Competitive analysis of the list update problem with lookahead | 2022-08-18 | Paper |
| Best Fit Bin Packing with Random Order Revisited | 2022-07-18 | Paper |
| Scheduling with testing on multiple identical parallel machines | 2022-03-25 | Paper |
| Online makespan minimization with budgeted uncertainty | 2022-03-25 | Paper |
| Explorable uncertainty in scheduling with non-uniform testing times | 2022-03-22 | Paper |
| Algorithms for energy conservation in heterogeneous data centers | 2021-11-18 | Paper |
| Scheduling In the random-order model | 2021-09-02 | Paper |
| Best fit bin packing with random order revisited | 2021-09-02 | Paper |
| Improved online algorithms for Knapsack and GAP in the random order model | 2021-06-11 | Paper |
| New results for the \(k\)-secretary problem | 2021-03-18 | Paper |
| Tight bounds for online coloring of basic graph classes | 2021-02-01 | Paper |
| Tight Bounds for Online Coloring of Basic Graph Classes | 2020-05-27 | Paper |
| On the Value of Penalties in Time-Inconsistent Planning | 2020-05-27 | Paper |
| Motivating time-inconsistent agents: a computational approach | 2019-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743475 | 2019-05-10 | Paper |
| The Price of Uncertainty in Present-Biased Planning | 2019-01-30 | Paper |
| New online algorithms for story scheduling in web advertising | 2019-01-11 | Paper |
| Energy-efficient algorithms for flow time minimization | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553434 | 2018-11-02 | Paper |
| Quantifying competitiveness in paging with locality of reference | 2018-10-18 | Paper |
| Scheduling on power-heterogeneous processors | 2017-11-16 | Paper |
| On the value of job migration in online makespan minimization | 2017-10-10 | Paper |
| Online makespan minimization with parallel schedules | 2017-07-07 | Paper |
| Motivating Time-Inconsistent Agents: A Computational Approach | 2017-02-10 | Paper |
| Revisiting the COUNTER algorithms for list update | 2016-05-26 | Paper |
| On approximate Nash equilibria in network design | 2016-05-25 | Paper |
| Scheduling on Power-Heterogeneous Processors | 2016-05-03 | Paper |
| On list update with locality of reference | 2016-04-18 | Paper |
| Quantifying Competitiveness in Paging with Locality of Reference | 2015-10-27 | Paper |
| Race to idle | 2015-08-14 | Paper |
| On multi-processor speed scaling with migration | 2015-07-13 | Paper |
| Speed scaling on parallel processors | 2014-12-02 | Paper |
| Online makespan minimization with parallel schedules | 2014-09-02 | Paper |
| Recent Advances for a Classical Scheduling Problem | 2013-08-07 | Paper |
| New Online Algorithms for Story Scheduling in Web Advertising | 2013-08-07 | Paper |
| Online Algorithms | 2013-06-18 | Paper |
| Ronald Graham: laying the foundations of online optimization | 2013-04-17 | Paper |
| On the value of job migration in online makespan minimization | 2012-09-25 | Paper |
| Semi-online scheduling revisited | 2012-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113668 | 2012-01-23 | Paper |
| New results on web caching with request reordering | 2010-09-16 | Paper |
| On nash equilibria for a network creation game | 2010-08-16 | Paper |
| On the performance of greedy algorithms in packet buffering | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579477 | 2010-08-06 | Paper |
| On randomized online scheduling | 2010-08-05 | Paper |
| On paging with locality of reference | 2010-08-05 | Paper |
| Algorithms for Energy Management | 2010-06-22 | Paper |
| An experimental study of new and known online packet buffering algorithms | 2010-05-28 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| On the Value of Coordination in Network Design | 2010-01-06 | Paper |
| Resource Management in Large Networks | 2009-07-09 | Paper |
| An Experimental Study of New and Known Online Packet Buffering Algorithms | 2008-09-25 | Paper |
| On List Update with Locality of Reference | 2008-08-28 | Paper |
| Energy-Efficient Algorithms for Flow Time Minimization | 2008-03-19 | Paper |
| A study of integrated document and connection caching in the WWW | 2007-04-26 | Paper |
| Minimizing stall time in single and parallel disk systems | 2006-09-12 | Paper |
| On the Performance of Greedy Algorithms in Packet Buffering | 2006-06-01 | Paper |
| Dynamic TCP Acknowledgment: Penalizing Long Delays | 2006-06-01 | Paper |
| An experimental study of online scheduling algorithms | 2005-08-04 | Paper |
| On paging with locality of reference | 2005-05-12 | Paper |
| Integrated prefetching and caching in single and parallel disk systems | 2005-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818862 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471273 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449210 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542564 | 2004-01-27 | Paper |
| Online algorithms: a survey | 2003-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796164 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785464 | 2003-02-04 | Paper |
| Delayed information and action in on-line algorithms | 2003-01-14 | Paper |
| On generalized connection caching | 2002-12-01 | Paper |
| Scheduling with unexpected machine breakdowns | 2002-10-31 | Paper |
| Randomized splay trees: Theoretical and experimental results. | 2002-07-14 | Paper |
| Exploring unknown environments with obstacles | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527046 | 2001-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527009 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250194 | 2000-10-17 | Paper |
| Average-case analyses of first fit and random fit bin packing | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252268 | 2000-04-13 | Paper |
| Exploring Unknown Environments | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941838 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252368 | 2000-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937214 | 2000-02-03 | Paper |
| Better Bounds for Online Scheduling | 1999-10-28 | Paper |
| Average case analyses of list update algorithms, with applications to data compression | 1998-11-18 | Paper |
| New On-Line Algorithms for the Page Replication Problem | 1998-10-06 | Paper |
| A competitive analysis of the list update problem with lookahead | 1998-08-13 | Paper |
| Improved Randomized On-Line Algorithms for the List Update Problem | 1998-05-10 | Paper |
| On the influence of lookahead in competitive paging algorithms | 1997-12-17 | Paper |
| Improved parallel integer sorting without concurrent writing | 1997-11-10 | Paper |
| A combined BIT and TIMESTAMP algorithm for the list update problem | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886073 | 1996-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763434 | 1995-04-11 | Paper |
| The complexity of one-machine batching problems | 1994-07-25 | Paper |
