| Publication | Date of Publication | Type |
|---|
| Approximation algorithms and lower bounds for graph burning | 2025-01-14 | Paper |
| Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms | 2024-06-17 | Paper |
| Graph burning and non-uniform \(k\)-centers for small treewidth | 2023-07-25 | Paper |
| A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines | 2022-11-15 | Paper |
| Improved analysis of online balanced clustering | 2022-10-19 | Paper |
| On-line scheduling of parallel jobs | 2022-08-18 | Paper |
| On packet scheduling with adversarial jamming and speedup | 2021-05-05 | Paper |
| New results on multi-level aggregation | 2021-03-09 | Paper |
| Online Algorithms for Multilevel Aggregation | 2020-11-04 | Paper |
| A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines | 2019-10-15 | Paper |
| Better Approximation Bounds for the Joint Replenishment Problem | 2019-06-20 | Paper |
| Online packet scheduling with bounded delay and lookahead | 2019-05-29 | Paper |
| The optimal absolute ratio for online bin packing | 2019-05-03 | Paper |
| Scheduling shared continuous resources on many-cores | 2018-11-07 | Paper |
| Improved online algorithms for buffer management in QoS switches | 2018-11-05 | Paper |
| On packet scheduling with adversarial jamming and speedup | 2018-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636503 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606281 | 2018-03-02 | Paper |
| Colored bin packing: online algorithms and lower bounds | 2018-02-28 | Paper |
| Online bin stretching with three bins | 2018-02-28 | Paper |
| Logarithmic price of buffer downscaling on line metrics | 2017-12-20 | Paper |
| Some bounds on multiparty communication complexity of pointer jumping | 2017-11-16 | Paper |
| A two-phase algorithm for bin stretching with stretching factor 1.5 | 2017-11-16 | Paper |
| General caching is hard: even with small pages | 2017-10-10 | Paper |
| The optimal absolute ratio for online bin packing | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957914 | 2017-01-30 | Paper |
| A simple analysis of the harmonic algorithm for two servers | 2016-06-16 | Paper |
| A lower bound for randomized on-line multiprocessor scheduling | 2016-05-26 | Paper |
| Online scheduling of jobs with fixed start times on related machines | 2016-03-23 | Paper |
| Online knapsack revisited | 2016-03-21 | Paper |
| General caching is hard: even with small pages | 2016-01-11 | Paper |
| Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms | 2015-11-20 | Paper |
| Better Algorithms for Online Bin Stretching | 2015-11-20 | Paper |
| Online Colored Bin Packing | 2015-11-20 | Paper |
| The greedy algorithm for the minimum common string partition problem | 2015-09-02 | Paper |
| A lower bound on deterministic online algorithms for scheduling on related machines without preemption | 2015-05-12 | Paper |
| Optimal online scheduling of parallel jobs with dependencies | 2015-05-07 | Paper |
| Online Bin Packing: Old Algorithms and New Results | 2015-02-25 | Paper |
| Two algorithms for general list matrix partitions | 2014-10-13 | Paper |
| Lower bounds for online makespan minimization on a small number of related machines | 2014-08-18 | Paper |
| Optimal Analysis of Best Fit Bin Packing | 2014-07-01 | Paper |
| Graph balancing: a special case of scheduling unrelated parallel machines | 2014-03-25 | Paper |
| Better bounds for incremental frequency allocation in bipartite graphs | 2013-12-11 | Paper |
| Online Control Message Aggregation in Chain Networks | 2013-08-12 | Paper |
| Online Scheduling of Jobs with Fixed Start Times on Related Machines | 2012-11-02 | Paper |
| Open Problems in Throughput Scheduling | 2012-09-25 | Paper |
| A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption | 2012-07-16 | Paper |
| Computer-aided complexity classification of dial-a-ride problems | 2012-06-08 | Paper |
| Semi-Online Preemptive Scheduling: One Algorithm for All Variants. | 2012-04-24 | Paper |
| Better Bounds for Incremental Frequency Allocation in Bipartite Graphs | 2011-09-16 | Paper |
| Two-Bounded-Space Bin Packing Revisited | 2011-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002790 | 2011-05-24 | Paper |
| Semi-online preemptive scheduling: one algorithm for all variants | 2011-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579372 | 2010-08-06 | Paper |
| A lower bound for cake cutting | 2010-03-03 | Paper |
| Optimal and online preemptive scheduling on uniformly related machines | 2009-12-02 | Paper |
| Algorithms for testing fault-tolerance of sequenced jobs | 2009-12-02 | Paper |
| Three results on frequency assignment in linear cellular networks | 2009-12-01 | Paper |
| Periodic scheduling with obligatory vacations | 2009-11-06 | Paper |
| Three Results on Frequency Assignment in Linear Cellular Networks | 2009-07-02 | Paper |
| Preemptive online scheduling: Optimal algorithms for all speeds | 2009-05-06 | Paper |
| Randomized strategies for the plurality problem | 2009-03-04 | Paper |
| A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines | 2009-02-12 | Paper |
| Online Scheduling of Equal-Length Jobs on Parallel Machines | 2008-09-25 | Paper |
| Preemptive Online Scheduling: Optimal Algorithms for All Speeds | 2008-03-11 | Paper |
| On the complexity of cake cutting | 2008-01-18 | Paper |
| Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help | 2008-01-03 | Paper |
| An approximation scheme for cake division with a linear number of cuts | 2007-11-12 | Paper |
| Online competitive algorithms for maximizing weighted throughput of unit jobs | 2007-11-05 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Paging with connections: FIFO strikes again | 2007-06-06 | Paper |
| An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality | 2007-02-14 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| On the Nonlearnability of a Single Spiking Neuron | 2006-02-08 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Coloring graphs from lists with bounded size of their union | 2005-08-01 | Paper |
| The weighted 2-server problem | 2004-11-23 | Paper |
| It is tough to be a plumber | 2004-10-27 | Paper |
| Approximation schemes for scheduling on uniformly related and identical parallel machines | 2004-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737209 | 2004-08-11 | Paper |
| Functions that have read‐twice constant width branching programs are not necessarily testable | 2004-03-29 | Paper |
| Preemptive scheduling in overloaded systems. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418654 | 2003-08-11 | Paper |
| Off-line temporary tasks assignment. | 2003-01-21 | Paper |
| Communication complexity towards lower bounds on circuit depth | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535068 | 2002-06-12 | Paper |
| The complexity of coloring graphs without long induced paths | 2002-02-13 | Paper |
| Ancient and new algorithms for load balancing in the \(\ell_p\) norm | 2001-10-07 | Paper |
| Solution of David Gale's lion and man problem | 2001-08-20 | Paper |
| Randomized on-line scheduling on two uniform machines | 2001-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501565 | 2001-06-18 | Paper |
| A lower bound for on-line scheduling on uniformly related machines | 2001-04-18 | Paper |
| Efficient dynamic traitor tracing | 2001-03-19 | Paper |
| Semi-online scheduling with decreasing job sizes | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252304 | 2000-09-26 | Paper |
| DNF tautologies with a limited number of occurrences of every variable | 2000-08-21 | Paper |
| Bounds on pairs of families with restricted intersections | 2000-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952673 | 2000-05-10 | Paper |
| Lower bounds for the polynomial calculus and the Gröbner basis algorithm | 2000-03-30 | Paper |
| Multiprocessor Scheduling with Rejection | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938775 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250210 | 1999-12-07 | Paper |
| Some bounds on multiparty communication complexity of pointer jumping | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224901 | 1999-01-17 | Paper |
| Proof complexity in algebraic systems and bounded depth Frege systems with modular counting | 1998-06-29 | Paper |
| Optimal on-line scheduling of parallel jobs with dependencies | 1998-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375799 | 1998-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2785569 | 1997-08-03 | Paper |
| Boolean Circuits, Tensor Ranks, and Communication Complexity | 1997-05-26 | Paper |
| On the computational power of DNA | 1997-04-21 | Paper |
| Randomized On-line Scheduling of Parallel Jobs | 1996-10-16 | Paper |
| Solution of a covering problem related to labelled tournaments | 1996-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875173 | 1996-09-15 | Paper |
| Dynamic scheduling on parallel machines | 1995-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3990239 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3990240 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3984103 | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3981829 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750855 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359762 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3765768 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751573 | 1986-01-01 | Paper |
