Dimitrios Letsios

Orcid: 0000-0002-3258-7585

According to our database1, Dimitrios Letsios authored at least 33 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
New Bounds for Time-Dependent Scheduling with Uniform Deterioration.
CoRR, 2023

Algorithms for Shipping Container Delivery Scheduling.
CoRR, 2023

2022
Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW).
Algorithmica, 2022

2021
Approximate and robust bounded job start scheduling for Royal Mail delivery offices.
J. Sched., 2021

Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded.
INFORMS J. Comput., 2021

Exact lexicographic scheduling and approximate rescheduling.
Eur. J. Oper. Res., 2021

Schedule Explainer: An Argumentation-Supported Tool for Interactive Explanations in Makespan Scheduling.
Proceedings of the Explainable and Transparent AI and Multi-Agent Systems, 2021

2020
Approximation algorithms for process systems engineering.
Comput. Chem. Eng., 2020

AI-assisted Schedule Explainer for Nurse Rostering.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Speed scaling on parallel processors with migration.
J. Comb. Optim., 2019

Approximating Bounded Job Start Scheduling with Application in Royal Mail Deliveries under Uncertainty.
CoRR, 2019

Approximating Bounded Job Start Scheduling with Application in Royal Mail Deliveries Under Uncertainty.
Proceedings of the Combinatorial Optimization and Applications, 2019

Argumentation for Explainable Scheduling.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Energy-efficient scheduling and routing via randomized rounding.
J. Sched., 2018

Argumentation for Explainable Scheduling (Full Paper with Proofs).
CoRR, 2018

Exact Lexicographic Scheduling and Approximate Rescheduling.
CoRR, 2018

Optimization with Gradient-Boosted Trees and Risk Control.
CoRR, 2018

Reprint of: Heuristics with performance guarantees for the minimum number of matches problem in heat recovery network design.
Comput. Chem. Eng., 2018

Heuristics with performance guarantees for the minimum number of matches problem in heat recovery network design.
Comput. Chem. Eng., 2018

2017
Scheduling on power-heterogeneous processors.
Inf. Comput., 2017

2016
Throughput maximization for speed scaling with agreeable deadlines.
J. Sched., 2016

Speed Scaling for Maximum Lateness.
Theory Comput. Syst., 2016

Bin Packing with Colocations.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015
Green scheduling, flows and matchings.
Theor. Comput. Sci., 2015

From preemptive to non-preemptive speed-scaling scheduling.
Discret. Appl. Math., 2015

2014
A note on multiprocessor speed scaling with precedence constraints.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Speed-Scaling with No Preemptions.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Energy Efficient Scheduling of MapReduce Jobs.
Proceedings of the Euro-Par 2014 Parallel Processing, 2014

2013
Scheduling algorithms for energy and thermal management in computer systems. (Politiques de gestion d'Énergie et de Température dans les Systèmes Informatiques).
PhD thesis, 2013

Optimal energy trade-off schedules.
Sustain. Comput. Informatics Syst., 2013

On multiprocessor temperature-aware scheduling problems.
J. Sched., 2013

Energy Minimization via a Primal-Dual Algorithm for a Convex Program.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

2012
Optimal energy trade-off schedules.
Proceedings of the 2012 International Green Computing Conference, 2012


  Loading...