| Publication | Date of Publication | Type |
|---|
The power of proportional fairness for nonclairvoyant polytope scheduling
SIAM Journal on Computing | 2026-03-11 | Paper |
On solution discovery via reconfiguration
Journal of Computer and System Sciences | 2026-02-11 | Paper |
| Solution discovery via reconfiguration for problems in P | 2026-01-14 | Paper |
| Competitive query minimization for stable matching with one-sided uncertainty | 2025-10-06 | Paper |
Boosting double coverage for k-server via imperfect predictions
Algorithmica | 2025-09-24 | Paper |
| Learning-augmented query policies for minimum spanning tree with uncertainty | 2025-06-19 | Paper |
Online metric matching on the line with recourse
Algorithmica | 2025-05-23 | Paper |
Configuration balancing for stochastic requests
Mathematical Programming. Series A. Series B | 2025-03-05 | Paper |
| Fast combinatorial algorithms for efficient sortation | 2025-02-07 | Paper |
| Santa claus meets makespan and matroids: algorithms and reductions | 2024-11-28 | Paper |
| Matching augmentation via simultaneous contractions | 2024-11-14 | Paper |
scientific article; zbMATH DE number 7829331 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7799596 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
| Solution discovery via reconfiguration for problems in P | 2023-11-22 | Paper |
Set selection under explorable stochastic uncertainty via covering techniques
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Configuration balancing for stochastic requests
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
scientific article; zbMATH DE number 7758339 (Why is no real title available?)
(available as arXiv preprint) | 2023-10-31 | Paper |
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
ACM Transactions on Algorithms | 2023-10-23 | Paper |
scientific article; zbMATH DE number 7740865 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
Throughput scheduling with equal additive laxity
Lecture Notes in Computer Science | 2023-03-22 | Paper |
Speed-robust scheduling: sand, bricks, and rocks
Mathematical Programming. Series A. Series B | 2023-03-14 | Paper |
| Optimally Handling Commitment Issues in Online Throughput Maximization | 2023-02-07 | Paper |
Throughput scheduling with equal additive laxity
Operations Research Letters | 2022-10-17 | Paper |
Online load balancing with general reassignment cost
Operations Research Letters | 2022-07-22 | Paper |
| Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics | 2022-07-18 | Paper |
On Hop-Constrained Steiner Trees in Tree-Like Metrics
SIAM Journal on Discrete Mathematics | 2022-06-03 | Paper |
Speed-robust scheduling. Sand, bricks, and rocks
(available as arXiv preprint) | 2021-12-21 | Paper |
Optimal algorithms for scheduling under time-of-use tariffs
Annals of Operations Research | 2021-11-09 | Paper |
| Scheduling with explorable uncertainty | 2021-06-15 | Paper |
An adversarial model for scheduling with testing
Algorithmica | 2020-11-11 | Paper |
A general framework for handling commitment in online throughput maximization
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
| Correction to: approximation and online algorithms | 2020-08-24 | Paper |
On index policies for stochastic minsum scheduling
Operations Research Letters | 2020-02-10 | Paper |
A general framework for handling commitment in online throughput maximization
Integer Programming and Combinatorial Optimization | 2020-02-06 | Paper |
A new approach to online scheduling: approximating the optimal competitive ratio
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
An \(\mathcal O(\log m)\)-competitive algorithm for online machine minimization
SIAM Journal on Computing | 2018-12-05 | Paper |
Scheduling maintenance jobs in networks
Theoretical Computer Science | 2018-12-04 | Paper |
A new approach to online scheduling: approximating the optimal competitive ratio
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Minimum spanning tree under explorable uncertainty in theory and experiments | 2018-08-13 | Paper |
Dual techniques for scheduling on a machine with varying speed
SIAM Journal on Discrete Mathematics | 2018-07-18 | Paper |
An \(\mathcal{O}(\log m)\)-competitive algorithm for online machine minimization
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Stochastic and robust scheduling in the cloud | 2017-08-31 | Paper |
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
SIAM Journal on Computing | 2017-07-21 | Paper |
Scheduling maintenance jobs in networks
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Packing a knapsack of unknown capacity
SIAM Journal on Discrete Mathematics | 2017-07-14 | Paper |
Scheduling Real-Time Mixed-Criticality Jobs
IEEE Transactions on Computers | 2017-07-12 | Paper |
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints (extended abstract)
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Packing a knapsack of unknown capacity
(available as arXiv preprint) | 2017-03-03 | Paper |
The power of recourse for online MST and TSP
SIAM Journal on Computing | 2016-07-04 | Paper |
Randomization helps computing a minimum spanning tree under uncertainty
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Optimal algorithms and a PTAS for cost-aware scheduling
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
A tight 2-approximation for preemptive stochastic scheduling
Mathematics of Operations Research | 2015-04-24 | Paper |
Clique partitioning with value-monotone submodular cost
Discrete Optimization | 2015-04-09 | Paper |
Algorithms and complexity for periodic real-time scheduling
ACM Transactions on Algorithms | 2014-12-05 | Paper |
| Algorithms and complexity for periodic real-time scheduling | 2014-05-22 | Paper |
Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
Journal of Combinatorial Optimization | 2014-02-25 | Paper |
On Eulerian extensions and their application to no-wait flowshop scheduling
Journal of Scheduling | 2014-02-05 | Paper |
The power of recourse for online MST and TSP
Automata, Languages, and Programming | 2013-08-12 | Paper |
Dual techniques for scheduling on a machine with varying speed
Automata, Languages, and Programming | 2013-08-06 | Paper |
Online graph exploration: New results on old and new algorithms
Theoretical Computer Science | 2013-01-07 | Paper |
Universal sequencing on an unreliable machine
SIAM Journal on Computing | 2012-09-12 | Paper |
Decision support and optimization in shutdown and turnaround scheduling
INFORMS Journal on Computing | 2012-07-28 | Paper |
A note on sorting buffers offline
Theoretical Computer Science | 2012-05-14 | Paper |
Online Graph Exploration: New Results on Old and New Algorithms
Automata, Languages and Programming | 2011-07-07 | Paper |
Coping with Incomplete Information in Scheduling — Stochastic and Online Models
Operations Research Proceedings | 2011-04-07 | Paper |
Scheduling real-time mixed-criticality jobs
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Universal sequencing on a single machine
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
Approximation and Online Algorithms | 2010-05-11 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Models and Algorithms for Stochastic Online Scheduling
Mathematics of Operations Research | 2008-05-27 | Paper |
Optimizing the landside operation of a container terminal
OR Spectrum | 2008-04-03 | Paper |
Approximation in Preemptive Stochastic Online Scheduling
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
How to whack moles
Theoretical Computer Science | 2006-09-14 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
On-line scheduling to minimize average completion time revisited.
Operations Research Letters | 2005-01-11 | Paper |
