| Publication | Date of Publication | Type |
|---|
| Classification via two-way comparisons (extended abstract) | 2024-01-16 | Paper |
| Better hardness results for the minimum spanning tree congestion problem | 2023-11-24 | Paper |
| A Simple Algorithm for Optimal Search Trees with Two-way Comparisons | 2023-10-31 | Paper |
| A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines | 2022-11-15 | Paper |
| On Huang and Wong's algorithm for generalized binary split trees | 2022-10-24 | Paper |
| Better Bounds for Online Line Chasing | 2022-07-21 | Paper |
| Scheduling with gaps: new models and algorithms | 2021-12-13 | Paper |
| On the cost of unsuccessful searches in search trees with two-way comparisons | 2021-11-25 | Paper |
| Information gathering in ad-hoc radio networks | 2021-11-25 | Paper |
| New results on multi-level aggregation | 2021-03-09 | Paper |
| Online Algorithms for Multilevel Aggregation | 2020-11-04 | Paper |
| Towards a theory of mixing graphs: a characterization of perfect mixability | 2020-10-22 | Paper |
| A waste-efficient algorithm for single-droplet sample preparation on microfluidic chips | 2020-07-22 | Paper |
| Online clique clustering | 2020-02-28 | Paper |
| Towards a theory of mixing graphs: a characterization of perfect mixability (extended abstract) | 2020-02-06 | Paper |
| A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines | 2019-10-15 | Paper |
| An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs | 2019-08-19 | 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 |
| https://portal.mardi4nfdi.de/entity/Q4633927 | 2019-05-06 | Paper |
| Improved online algorithms for buffer management in QoS switches | 2018-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636503 | 2018-04-19 | Paper |
| Faster information gathering in ad-hoc radio tree networks | 2018-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606281 | 2018-03-02 | Paper |
| Information gathering in ad-hoc radio networks with tree topology | 2017-12-20 | Paper |
| Competitive analysis of randomized paging algorithms | 2017-12-05 | Paper |
| A greedy approximation algorithm for minimum-gap scheduling | 2017-09-01 | Paper |
| A simple analysis of the harmonic algorithm for two servers | 2016-06-16 | Paper |
| A better lower bound on the competitive ratio of the randomized 2-server problem | 2016-05-26 | Paper |
| Faster information gathering in ad-hoc radio tree networks | 2016-05-03 | Paper |
| Optimal Search Trees with 2-Way Comparisons | 2016-01-11 | Paper |
| Competitive Strategies for Online Clique Clustering | 2015-09-21 | Paper |
| Scheduling with Gaps: New Models and Algorithms | 2015-09-21 | Paper |
| Information Gathering in Ad-Hoc Radio Networks with Tree Topology | 2015-09-11 | Paper |
| The greedy algorithm for the minimum common string partition problem | 2015-09-02 | Paper |
| LP-rounding algorithms for the fault-tolerant facility placement problem | 2015-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501363 | 2015-08-03 | Paper |
| A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines | 2015-07-28 | Paper |
| Group Search on the Line | 2015-02-20 | Paper |
| Polynomial-time algorithms for minimum energy scheduling | 2014-09-09 | Paper |
| Algorithms for placing monitors in a flow network | 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 |
| A Greedy Approximation Algorithm for Minimum-Gap Scheduling | 2013-06-07 | Paper |
| LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem | 2013-06-07 | Paper |
| Approximation algorithms for the fault-tolerant facility placement problem | 2013-03-28 | Paper |
| Collecting weighted items from a dynamic queue | 2013-03-05 | Paper |
| A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue | 2013-03-04 | Paper |
| Caching is hard -- even in the fault model | 2012-12-06 | Paper |
| Tile-packing tomography is \(\mathbb{NP}\)-hard | 2012-11-21 | Paper |
| A low-cost memory remapping scheme for address bus protection | 2012-03-07 | Paper |
| Randomized competitive algorithms for online buffer management in the adaptive adversary model | 2011-10-10 | Paper |
| Better Bounds for Incremental Frequency Allocation in Bipartite Graphs | 2011-09-16 | Paper |
| Two-Bounded-Space Bin Packing Revisited | 2011-09-16 | Paper |
| Better bounds for incremental medians | 2011-02-21 | Paper |
| Caching Is Hard – Even in the Fault Model | 2010-09-06 | Paper |
| Tile-Packing Tomography Is ${\mathbb{NP}}$ -hard | 2010-07-20 | Paper |
| The reverse greedy algorithm for the metric k-median problem | 2009-12-18 | 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 |
| https://portal.mardi4nfdi.de/entity/Q3183008 | 2009-10-16 | Paper |
| Algorithms for Placing Monitors in a Flow Network | 2009-07-02 | Paper |
| Three Results on Frequency Assignment in Linear Cellular Networks | 2009-07-02 | Paper |
| Randomized Algorithms for Buffer Management with 2-Bounded Delay | 2009-02-12 | Paper |
| Experimental Analysis of Scheduling Algorithms for Aggregated Links | 2009-02-12 | Paper |
| Polynomial Time Algorithms for Minimum Energy Scheduling | 2008-09-25 | Paper |
| Oblivious Medians Via Online Bidding | 2008-09-18 | Paper |
| Competitive Analysis of Scheduling Algorithms for Aggregated Links | 2008-09-18 | Paper |
| Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems | 2008-07-10 | Paper |
| Competitive analysis of scheduling algorithms for aggregated links | 2008-07-01 | Paper |
| Incremental medians via online bidding | 2008-04-23 | Paper |
| Better Bounds for Incremental Medians | 2008-02-20 | Paper |
| Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help | 2008-01-03 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Online competitive algorithms for maximizing weighted throughput of unit jobs | 2007-11-05 | Paper |
| The Wake‐Up Problem in MultiHop Radio Networks | 2007-10-22 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| A note on scheduling equal-length jobs to maximize throughput | 2007-05-15 | Paper |
| The complexity of mean flow time scheduling problems with release times | 2007-05-15 | Paper |
| Computing and Combinatorics | 2006-01-11 | 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 |
| The weighted 2-server problem | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737209 | 2004-08-11 | Paper |
| A randomized algorithm for gossiping in radio networks | 2004-03-15 | Paper |
| Preemptive scheduling of equal-length jobs to maximize weighted throughput. | 2004-03-15 | Paper |
| Preemptive scheduling in overloaded systems. | 2003-08-19 | Paper |
| More on randomized on-line algorithms for caching. | 2003-08-17 | Paper |
| On tiling under tomographic constraints. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418654 | 2003-08-11 | Paper |
| More on random walks, electrical networks, and the harmonic \(k\)-server algorithm. | 2003-01-21 | Paper |
| The 3-server problem in the plane. | 2003-01-21 | Paper |
| A randomized algorithm for two servers on the line. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779149 | 2002-11-25 | Paper |
| Fast broadcasting and gossiping in radio networks | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551385 | 2002-09-05 | Paper |
| Reconstructing \(hv\)-convex polyominoes from orthogonal projections | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535068 | 2002-06-12 | Paper |
| Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501565 | 2001-06-18 | Paper |
| Computing simple paths among obstacles | 2001-04-10 | Paper |
| Competitive Algorithms for Relaxed List Update and Multilevel Caching | 2000-08-28 | Paper |
| Competitive analysis of randomized paging algorithms | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250169 | 2000-05-25 | Paper |
| LRU is better than FIFO | 1999-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250167 | 1999-06-17 | Paper |
| Minimum-width grid drawings of plane graphs | 1999-01-11 | Paper |
| Two results on linear embeddings of complete binary trees | 1997-09-22 | Paper |
| Page Migration Algorithms Using Work Functions | 1997-08-25 | Paper |
| A linear-time algorithm for drawing a planar graph on a grid | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763407 | 1995-04-11 | Paper |
| Generosity Helps or an 11-Competitive Algorithm for Three Servers | 1994-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138950 | 1993-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028881 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010306 | 1992-09-27 | Paper |
| HARMONIC is 3-competitive for two servers | 1992-09-27 | Paper |
| On fast algorithms for two servers | 1992-06-28 | Paper |
| A note on the server problem and a benevolent adversary | 1992-06-26 | Paper |
| Planar orientations with low out-degree and compaction of adjacency matrices | 1992-06-26 | Paper |
| A New Approach to the Server Problem | 1992-06-25 | Paper |
| Connectivity vs. reachability | 1991-01-01 | Paper |
| An efficient parallel algorithm for computing a large independent set in a planar graph | 1991-01-01 | Paper |
| An Optimal On-Line Algorithm for K Servers on Trees | 1991-01-01 | Paper |
| A data structure useful for finding Hamiltonian cycles | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3361888 | 1990-01-01 | Paper |
| Improved edge-coloring algorithms for planar graphs | 1990-01-01 | Paper |
| Optimal Parallel 5-Colouring of Planar Graphs | 1989-01-01 | Paper |
| Fast algorithms for edge-coloring planar graphs | 1989-01-01 | Paper |
| On some packing problem related to dynamic storage allocation | 1988-01-01 | Paper |
| k\(+1\) heads are better than k for PDAs | 1988-01-01 | Paper |
| A note on random sampling | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3806831 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3824320 | 1988-01-01 | Paper |
| Remarks on string-matching and one-way multihead automata | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773822 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779971 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783597 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4728262 | 1986-01-01 | Paper |
| Finite automata and unary languages | 1986-01-01 | Paper |
| Hierarchies of one-way multihead automata languages | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768406 | 1986-01-01 | Paper |
| A characterization of reversal-bounded multipushdown machine languages | 1985-01-01 | Paper |
| Variations on the technique of Ďuriš and Galil | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687746 | 1985-01-01 | Paper |
| Probabilistic Turing machines and recursively enumerable Dedekind cuts | 1984-01-01 | Paper |
| A note on bounded-reversal multipushdown machines | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3219134 | 1984-01-01 | Paper |
