Curriculum Vitae
Giorgio Lucarelli
Teaching and Research Associate
ENSIMAG, Grenoble INP
LIG, INRIA (Datamove)
Personal details
- Born in
Athens, Greece
- Nationality: Italian
- Contact:
Bâtiment IMAG, 700 avenue Centrale, Domaine Universitaire
38401 St Martin d’Hères, France
Office: 426
E-mail: glucarelli@gmail.com, giorgio.lucarelli@inria.fr
Web: http://moais.imag.fr/membres/giorgio.lucarelli/
Education
• Ph.D. in Computer Science
October 2005 – October 2009
Institute:
Athens University of Economics and Business
Title:
Scheduling in computer and communication systems and generalized graph coloring problems
Advisor:
Ioannis Milis
Committee: E. Koutsoupias, E. Magirou, V. Th. Paschos, M. Sideri, S. Zachos, V. Zissimopoulos
funded by: Greek General Secretariat for Research and Technology - PENED program
• M.Sc. in Computer Science
September 2003 – July 2005
Institute:
Athens University of Economics and Business
Distinctions: Performance scholarships for both semesters of the program
Thesis title: Named entity recognition and categorization in Greek texts (in Greek)
Supervisor: Ion Androutsopoulos
• B.Sc. in Informatics (4-years)
Institute:
Athens University of Economics and Business
September 1999 – September 2003
Research interests
• Algorithms and complexity, approximation and online algorithms, energy-aware scheduling, graph algorithms, exact and parameterized algorithms.
Summary of publications
International journals
International conferences
Book chapters
International conferences (abstract)
National conferences with proceedings
National conferences (abstract)
16 (DAM, TCS, EJOR, J. of Scheduling, IPL, etc)
29 (ESA, SPAA, IJCAI, FSTTCS, COCOON, ISAAC, etc)
1
6
1
6
1
Professional positions
• Teaching and Research Associate
LIG, ENSIMAG, Grenoble INP, France
September 2017 – today
• Research Associate
INRIA Grenoble-Rhône Alpes, group DataMove, France
September 2016 – August 2017
• Post-doc researcher
September 2014 – August 2016
LIG, University of Grenoble-Alpes, INP, France
funded by ANR-Moebus: “Multi-objective scheduling for large computing platforms”
• Post-doc researcher
September 2013 – August 2014
LIP6, University Pierre et Marie Curie, France
funded by ANR-NeTOC: “New Techniques in Online Computation”
• Post-doc researcher
September 2011 – August 2013
LIP6, University Pierre et Marie Curie, France
funded by ANR-TODO: “Time vs. Optimality in Discrete Optimization”
• Post-doc researcher
January 2010 – July 2011
LAMSADE, University Paris-Dauphine, France
funded by ANR-TODO: “Time vs. Optimality in Discrete Optimization”
• System administrator
September 2005 – June 2009
“Laboratory for the Postgraduate Programs” of Department of Informatics
Athens University of Economics and Business, Greece
• I.T. consulting
Information Society S.A., Greece
February 2005 - December 2005
• Application development
March 2004 - October 2004
Analysis, design and implementation of the Web-based application “e-Secretariat”
Department of Informatics, Athens University of Economics and Business, Greece
(in use from September 2004 to December 2009)
Teaching
• M.Sc. in Informatics at Grenoble, University Grenoble Alpes, Grenoble INP, France (teaching in English)
– Spring 2017-18: Fundamental Computer Science (teaching & exercises, 30 hours)
• ENSIMAG, Grenoble INP, France (teaching in French)
–
–
–
–
–
–
–
Spring 2017-18: Introduction to communication networks (programming exercises, 15 hours)
Spring 2017-18: Algorithms and data structures (teaching & exercises, 36 hours)
Fall 2017-18: Introduction to UNIX and Shell programming (programming exercises, 27 hours)
Fall 2017-18: Introduction to imperative programming with Python (programming exercises, 51 hours)
Fall 2017-18: Operating systems and parallel programming (exercises, 16.5 hours)
Spring 2016-17: Algorithms and data structures (exercises, 25.5 hours)
Spring 2015-16: Algorithms and data structures (exercises, 33 hours)
2
– Spring 2014-15: Algorithms and data structures (teaching & exercises, 33 hours)
• M.Sc. ROCO, Grenoble INP & University Joseph Fourier, France (teaching in French)
– Fall 2014-15: Conventional and non-conventional computing models, approximation and heuristics
(co-teaching with V.-D. Cung, J.-L. Roch and D. Trystram, 12 hours)
• Department of Informatics, University of Evry Val d’Essonne, France (teaching in French)
– Fall 2013-14: Algorithms (exercises, 19.5 hours)
– Spring 2012-13: Graph algorithms (exercises, 19.5 hours)
– Fall 2012-13: Algorithms and Programming in C (programming exercises, 20 hours)
• Department of Informatics, Athens University of Economics and Business, Greece (teaching
in Greek )
– Spring 2007-08 and 2008-09: Topics in Algorithms (exercises, 26 hours per year)
– Fall 2007-08 and 2008-09: Logic (exercises and programming in Prolog, 26 hours per year)
– Spring 2005-06 and 2006-07: Automata and Complexity (exercises, 26 hours per year)
Participation in the preparation of the educational book “Automata and Complexity (Exercises)”,
Editions of Athens University of Economics and Business, 2007
– Fall 2005-06 and 2006-07: Computer Programming in C++ (programming exercises, 26 hours per year)
Students supervision
PhD students
• Clément Mommessin (co-supervision with: D. Trystram), 2017 –
MSc students
• Konstantinos Dogeas, “Scheduling with allocation and I/O constraints on tree-interconnect machines”,
Spring 2018, M.Sc. Thesis, M.Sc. ROCO, Grenoble INP & University Grenoble Alpes, France, (cosupervision with: D. Trystram)
• Manthos Letsios, “Fault-tolerant scheduling to minimize the energy consumption in distributed environments”, Spring 2017, M.Sc. Thesis, M.Sc. ANDROIDE, University Pierre et Marie Curie, France (cosupervision with: L. Arantes, E. Bampis and P. Sens)
• Konstantinos Dogeas, “Interference-Aware Scheduling”, Spring 2017, Erasmus Stage, Grenoble INP (cosupervision with: D. Trystram)
• Clément Mommessin, “Scheduling on heterogeneous platforms”, Spring 2016, M.Sc. Thesis, M.Sc. MoSIG,
Grenoble INP & University Joseph Fourier, France, (co-supervision with: D. Trystram)
• Marwan Ajem, “Scheduling in the clouds”, Spring 2016, M.Sc. Thesis, M.Sc. ANDROIDE, University
Pierre et Marie Curie, France (co-supervision with: L. Arantes and E. Bampis)
• Clément Mommessin, “Scheduling on heterogeneous resources”, Spring 2015, research project (stage Master 1), M.Sc. MoSIG, Grenoble INP & University Joseph Fourier, France (co-supervision with: D.
Trystram)
• Lynda Khiri and Tahiana Rakotondrainibe, “Primal-dual algorithms for energy minimization problems in
computer systems”, Spring 2013, research project, M.Sc. IAD, University Pierre et Marie Curie, France
(co-supervision with: E. Bampis)
• Ioannis Nemparis, “Scheduling strategies to minimize energy in computing systems”, Spring 2012, research
project, M.Sc. IAD, University Pierre et Marie Curie, France (co-supervision with: E. Bampis)
3
Other professional activities
• Program committees
– 15th International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms (HeteroPar 2017), August 28-29, 2017, Santiago de Compostela, Spain; satellite
workshop of EuroPar 2017
– 23rd International European Conference on Parallel and Distributed Computing (Euro-Par 2017),
Topic 6: Cluster and Cloud Computing, August 28 - September 1, 2017, Santiago de Compostela,
Spain
– 46th International Conference on Parallel Processing (ICPP 2017), Topic: Algorithms, August 14-17,
2017, Bristol, UK
– 14th International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Platforms (HeteroPar 2016), August 23, 2016, Grenoble, France; satellite workshop of EuroPar
2016
– 21st International European Conference on Parallel and Distributed Computing (Euro-Par 2015),
Topic 3: Scheduling and Load Balancing, August 24-28, 2015, Vienna, Austria
– 14th International Symposium on Experimental Algorithms (SEA 2015), June 29 - July 1, 2015, Paris,
France
– 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID 2015),
Topic: Scheduling and Resource Management, May 4-7, 2015, Shenzhen, Guangdong, China
– 12th Workshop on Approximation and Online Algorithms (WAOA 2014), September 11-12, 2014,
Wroclaw, Poland
• Organizing committees
– 13th Workshop on “New Challenges in Scheduling Theory”, April 3-7, 2018, Aussois, France
– 12th Workshop on “New Challenges in Scheduling Theory”, March 29 - April 2, 2016, Aussois, France
– 14th International Symposium on Experimental Algorithms (SEA 2015), June 29 - July 1, 2015, Paris,
France
– 2nd International Workshop on Approximation, Parameterized and EXact algorithms (APEX 2013),
July 7, 2013, Riga, Latvia; satellite workshop of ICALP 2013
– 1st International Workshop on Approximation, Parameterized and EXact algorithms (APEX 2012),
February 28-29, 2012, Paris, France; co-located with STACS 2012
– 2nd International Symposium on Combinatorial Optimization (ISCO 2012), April 17-21, 2012, Athens,
Greece
– 4th Athens Colloquium on Algorithms and Complexity (ACAC 2009), August 20-21, 2009, Athens,
Greece
• Participation in research projects
– Gestionnaire de ressources pour clouds d’objets (Greco)
2017-2020
French National Research Agency (ANR)
Participants: Inria Rennes, LIG, Qarnot Computing
– Cooperation on Hybrid cOmputing clOuds for energy SavING (CHOOSING)
2015–2016
French Committee for the Evaluation of Academic and Scientific Cooperation with Brazil (COFECUB)
Collaboration between France (LIG, LIP6, LRI, SUPELEC) and Brazil (USP, UNICAMP)
– Mathematical Programming based Algorithms in Non-linear Combinatorial Optimization 2013–2014
Gaspard Monge Program for Optimization and operations research (PGMO)
Participants: IBISC, LIP6
4
– Réoptimisation (REOPT)
2013–2014
GDR-RO, France
Participants: IBISC, LAMSADE, LIMOS, LIP6
– Problèmes structurels et algébriques en théorie des graphes
2013–2015
MATH-AmSud, France, South America
Collaboration between France, Argentina, Brazil and Chile
– Algorithms of today (THALES-ALGONOW):
2012–2015
Social networks, data streaming, resource allocation and power management in
communication and computing systems
European Social Fund and Greek national resources, Greece
Participants: AUEB, NKUA, UoA
– Weighted graph coloring problems and applications
2008
Basic Research Funding Program (BRFP) of Athens University of Economics and Business, Greece
• Refereeing
– International Journals: ACM Transactions on Parallel Computing, Algorithmica, Annals of Operations Research, Computers & Industrial Engineering, Concurrency and Computation: Practice and
Experience, Discrete Applied Mathematics, Discrete Mathematics, IEEE Transactions on Parallel and
Distributed Systems, Journal of Experimental Algorithmics, Journal of Global Optimization, Journal
of Scheduling, Operational Research: An International Journal, Operations Research Letters, Parallel
Computing, Parallel Processing Letters, RAIRO.RO, Theoretical Computer Science, 40R
– International Conferences: International Conference on Algorithms and Complexity (CIAC), International Computing & Combinatorics Conference (COCOON), European Symposium on Algorithms
(ESA), International European Conference on Parallel Processing (Euro-Par), European Conference on
Combinatorics, Graph Theory and Applications (EUROCOMB), IEEE International Parallel & Distributed Processing Symposium (IPDPS), International Symposium on Combinatorial Optimization
(ISCO), Latin American Theoretical Informatics (LATIN), International Symposium on Mathematical
Foundations of Computer Science (MFCS), Symposium on Experimental Algorithms (SEA), Symposium on Theoretical Aspects of Computer Science (STACS), Scandinavian Symposium and Workshops
on Algorithm Theory (SWAT), Algorithms and Data Structures Symposium (WADS), Workshop on
Approximation and Online Algorithms (WAOA)
References
• Giorgio Ausiello, Professor Emeritus, Dipartimento di Informatica e Sistemistica, Università di Roma
“La Sapienza”, Rome, Italy
E-mail: ausiello@dis.uniroma1.it
Web: http://www.dis.uniroma1.it/~ausiello/
• Evripidis Bampis, Professor, LIP6, Université Pierre et Marie Curie, Paris, France
E-mail: Evripidis.Bampis@lip6.fr
Web: http://www-poleia.lip6.fr/~bampise/
• Vangelis Th. Paschos, Professor, LAMSADE, Université Paris-Dauphine, Paris, France
E-mail: paschos@lamsade.dauphine.fr
Web: http://www.lamsade.dauphine.fr/~paschos/
• George Rouskas, Professor, Department of Computer Science, North Carolina State University, USA
E-mail: rouskas@ncsu.edu
Web: http://rouskas.csc.ncsu.edu/
5
• Maxim Sviridenko, Principal Research Scientist, Yahoo! Labs, New York, USA
E-mail: sviri@yahoo-inc.com
Web: http://labs.yahoo.com/author/sviri/
• Denis Trystram, Professor, LIG, Université Grenoble-Alpes – INP, Grenoble, France
E-mail: trystram@imag.fr
Web: http://moais.imag.fr/membres/denis.trystram/
Publications
Book chapter
B1. M. Demange, B. Escoffier, G. Lucarelli, I. Milis, J. Monnot, V. Th. Paschos, and D. de Werra. Weighted
edge coloring, chapter 11, pages 291–317. Combinatorial Optimization and Theoretical Computer Science:
Interfaces and Perspectives. Wiley-ISTE, 2008.
Journals
J16. M. Amarı́s, G. Lucarelli, C. Mommessin, and D. Trystram. Generic algorithms for scheduling applications
on heterogeneous platforms. Concurrency and Computation: Practice and Experience, accepted.
J15. S. Albers, E. Bampis, D. Letsios, G. Lucarelli, and R. Stotz. Scheduling on power-heterogeneous processors.
Information and Computation, 257:22–33, 2017.
J14. N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, and V. Th. Paschos. Exact and superpolynomial
approximation algorithms for the densest k-subgraph problem. European Journal of Operational Research,
262:894–903, 2017.
J13. E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, and M. Sviridenko. Energy efficient scheduling and
routing via randomized rounding. Journal of Scheduling, 21:35–51, 2018.
J12. E. Bampis, D. Letsios, and G. Lucarelli. Green scheduling, flows and matchings. Theoretical Computer
Science, 579:126–136, 2015.
J11. S. Talebi, E. Bampis, G. Lucarelli, I. Katib, and G. N. Rouskas. On routing and spectrum assignment in
rings. IEEE/OSA Journal of Lightwave Technology, 33(1):151-160, 2015.
J10. E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, and I. Nemparis. From preemptive to non-preemptive
speed-scaling scheduling. Discrete Applied Mathematics, 181:11–20, 2015.
J9. S. Talebi, E. Bampis, G. Lucarelli, I. Katib, and G. N. Rouskas. Spectrum assignment in optical networks:
A multiprocessor scheduling perspective. IEEE/OSA Journal of Optical Communications and Networking,
6:754–763, 2014.
J8. E. Bampis, A. Kononov, G. Lucarelli, and I. Milis. Bounded max-colorings of graphs. Journal of Discrete
Algorithms, 26:56–68, 2014.
J7. E. Bampis, D. Letsios, G. Lucarelli, E. Markakis, and I. Milis. On multiprocessor temperature-aware
scheduling problems. Journal of Scheduling, 16:529–538, 2013.
J6. N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V. Th. Paschos, and O. Pottié. The max quasiindependent set problem. Journal of Combinatorial Optimization, 23:94–117, 2012.
6
J5. G. Ausiello, N. Boria, A. Giannakos, G. Lucarelli, and V. Th. Paschos. Online maximum k-coverage.
Discrete Applied Mathematics, 160:1901–1913, 2012.
J4. G. Lucarelli and I. Milis. Improved approximation algorithms for the max-edge coloring problem. Information Processing Letters, 111:819–823, 2011.
J3. N. Bourgeois, G. Lucarelli, I. Milis, and V. Th. Paschos. Approximating the max-edge-coloring problem.
Theoretical Computer Science, 411:3055–3067, 2010.
J2. G. Lucarelli, I. Milis, and V. Th. Paschos. On the max-weight edge coloring problem. Journal of Combiatorial Optimization, 20:429–442, 2010.
J1. G. Lucarelli, X. Vasilakos, and I. Androutsopoulos. Named entity recognition in Greek texts with an
ensemble of SVMs and active learning. International Journal on Artificial Intelligence Tools, 16:1015–
1045, 2007.
International conferences
C29. G. Lucarelli, B. Moseley, K. Th. Nguyen, A. Srivastav, and D. Trystram. Online non-preemptive scheduling to minimize weighted flow-time on unrelated machines. In 26th Annual European Symposium on
Algorithms (ESA 2018), accepted.
C28. R. Bleuse, K. Dogeas, G. Lucarelli, G. Mounié, and D. Trystram. Interference-aware scheduling using
geometric constraints. In 24th International European Conference on Parallel and Distributed Computing
(Euro-Par 2018), accepted.
C27. G. Lucarelli, B. Moseley, K. Th. Nguyen, A. Srivastav, and D. Trystram. Online non-preemptive scheduling on unrelated machines with rejections. In 30th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA 2018), accepted.
C26. L. Arantes, E. Bampis, A. Kononov, M. Letsios, G. Lucarelli, and P. Sens. Scheduling under uncertainty:
A query-based approach. In 27th International Joint Conference on Artificial Intelligence (IJCAI 2018),
accepted.
C25. L. Yala, P. Frangoudis, G. Lucarelli, and A. Ksentini. Balancing between cost and availability for CDNaaS
resource placement. In IEEE Global Communications Conference (GLOBECOM 2017), IEEE, 2017.
C24. M. Amarı́s, G. Lucarelli, C. Mommessin, and D. Trystram. Generic algorithms for scheduling applications
on hybrid multi-core machines. In 23rd International European Conference on Parallel and Distributed
Computing (Euro-Par 2017), volume 10417 of LNCS, pages 220–231. Springer, 2017.
C23. G. Lucarelli, F. Mendonca, and D. Trystram. A new on-line method for scheduling independent tasks.
In 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID 2017),
pages 140–149. IEEE, 2017.
C22. G. Lucarelli, K. Th. Nguyen, A. Srivastav, and D. Trystram. Online non-preemptive scheduling in a
resource augmentation model based on duality. In 24th European Symposium on Algorithms (ESA 2016),
volume 57 of LIPIcs, pages 63:1-17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016.
C21. G. Lucarelli, A. Srivastav, and D. Trystram. From preemptive to non-preemptive scheduling using rejections. In 22nd International Computing and Combinatorics Conference (COCOON 2016), volume 9797
of LNCS, pages 510–519. Springer, 2016.
7
C20. S. Albers, E. Bampis, D. Letsios, G. Lucarelli, and R. Stotz. Scheduling on power-heterogeneous processors. In 12th Latin American Theoretical Informatics Symposium (LATIN 2016), volume 9644 of LNCS,
pages 41–54. Springer, 2016.
C19. S. Angelopoulos, G. Lucarelli, and K. Th. Nguyen. Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow time problems. In 23rd European Symposium on Algorithms (ESA
2015), volume 9294 of LNCS, pages 35–46. Springer, 2015.
C18. G. Lucarelli, F. Mendonca, D. Trystram, and F. Wagner. Contiguity and locality in backfilling scheduling.
In 15th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID 2015),
pages 586–595. IEEE, 2015.
C17. E. Bampis, D. Letsios, and G. Lucarelli. Speed-scaling with no preemptions. In 25th International Symposium on Algorithms and Computation (ISAAC 2014), volume 8889 of LNCS, pages 259–269. Springer,
2014.
C16. E. Bampis, V. Chau, D. Letsios, G. Lucarelli, I. Milis, and G. Zois. Energy efficient scheduling of
MapReduce jobs. In 20th International European Conference on Parallel Processing (Euro-Par 2014),
volume 8632 of LNCS, pages 198–209. Springer, 2014.
C15. E. Bampis, D. Letsios, and G. Lucarelli. A note on multiprocessor speed scaling with precedence constraints. In 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2014), pages
138–142. ACM, 2014.
C14. S. Talebi, E. Bampis, G. Lucarelli, I. Katib, and G. N. Rouskas. The spectrum assigment (SA) problem in
optical networks: A multiprocesor scheduling perspective. In 18th Conference on Optical Network Design
and Modeling (ONDM 2014), pages 55–60. IEEE, 2014.
C13. E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, and M. Sviridenko. Energy efficient scheduling and
routing via randomized rounding. In 33rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), volume 24 of LIPIcs, pages 449–460. Schloss
Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013.
C12. E. Bampis, V. Chau, D. Letsios, G. Lucarelli, and I. Milis. Energy minimization via a primal-dual
algorithm for a convex program. In 12th International Symposium on Experimental Algorithms (SEA
2013), volume 7933 of LNCS, pages 366–377. Springer, 2013.
C11. E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, and I. Nemparis. From preemptive to non-preemptive
speed-scaling scheduling. In 19th International Computing and Combinatorics Conference (COCOON
2013), volume 7936 of LNCS, pages 134–146. Springer, 2013.
C10. N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, and V. Th. Paschos. Exact and approximation algorithms for densest k-subgraph. In 7th International Workshop on Algorithms and Computation (WALCOM 2013), volume 7748 of LNCS, pages 114–125. Springer, 2013.
C9. E. Bampis, D. Letsios, and G. Lucarelli. Green scheduling, flows and matchings. In 23rd International Symposium on Algorithms and Computation (ISAAC 2012), volume 7676 of LNCS, pages 106–115.
Springer, 2012.
C8. E. Bampis, D. Letsios, G. Lucarelli, E. Markakis, and I. Milis. On multiprocessor temperature-aware
scheduling problems. In Joint International Conference: 6th International Frontiers in Algorithmics
Workshop and 8th International Conference on Algorithmic Aspects of Information and Management
(FAW-AAIM 2012), volume 7285 of LNCS, pages 149–160. Springer, 2012.
8
C7. G. Ausiello, N. Boria, A. Giannakos, G. Lucarelli, and V. Th. Paschos. Online maximum k-coverage.
In 18th International Symposium on Fundamentals of Computation Theory (FCT 2011), volume 6914 of
LNCS, pages 181–192. Springer, 2011.
C6. G. Lucarelli and I. Milis. Improved approximation algorithms for the Max-Edge Coloring problem. In
1st International ICST Conference on Theory and Practice of Algorithms in Computer Systems (TAPAS
2011), volume 6595 of LNCS, pages 206–216. Springer, 2011.
C5. E. Bampis, A. Kononov, G. Lucarelli, and I. Milis. Bounded max-colorings of graphs. In 21st International Symposium on Algorithms and Computation (ISAAC 2010), volume 6506 of LNCS, pages 353–365.
Springer, 2010.
C4. N. Bourgeois, A. Giannakos, G. Lucarelli, I. Milis, V. Th. Paschos, and O. Pottié. The max quasiindependent set problem. In 5th International Computer Science Symposium in Russia (CSR 2010),
volume 6072 of LNCS, pages 60–71. Springer, 2010.
C3. N. Bourgeois, G. Lucarelli, I. Milis, and V. Th. Paschos. Approximating the max-edge coloring problem.
In 20th International Workshop on Combinatorial Algorithms (IWOCA 2009), volume 5874 of LNCS,
pages 83–94. Springer, 2009.
C2. G. Lucarelli, I. Milis, and V. Th. Paschos. On the maximum edge coloring problem. In 6th Workshop on
Approximation and Online Algorithms (WAOA 2008), volume 5426 of LNCS, pages 279–292. Springer,
2008.
C1. G. Lucarelli, I. Milis, and V. Th. Paschos. On a generalized graph coloring/batch scheduling problem. In
3rd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2007),
pages 353–360. 2007.
International Conferences (abstract)
A6. R. Bleuse, G. Lucarelli, G. Mounié, and D. Trystram. Interference-aware scheduling with 2D-torus as a
case study. In 30th Conference of the European Chapter on Combinatorial Optimization (ECCO 2017),
2017.
A5. G. Lucarelli, K. Th. Nguyen, A. Srivastav, and D. Trystram. Online min-sum flow scheduling with
rejections. In 13th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP
2017), 2017.
A4. G. Lucarelli, D. Trystram, and F. Wagner. A generic approach for heterogeneous scheduling. In 28th
Conference of the European Chapter on Combinatorial Optimization (ECCO 2015), 2015.
A3. S. Angelopoulos, G. Lucarelli, and K. Th. Nguyen. Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems. In 12th Workshop on Models and Algorithms for
Planning and Scheduling Problems (MAPSP 2015), 2015.
A2. E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, and M. Sviridenko. Energy efficient multiprocessor
scheduling via configuration LP. In 11th Workshop on Models and Algorithms for Planning and Scheduling
Problems (MAPSP 2013), 2013.
A1. E. Bampis, G. Lucarelli, and I. Milis. On a batch scheduling problem with compatibility and cardinality
constraints. In 8th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP
2007), 2007.
9
National Conferences
N1. G. Lucarelli and I. Androutsopoulos. A Greek named-entity recognizer that uses Support Vector Machines
and active learning. In 4th Hellenic Conference on Artificial Intelligence (SETN 2006), volume 3955 of
LNAI, pages 203–213. Springer, 2006.
National Conferences (abstract)
F6. C. Mommessin and G. Lucarelli. Low complexity on-line scheduling algorithm for hybrid multi-core
machines. In 19e Conférence de la Société Française de Recherche Opérationnelle et Aide à la Décision
(ROADEF 2018), 2018.
F5. A. Srivastav, G. Lucarelli, K. Th. Nguyen, and D. Trystram. Online non-preemptive scheduling in a
resource augmentation model based on duality. In 18e Conférence de la Société Française de Recherche
Opérationnelle et Aide à la Décision (ROADEF 2017), 2017.
F4. S. Albers, E. Bampis, D. Letsios, G. Lucarelli, and R. Stotz. Scheduling on power-heterogeneous processors. In 17e Conférence de la Société Française de Recherche Opérationnelle et Aide à la Décision
(ROADEF 2016), 2016.
F3. E. Bampis, D. Letsios, and G. Lucarelli. Multiprocessor speed scaling with precedence constraints. In 16e
Conférence de la Société Française de Recherche Opérationnelle et Aide à la Décision (ROADEF 2015),
2015.
F2. E. Bampis, A. Kononov, D. Letsios, G. Lucarelli, and M. Sviridenko. Energy efficient scheduling and
routing via randomized rounding. In 15e Conférence de la Société Française de Recherche Opérationnelle
et Aide à la Décision (ROADEF 2014), 2014.
F1. E. Bampis, D. Letsios, and G. Lucarelli. Ordonnancements, flots et couplages verts. In 14e Conférence
de la Société Française de Recherche Opérationnelle et Aide à la Décision (ROADEF 2013), 2013.
Theses
T2. G. Lucarelli. Scheduling in computer and communication systems and generalized graph coloring problems. Ph.D. Thesis, Department of Informatics, Athens University of Economics and Business, 2009.
T1. G. Lucarelli. Named entity recognition and categorization in Greek texts. M.Sc. Thesis (in Greek),
Department of Informatics, Athens University of Economics and Business, 2005.
10