Giorgio Lucarelli

Orcid: 0000-0001-7368-355X

Affiliations:
  • University Grenoble-Alpes, LIG, Grenoble, France
  • Université de Lorraine, LCOMS, Metz, France


According to our database1, Giorgio Lucarelli authored at least 54 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness.
Proceedings of the Combinatorial Algorithms - 34th International Workshop, 2023

Non-Clairvoyant Makespan Minimization Scheduling with Predictions.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
Exact algorithms for scheduling programs with shared tasks.
J. Comb. Optim., 2022

Scheduling with Untrusted Predictions.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Two-Agent Scheduling with Resource Augmentation on Multiple Machines.
Proceedings of the Euro-Par 2022: Parallel Processing, 2022

2021
Online Non-preemptive Scheduling on Unrelated Machines with Rejections.
ACM Trans. Parallel Comput., 2021

Scheduling on Two Types of Resources: A Survey.
ACM Comput. Surv., 2021

Speed Scaling with Explorable Uncertainty.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

On the Tardiness Minimization on Single Machine.
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2021

2020
A deep Q-learning portfolio management framework for the cryptocurrency market.
Neural Comput. Appl., 2020

Scheduling on Hybrid Platforms: Improved Approximability Window.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

Online Scheduling with Redirection for Parallel Jobs.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium Workshops, 2020

Scheduling Malleable Jobs Under Topological Constraints.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

2019
Generic algorithms for scheduling applications on heterogeneous platforms.
Concurr. Comput. Pract. Exp., 2019

Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems.
Algorithmica, 2019

A Deep Reinforcement Learning Approach for Automated Cryptocurrency Trading.
Proceedings of the Artificial Intelligence Applications and Innovations, 2019

Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018
Cost and Availability Aware Resource Allocation and Virtual Function Placement for CDNaaS Provision.
IEEE Trans. Netw. Serv. Manag., 2018

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

Scheduling under Uncertainty: A Query-based Approach.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

A Methodology for Handling Data Movements by Anticipation: Position Paper.
Proceedings of the Euro-Par 2018: Parallel Processing Workshops, 2018

Interference-Aware Scheduling Using Geometric Constraints.
Proceedings of the Euro-Par 2018: Parallel Processing, 2018

Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

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

Exact and superpolynomial approximation algorithms for the densest k-subgraph problem.
Eur. J. Oper. Res., 2017

Generic algorithms for scheduling applications on heterogeneous multi-core platforms.
CoRR, 2017

Balancing between Cost and Availability for CDNaaS Resource Placement.
Proceedings of the 2017 IEEE Global Communications Conference, 2017

Generic Algorithms for Scheduling Applications on Hybrid Multi-core Machines.
Proceedings of the Euro-Par 2017: Parallel Processing - 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28, 2017

A new on-line method for scheduling independent tasks.
Proceedings of the 17th IEEE/ACM International Symposium on Cluster, 2017

2016
Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

From Preemptive to Non-preemptive Scheduling Using Rejections.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

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

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

Contiguity and Locality in Backfilling Scheduling.
Proceedings of the 15th IEEE/ACM International Symposium on Cluster, 2015

2014
Spectrum Assignment in Optical Networks: A Multiprocessor Scheduling Perspective.
JOCN, 2014

Bounded max-colorings of graphs.
J. Discrete Algorithms, 2014

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

The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective.
Proceedings of the 18th International Conference on Optical Network Design and Modeling, 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
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

Exact and Approximation Algorithms for Densest <i>k</i>-Subgraph.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012
The max quasi-independent set problem.
J. Comb. Optim., 2012

Online maximum k-coverage.
Discret. Appl. Math., 2012

Improved Approximation Algorithms for the Non-preemptive Speed-scaling Problem
CoRR, 2012

2011
Improved approximation algorithms for the Max Edge-Coloring problem.
Inf. Process. Lett., 2011

2010
Approximating the max-edge-coloring problem.
Theor. Comput. Sci., 2010

On the max-weight edge coloring problem.
J. Comb. Optim., 2010

2009
Scheduling in computer and communication systems and generalized graph coloring problems
PhD thesis, 2009

Max Edge Coloring of Trees
CoRR, 2009

2008
On the Maximum Edge Coloring Problem.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

2007
Named Entity Recognition in Greek Texts with an Ensemble of SVMs and Active Learning.
Int. J. Artif. Intell. Tools, 2007

2006
A Greek Named-Entity Recognizer That Uses Support Vector Machines and Active Learning.
Proceedings of the Advances in Artificial Intelligence, 4th Helenic Conference on AI, 2006


  Loading...