| Publication | Date of Publication | Type |
|---|
Online computation with untrusted advice
Journal of Computer and System Sciences | 2024-07-01 | Paper |
Best-of-both-worlds analysis of online search
Algorithmica | 2023-12-13 | Paper |
scientific article; zbMATH DE number 7740865 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
scientific article; zbMATH DE number 7650400 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Scheduling with a processing time oracle
Applied Mathematical Modelling | 2022-12-21 | Paper |
scientific article; zbMATH DE number 7559116 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Online maximum matching with recourse
(available as arXiv preprint) | 2021-08-04 | Paper |
| Scheduling with explorable uncertainty | 2021-06-15 | Paper |
Online maximum matching with recourse
Journal of Combinatorial Optimization | 2021-05-10 | Paper |
Randomized two-valued bounded delay online buffer management
Operations Research Letters | 2021-04-07 | Paper |
New results on multi-level aggregation
Theoretical Computer Science | 2021-03-09 | Paper |
An adversarial model for scheduling with testing
Algorithmica | 2020-11-11 | Paper |
Online Algorithms for Multilevel Aggregation
Operations Research | 2020-11-04 | Paper |
Online clique clustering
Algorithmica | 2020-02-28 | Paper |
Order constraints for single machine scheduling with non-linear cost
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Online bin packing with advice of small size
Theory of Computing Systems | 2019-09-05 | Paper |
| Collecting weighted items from a dynamic queue | 2019-05-06 | Paper |
The expanding search ratio of a graph
Discrete Applied Mathematics | 2019-05-03 | Paper |
The triangle scheduling problem
Journal of Scheduling | 2018-11-07 | Paper |
The triangle scheduling problem
Journal of Scheduling | 2018-11-07 | Paper |
On the power of advice and randomization for online bipartite matching
(available as arXiv preprint) | 2018-03-02 | Paper |
Online algorithms for multi-level aggregation
(available as arXiv preprint) | 2018-03-02 | Paper |
The expanding search ratio of a graph
(available as arXiv preprint) | 2018-01-24 | Paper |
A decision procedure for well-formed linear quantum cellular automata
STACS 96 | 2017-11-16 | Paper |
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling
Theoretical Computer Science | 2017-09-13 | Paper |
The local-global conjecture for scheduling with non-linear cost
Journal of Scheduling | 2017-09-01 | Paper |
Multi-processor search and scheduling problems with setup cost
Theory of Computing Systems | 2017-08-15 | Paper |
Infinite linear programming and online searching with turn cost
Theoretical Computer Science | 2017-03-16 | Paper |
Online bin packing with advice of small size
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
Discrete Applied Mathematics | 2015-09-30 | Paper |
Competitive strategies for online clique clustering
Lecture Notes in Computer Science | 2015-09-21 | Paper |
A note on \({\mathbb {NP}}\)-hardness of preemptive mean flow-time scheduling for parallel machines
Journal of Scheduling | 2015-07-28 | Paper |
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling
Lecture Notes in Computer Science | 2015-01-12 | Paper |
Polynomial-time algorithms for minimum energy scheduling
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Online scheduling of bounded length jobs to maximize throughput
Journal of Scheduling | 2014-02-05 | Paper |
Approximating the throughput by coolest first scheduling
Approximation and Online Algorithms | 2013-09-13 | Paper |
Collecting weighted items from a dynamic queue
Algorithmica | 2013-03-05 | Paper |
A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue
Theoretical Computer Science | 2013-03-04 | Paper |
Tile-packing tomography is \(\mathbb{NP}\)-hard
Algorithmica | 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
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
The interval ordering problem
Discrete Applied Mathematics | 2012-05-30 | Paper |
Non-clairvoyant scheduling games
Theory of Computing Systems | 2011-11-23 | Paper |
Finding total unimodularity in optimization problems solved by linear programs
Algorithmica | 2011-03-02 | Paper |
Tile-packing tomography is \({\mathbb{NP}}\)-hard
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Online Scheduling of Bounded Length Jobs to Maximize Throughput
Approximation and Online Algorithms | 2010-05-11 | Paper |
Non-clairvoyant scheduling games
Algorithmic Game Theory | 2009-12-01 | Paper |
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Nash Equilibria in Voronoi Games on Graphs
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Polynomial Time Algorithms for Minimum Energy Scheduling
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Competitive Analysis of Scheduling Algorithms for Aggregated Links
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Competitive analysis of scheduling algorithms for aggregated links
Algorithmica | 2008-07-01 | Paper |
Runway sequencing with holding patterns
European Journal of Operational Research | 2008-04-24 | Paper |
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
Lecture Notes in Computer Science | 2008-03-11 | Paper |
A note on scheduling equal-length jobs to maximize throughput
Journal of Scheduling | 2007-05-15 | Paper |
The complexity of mean flow time scheduling problems with release times
Journal of Scheduling | 2007-05-15 | Paper |
Quantum Query Complexity of Some Graph Problems
SIAM Journal on Computing | 2006-06-01 | Paper |
Quantum Algorithms for Element Distinctness
SIAM Journal on Computing | 2005-09-16 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Cellular automata and communication complexity
Theoretical Computer Science | 2004-11-12 | Paper |
Preemptive scheduling of equal-length jobs to maximize weighted throughput.
Operations Research Letters | 2004-03-15 | Paper |
On tiling under tomographic constraints.
Theoretical Computer Science | 2003-08-17 | Paper |
Tiling with bars under tomographic constraints.
Theoretical Computer Science | 2003-08-17 | Paper |
Reconstructing \(hv\)-convex polyominoes from orthogonal projections
Information Processing Letters | 2002-07-25 | Paper |
A decision procedure for unitary linear quantum cellular automata
SIAM Journal on Computing | 2002-04-23 | Paper |
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
Theoretical Computer Science | 2001-08-20 | Paper |
| A decision procedure for well-formed linear quantum cellular automata | 1998-06-01 | Paper |
