| Publication | Date of Publication | Type |
|---|
| Best-of-both-worlds analysis of online search | 2023-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075894 | 2023-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875754 | 2023-02-03 | Paper |
| Scheduling with a processing time oracle | 2022-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090453 | 2022-07-18 | Paper |
| Online Maximum Matching with Recourse | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4993294 | 2021-06-15 | Paper |
| Online maximum matching with recourse | 2021-05-10 | Paper |
| Randomized two-valued bounded delay online buffer management | 2021-04-07 | Paper |
| New results on multi-level aggregation | 2021-03-09 | Paper |
| An adversarial model for scheduling with testing | 2020-11-11 | Paper |
| Online Algorithms for Multilevel Aggregation | 2020-11-04 | Paper |
| Online clique clustering | 2020-02-28 | Paper |
| Order constraints for single machine scheduling with non-linear cost | 2019-09-12 | Paper |
| Online bin packing with advice of small size | 2019-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633927 | 2019-05-06 | Paper |
| The expanding search ratio of a graph | 2019-05-03 | Paper |
| The triangle scheduling problem | 2018-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606281 | 2018-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606307 | 2018-03-02 | Paper |
| The expanding search ratio of a graph | 2018-01-24 | Paper |
| A decision procedure for well-formed linear quantum cellular automata | 2017-11-16 | Paper |
| Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling | 2017-09-13 | Paper |
| The local-global conjecture for scheduling with non-linear cost | 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 |
| Online Bin Packing with Advice of Small Size | 2015-10-30 | Paper |
| Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption | 2015-09-30 | Paper |
| Competitive Strategies for Online Clique Clustering | 2015-09-21 | Paper |
| A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines | 2015-07-28 | Paper |
| Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling | 2015-01-12 | Paper |
| Polynomial-time algorithms for minimum energy scheduling | 2014-09-09 | Paper |
| Online scheduling of bounded length jobs to maximize throughput | 2014-02-05 | Paper |
| Approximating the Throughput by Coolest First Scheduling | 2013-09-13 | 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 |
| Tile-packing tomography is \(\mathbb{NP}\)-hard | 2012-11-21 | Paper |
| Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography | 2012-08-22 | Paper |
| The interval ordering problem | 2012-05-30 | Paper |
| Non-clairvoyant scheduling games | 2011-11-23 | Paper |
| Finding total unimodularity in optimization problems solved by linear programs | 2011-03-02 | Paper |
| Tile-Packing Tomography Is ${\mathbb{NP}}$ -hard | 2010-07-20 | Paper |
| Online Scheduling of Bounded Length Jobs to Maximize Throughput | 2010-05-11 | Paper |
| Non-clairvoyant Scheduling Games | 2009-12-01 | Paper |
| Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard | 2009-10-29 | Paper |
| Nash Equilibria in Voronoi Games on Graphs | 2008-09-25 | Paper |
| Polynomial Time Algorithms for Minimum Energy Scheduling | 2008-09-25 | 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 |
| Runway sequencing with holding patterns | 2008-04-24 | Paper |
| Finding Total Unimodularity in Optimization Problems Solved by Linear Programs | 2008-03-11 | 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 |
| Quantum Query Complexity of Some Graph Problems | 2006-06-01 | Paper |
| Quantum Algorithms for Element Distinctness | 2005-09-16 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Cellular automata and communication complexity | 2004-11-12 | Paper |
| Preemptive scheduling of equal-length jobs to maximize weighted throughput. | 2004-03-15 | Paper |
| Tiling with bars under tomographic constraints. | 2003-08-17 | Paper |
| On tiling under tomographic constraints. | 2003-08-17 | Paper |
| Reconstructing \(hv\)-convex polyominoes from orthogonal projections | 2002-07-25 | Paper |
| A Decision Procedure for Unitary Linear Quantum Cellular Automata | 2002-04-23 | Paper |
| Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms | 2001-08-20 | Paper |
| A decision procedure for well-formed linear quantum cellular automata | 1998-06-01 | Paper |
