| Publication | Date of Publication | Type |
|---|
Min-max relative regret for scheduling to minimize maximum lateness
Annals of Operations Research | 2025-08-09 | Paper |
| Non-clairvoyant makespan minimization scheduling with predictions | 2025-07-24 | Paper |
Min-max relative regret for scheduling to minimize maximum lateness
Lecture Notes in Computer Science | 2023-12-22 | Paper |
| scientific article; zbMATH DE number 7650321 (Why is no real title available?) | 2023-02-03 | Paper |
| Two-Agent Scheduling with Resource Augmentation on Multiple Machines | 2022-12-09 | Paper |
Scheduling on hybrid platforms: improved approximability window
(available as arXiv preprint) | 2022-10-13 | Paper |
Exact algorithms for scheduling programs with shared tasks
Journal of Combinatorial Optimization | 2022-07-18 | Paper |
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
(available as arXiv preprint) | 2021-08-04 | Paper |
Generic algorithms for scheduling applications on hybrid multi-core machines
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Generic algorithms for scheduling applications on hybrid multi-core machines
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems
Algorithmica | 2019-08-20 | Paper |
Energy-efficient scheduling and routing via randomized rounding
Journal of Scheduling | 2018-11-07 | Paper |
| Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality | 2018-03-02 | Paper |
Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
European Journal of Operational Research | 2017-12-06 | Paper |
Scheduling on power-heterogeneous processors
Information and Computation | 2017-11-16 | Paper |
Energy efficient scheduling and routing via randomized rounding
(available as arXiv preprint) | 2017-02-21 | Paper |
From preemptive to non-preemptive scheduling using rejections
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Scheduling on power-heterogeneous processors
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow time problems
Lecture Notes in Computer Science | 2015-11-19 | Paper |
Speed-scaling with no preemptions
Algorithms and Computation | 2015-09-11 | Paper |
Green scheduling, flows and matchings
Theoretical Computer Science | 2015-05-18 | Paper |
From preemptive to non-preemptive speed-scaling scheduling
Discrete Applied Mathematics | 2014-12-05 | Paper |
On multiprocessor temperature-aware scheduling problems
Journal of Scheduling | 2014-08-18 | Paper |
Bounded max-colorings of graphs
Journal of Discrete Algorithms | 2014-04-28 | Paper |
From preemptive to non-preemptive speed-scaling scheduling
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract)
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Improved approximation algorithms for the max edge-coloring problem
Information Processing Letters | 2013-04-04 | Paper |
Green scheduling, flows and matchings
Algorithms and Computation | 2013-03-21 | Paper |
Online maximum \(k\)-coverage
Discrete Applied Mathematics | 2012-08-10 | Paper |
On multiprocessor temperature-aware scheduling problems
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
The \textsc{max quasi-independent set} problem
Journal of Combinatorial Optimization | 2012-07-10 | Paper |
Online maximum \(k\)-coverage
Fundamentals of Computation Theory | 2011-08-19 | Paper |
Improved approximation algorithms for the max-edge coloring problem
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
On the max-weight edge coloring problem
Journal of Combinatorial Optimization | 2010-12-21 | Paper |
Bounded Max-colorings of Graphs
Algorithms and Computation | 2010-12-09 | Paper |
Approximating the max-edge-coloring problem
Theoretical Computer Science | 2010-08-11 | Paper |
The max quasi-independent set Problem
Computer Science – Theory and Applications | 2010-06-22 | Paper |
Approximating the max edge-coloring problem
Lecture Notes in Computer Science | 2009-12-11 | Paper |
On the Maximum Edge Coloring Problem
Approximation and Online Algorithms | 2009-02-12 | Paper |
