| Publication | Date of Publication | Type |
|---|
| A novel prediction setup for online speed-scaling | 2024-05-27 | Paper |
| On the approximability of the traveling salesman problem with line neighborhoods | 2024-05-27 | Paper |
scientific article; zbMATH DE number 7788624 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Relating Electric Vehicle Charging to Speed Scaling with Job-Specific Speed Limits | 2023-09-12 | Paper |
Secretary and online matching problems with machine learned advice
Discrete Optimization | 2023-06-30 | Paper |
Online search for a hyperplane in high-dimensional Euclidean space
Information Processing Letters | 2022-06-03 | Paper |
| On the complexity of anchored rectangle packing | 2022-05-11 | Paper |
On minimum generalized Manhattan connections
(available as arXiv preprint) | 2022-03-25 | Paper |
Parallel Machine Scheduling to Minimize Energy Consumption
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
| Approximating airports and railways | 2020-08-05 | Paper |
| scientific article; zbMATH DE number 7204483 (Why is no real title available?) | 2020-05-27 | Paper |
A collection of lower bounds for online matching on the line
(available as arXiv preprint) | 2020-02-12 | Paper |
Hallucination helps: energy efficient virtual circuit routing
SIAM Journal on Computing | 2020-01-21 | Paper |
A fully polynomial-time approximation scheme for speed scaling with a sleep state
Algorithmica | 2019-08-20 | Paper |
Hallucination helps: energy efficient virtual circuit routing
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
A \(o(n)\)-competitive deterministic algorithm for online matching on a line
Algorithmica | 2019-05-21 | Paper |
| Race to idle: new algorithms for speed scaling with a sleep state | 2019-05-10 | Paper |
| A near optimal mechanism for energy aware scheduling | 2018-11-08 | Paper |
| A tight lower bound for online convex optimization with switching costs | 2018-06-22 | Paper |
| Airports and railways: facility location meets network design | 2018-01-24 | Paper |
Efficient computation of optimal energy and fractional weighted flow trade-off schedules
Algorithmica | 2017-10-10 | Paper |
A fully polynomial-time approximation scheme for speed scaling with sleep state
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Energy-efficient circuit design
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Continuous speed scaling with variability: a simple and direct approach
Theoretical Computer Science | 2017-05-15 | Paper |
| Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules | 2017-03-03 | Paper |
WENO schemes on arbitrary unstructured meshes for laminar, transitional and turbulent flows
Journal of Computational Physics | 2016-12-05 | Paper |
Chasing convex bodies and functions
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
A \(o(n)\)-competitive deterministic algorithm for online matching on a line
Approximation and Online Algorithms | 2015-11-20 | Paper |
Race to idle: new algorithms for speed scaling with a sleep state
ACM Transactions on Algorithms | 2015-08-14 | Paper |
On multi-processor speed scaling with migration
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Non-preemptive speed scaling
Journal of Scheduling | 2014-08-18 | Paper |
How to pack your items when you have to buy your knapsack
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Non-preemptive Speed Scaling
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
| Balanced interval coloring | 2012-01-23 | Paper |
Balanced interval coloring
(available as arXiv preprint) | 2012-01-23 | Paper |
Approximability of Edge Matching Puzzles
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
