| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6075956 | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6168414 | 2023-08-08 | Paper |
| The online transportation problem | 2023-05-08 | Paper |
| Competitively pricing parking in a tree | 2023-03-21 | Paper |
| Online load balancing of temporary tasks | 2023-01-18 | Paper |
| On the impossibility of decomposing binary matroids | 2022-10-17 | Paper |
| A competitive analysis of nearest neighbor based algorithms for searching unknown scenes | 2022-08-18 | Paper |
| A competitive algorithm for throughput maximization on identical machines | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092350 | 2022-07-21 | Paper |
| On the Impossibility of Decomposing Binary Matroids | 2022-06-26 | Paper |
| A poly-log competitive posted-price algorithm for online metrical matching on a spider | 2022-05-20 | Paper |
| Fault-tolerant real-time scheduling | 2021-12-20 | Paper |
| The matroid intersection cover problem | 2021-04-07 | Paper |
| Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing | 2020-05-27 | Paper |
| The online set aggregation problem | 2020-02-12 | Paper |
| Hallucination Helps: Energy Efficient Virtual Circuit Routing | 2020-01-21 | Paper |
| Hallucination Helps: Energy Efficient Virtual Circuit Routing | 2019-06-20 | Paper |
| A \(o(n)\)-competitive deterministic algorithm for online matching on a line | 2019-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743473 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743474 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633880 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633881 | 2019-05-06 | Paper |
| Constructing competitive tours from local information | 2019-03-29 | Paper |
| The Itinerant List Update problem | 2019-01-15 | Paper |
| Getting the best response for your erg | 2018-11-05 | Paper |
| Tight bounds for double coverage against weak adversaries | 2018-04-12 | Paper |
| Efficient computation of optimal energy and fractional weighted flow trade-off schedules | 2017-10-10 | Paper |
| A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs | 2017-08-31 | Paper |
| The one-dimensional Euclidean domain: finitely many obstructions are not enough | 2017-05-23 | Paper |
| Energy-efficient circuit design | 2017-05-19 | Paper |
| Weighted geometric set multi-cover via quasi-uniform sampling | 2017-03-30 | Paper |
| Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules | 2017-03-03 | Paper |
| Optimal Speed Scaling with a Solar Cell | 2017-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2955017 | 2017-01-24 | Paper |
| Fault-tolerant scheduling | 2016-09-01 | Paper |
| Chasing Convex Bodies and Functions | 2016-05-03 | Paper |
| Tight Bounds for Double Coverage Against Weak Adversaries | 2016-02-26 | Paper |
| A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line | 2015-11-20 | Paper |
| Minimizing flow time nonclairvoyantly | 2015-11-12 | Paper |
| On the Complexity of Speed Scaling | 2015-09-16 | Paper |
| Almost All Functions Require Exponential Energy | 2015-09-16 | Paper |
| A maiden analysis of longest wait first | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501343 | 2015-08-03 | Paper |
| Cluster before you hallucinate | 2015-06-26 | Paper |
| The Geometry of Scheduling | 2015-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934667 | 2014-12-18 | Paper |
| Speed Scaling with an Arbitrary Power Function | 2014-12-05 | Paper |
| Cake cutting really is not a piece of cake | 2014-09-09 | Paper |
| Scalably scheduling processes with arbitrary speedup curves | 2014-09-09 | Paper |
| Online Scheduling with General Cost Functions | 2014-06-04 | Paper |
| Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling | 2013-09-13 | Paper |
| Multicast Routing for Energy Minimization Using Speed Scaling | 2013-04-19 | Paper |
| Shortest-Elapsed-Time-First on a Multiprocessor | 2013-04-19 | Paper |
| The Complexity of Scheduling for p-Norms of Flow and Stretch | 2013-03-19 | Paper |
| Speed scaling of processes with arbitrary speedup curves on a multiprocessor | 2012-12-10 | Paper |
| Weighted Geometric Set Multi-cover via Quasi-uniform Sampling | 2012-09-25 | Paper |
| The power of fair pricing mechanisms | 2012-04-26 | Paper |
| Nonclairvoyant Speed Scaling for Flow and Energy | 2012-04-24 | Paper |
| Nonclairvoyant speed scaling for flow and energy | 2011-11-07 | Paper |
| Average rate speed scaling | 2011-07-01 | Paper |
| Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service | 2011-04-04 | Paper |
| Open problems in real-time scheduling | 2011-04-01 | Paper |
| Competitive algorithms for due date scheduling | 2011-03-30 | Paper |
| Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability | 2011-02-15 | Paper |
| How to Schedule When You Have to Buy Your Energy | 2010-09-10 | Paper |
| Scalably Scheduling Power-Heterogeneous Processors | 2010-09-07 | Paper |
| Speed Scaling for Weighted Flow Time | 2010-09-06 | Paper |
| Cake cutting really is not a piece of cake | 2010-08-16 | Paper |
| Server scheduling in the L p norm | 2010-08-16 | Paper |
| The Power of Fair Pricing Mechanisms | 2010-04-27 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Speed scaling with a solar cell | 2009-11-04 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Speed scaling to manage energy and temperature | 2008-12-21 | Paper |
| Speed Scaling with a Solar Cell | 2008-07-10 | Paper |
| Confidently Cutting a Cake into Approximately Fair Pieces | 2008-07-10 | Paper |
| Speed scaling of tasks with precedence constraints | 2008-06-06 | Paper |
| The Price of Stochastic Anarchy | 2008-05-02 | Paper |
| The Online Transportation Problem: On the Exponential Boost of One Extra Server | 2008-04-15 | Paper |
| Average Rate Speed Scaling | 2008-04-15 | Paper |
| Dedicationcategory:Dedication | 2007-12-20 | Paper |
| Competitive Algorithms for Due Date Scheduling | 2007-11-28 | Paper |
| Approximation schemes for a class of subset selection problems | 2007-09-18 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Online weighted flow time and deadline scheduling | 2006-10-31 | Paper |
| A comparison of multicast pull models | 2006-03-21 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Fault-Tolerant Scheduling | 2005-09-16 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828963 | 2004-11-29 | Paper |
| Semi-clairvoyant scheduling | 2004-11-23 | Paper |
| Maximizing job completions online | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472464 | 2004-08-04 | Paper |
| Multicast pull scheduling: When fairness is fine | 2003-08-17 | Paper |
| Dynamic spectrum allocation: the impotency of duration notification. | 2003-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411412 | 2003-07-08 | Paper |
| Speed is as powerful as clairvoyance | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707786 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780781 | 2002-11-21 | Paper |
| Caching for web searching | 2002-06-17 | Paper |
| Scheduling broadcasts in wireless networks | 2002-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753944 | 2001-12-18 | Paper |
| Eliminating Migration in Multi-processor Scheduling | 2001-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721975 | 2001-07-11 | Paper |
| Errata: A new algorithm for scheduling periodic, real-time tasks | 2000-12-03 | Paper |
| Fault-tolerant real-time scheduling | 2000-08-27 | Paper |
| An optimal deterministic algorithm for online \(b\)-matching | 2000-08-23 | Paper |
| The Online Transportation Problem | 2000-07-20 | Paper |
| Constructing competitive tours from local information | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252706 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252326 | 1999-06-17 | Paper |
| On-Line Load Balancing of Temporary Tasks | 1997-03-18 | Paper |
| Using local adaptations to reconfigure a spanning tree of a network | 1995-06-11 | Paper |
| Average-case scalable on-line algorithms for fault replacement | 1994-11-20 | Paper |
| Not all insertion methods yield constant approximate tours in the Euclidean plane | 1994-04-05 | Paper |
| A competitive analysis of algorithms for searching unknown scenes | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138958 | 1993-10-20 | Paper |
| Online Weighted Matching | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010311 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010316 | 1992-09-27 | Paper |
| The complexity of controlled selection | 1992-06-25 | Paper |
