| Publication | Date of Publication | Type |
|---|
| Competitive search in the line and the star with predictions | 2024-12-03 | Paper |
| Rényi-Ulam games and online computation with imperfect advice | 2024-12-03 | Paper |
| Online computation with untrusted advice | 2024-07-01 | Paper |
| Online search with a hint | 2024-02-02 | Paper |
| Best-of-both-worlds analysis of online search | 2023-12-13 | Paper |
| Contract scheduling with predictions | 2023-10-23 | Paper |
| Weighted online search | 2023-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875754 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090453 | 2022-07-18 | Paper |
| Further connections between contract-scheduling and ray-searching problems | 2022-05-27 | Paper |
| Online Maximum Matching with Recourse | 2021-08-04 | Paper |
| Online maximum matching with recourse | 2021-05-10 | Paper |
| Interruptible algorithms for multiproblem solving | 2020-08-31 | Paper |
| Competitive search in a network | 2020-05-27 | Paper |
| Stochastic dominance and the bijective ratio of online algorithms | 2020-04-01 | Paper |
| Online bin packing with advice of small size | 2019-09-05 | Paper |
| Parameterized analysis of the online priority and node-weighted Steiner tree problems | 2019-09-05 | Paper |
| Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems | 2019-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633928 | 2019-05-06 | Paper |
| The expanding search ratio of a graph | 2019-05-03 | Paper |
| On the separation and equivalence of paging strategies and other online algorithms | 2019-03-11 | Paper |
| The expanding search ratio of a graph | 2018-01-24 | Paper |
| Optimal scheduling of contract algorithms with soft deadlines | 2017-09-01 | Paper |
| Multi-processor search and scheduling problems with setup cost | 2017-08-15 | Paper |
| Infinite linear programming and online searching with turn cost | 2017-03-16 | Paper |
| Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems | 2015-11-19 | Paper |
| Online Bin Packing with Advice of Small Size | 2015-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934601 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934603 | 2014-12-18 | Paper |
| Multi-target ray searching problems | 2014-06-06 | Paper |
| Paging and list update under bijective analysis | 2014-02-17 | Paper |
| Multi-target Ray Searching Problems | 2011-08-12 | Paper |
| Randomized priority algorithms | 2010-06-07 | Paper |
| On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems | 2010-05-11 | Paper |
| Tight bounds for quasirandom rumor spreading | 2010-03-26 | Paper |
| Online Priority Steiner Tree Problems | 2009-10-20 | Paper |
| Approximation and Online Algorithms | 2009-08-11 | Paper |
| A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry | 2008-11-25 | Paper |
| List Update with Locality of Reference | 2008-04-15 | Paper |
| The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights | 2007-09-07 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Approximation and Online Algorithms | 2005-12-14 | Paper |
| The power of priority algorithms for facility location and set cover | 2004-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411275 | 2003-07-07 | Paper |
