default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiorgio Lucarelli
Person information
- affiliation: University Grenoble-Alpes, LIG, Grenoble, France
- affiliation: Université de Lorraine, LCOMS, Metz, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c43]Vincent Fagnon
, Giorgio Lucarelli, Christophe Rapine:
Makespan Minimization for Scheduling on Heterogeneous Platforms with Precedence Constraints. Euro-Par (1) 2024: 343-356- 2023
- [c42]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Non-Clairvoyant Makespan Minimization Scheduling with Predictions. ISAAC 2023: 9:1-9:15 - [c41]Imad Assayakh, Imed Kacem, Giorgio Lucarelli:
Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness. IWOCA 2023: 49-61 - 2022
- [j21]Imed Kacem, Giorgio Lucarelli, Théo Nazé:
Exact algorithms for scheduling programs with shared tasks. J. Comb. Optim. 43(5): 1602-1627 (2022) - [c40]Vincent Fagnon, Giorgio Lucarelli, Clément Mommessin, Denis Trystram:
Two-Agent Scheduling with Resource Augmentation on Multiple Machines. Euro-Par 2022: 253-267 - [c39]Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Scheduling with Untrusted Predictions. IJCAI 2022: 4581-4587 - 2021
- [j20]Olivier Beaumont, Louis-Claude Canon, Lionel Eyraud-Dubois, Giorgio Lucarelli, Loris Marchal, Clément Mommessin, Bertrand Simon, Denis Trystram:
Scheduling on Two Types of Resources: A Survey. ACM Comput. Surv. 53(3): 56:1-56:36 (2021) - [j19]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. ACM Trans. Parallel Comput. 8(2): 9:1-9:22 (2021) - [c38]Bochra Djahel, Imed Kacem, Giorgio Lucarelli:
On the Tardiness Minimization on Single Machine. ICNSC 2021: 1-6 - [c37]Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Speed Scaling with Explorable Uncertainty. SPAA 2021: 83-93 - 2020
- [j18]Giorgio Lucarelli, Matteo Borrotti:
A deep Q-learning portfolio management framework for the cryptocurrency market. Neural Comput. Appl. 32(23): 17229-17244 (2020) - [c36]Evripidis Bampis, Konstantinos Dogeas, Alexander V. Kononov, Giorgio Lucarelli, Fanny Pascual:
Scheduling Malleable Jobs Under Topological Constraints. IPDPS 2020: 316-325 - [c35]Adrien Faure, Giorgio Lucarelli, Olivier Richard, Denis Trystram:
Online Scheduling with Redirection for Parallel Jobs. IPDPS Workshops 2020: 326-329 - [c34]Vincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon:
Scheduling on Hybrid Platforms: Improved Approximability Window. LATIN 2020: 38-49 - [c33]Imed Kacem, Giorgio Lucarelli, Théo Nazé:
Exact Algorithms for Scheduling Programs with Shared Tasks. WorldCIST (2) 2020: 435-444
2010 – 2019
- 2019
- [j17]Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen:
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems. Algorithmica 81(9): 3391-3421 (2019) - [j16]Marcos Amaris, Giorgio Lucarelli, Clément Mommessin, Denis Trystram:
Generic algorithms for scheduling applications on heterogeneous platforms. Concurr. Comput. Pract. Exp. 31(15) (2019) - [c32]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines. FSTTCS 2019: 24:1-24:12 - [c31]Giorgio Lucarelli, Matteo Borrotti:
A Deep Reinforcement Learning Approach for Automated Cryptocurrency Trading. AIAI 2019: 247-258 - [i12]Olivier Beaumont, Louis-Claude Canon, Lionel Eyraud-Dubois, Giorgio Lucarelli, Loris Marchal, Clément Mommessin, Bertrand Simon, Denis Trystram:
Scheduling on Two Types of Resources: a Survey. CoRR abs/1909.11365 (2019) - [i11]Vincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon:
Scheduling on Hybrid Platforms: Improved Approximability Window. CoRR abs/1912.03088 (2019) - 2018
- [j15]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy-efficient scheduling and routing via randomized rounding. J. Sched. 21(1): 35-51 (2018) - [j14]Louiza Yala, Pantelis A. Frangoudis, Giorgio Lucarelli, Adlen Ksentini:
Cost and Availability Aware Resource Allocation and Virtual Function Placement for CDNaaS Provision. IEEE Trans. Netw. Serv. Manag. 15(4): 1334-1348 (2018) - [c30]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. ESA 2018: 59:1-59:12 - [c29]Raphaël Bleuse, Giorgio Lucarelli, Denis Trystram:
A Methodology for Handling Data Movements by Anticipation: Position Paper. Euro-Par Workshops 2018: 134-145 - [c28]Raphaël Bleuse, Konstantinos Dogeas, Giorgio Lucarelli, Grégory Mounié, Denis Trystram:
Interference-Aware Scheduling Using Geometric Constraints. Euro-Par 2018: 205-217 - [c27]Luciana Arantes, Evripidis Bampis, Alexander V. Kononov, Manthos Letsios, Giorgio Lucarelli, Pierre Sens:
Scheduling under Uncertainty: A Query-based Approach. IJCAI 2018: 4646-4652 - [c26]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. SPAA 2018: 291-300 - [i10]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-preemptive Scheduling on Unrelated Machines with Rejections. CoRR abs/1802.10309 (2018) - [i9]Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines. CoRR abs/1804.08317 (2018) - 2017
- [j13]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Exact and superpolynomial approximation algorithms for the densest k-subgraph problem. Eur. J. Oper. Res. 262(3): 894-903 (2017) - [j12]Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz:
Scheduling on power-heterogeneous processors. Inf. Comput. 257: 22-33 (2017) - [c25]Giorgio Lucarelli, Fernando Machado Mendonca, Denis Trystram:
A new on-line method for scheduling independent tasks. CCGrid 2017: 140-149 - [c24]Marcos Amaris, Giorgio Lucarelli, Clément Mommessin, Denis Trystram:
Generic Algorithms for Scheduling Applications on Hybrid Multi-core Machines. Euro-Par 2017: 220-231 - [c23]Louiza Yala, Pantelis A. Frangoudis, Giorgio Lucarelli, Adlen Ksentini:
Balancing between Cost and Availability for CDNaaS Resource Placement. GLOBECOM 2017: 1-7 - [i8]Marcos Amaris, Giorgio Lucarelli, Clément Mommessin, Denis Trystram:
Generic algorithms for scheduling applications on heterogeneous multi-core platforms. CoRR abs/1711.06433 (2017) - 2016
- [c22]Giorgio Lucarelli, Abhinav Srivastav, Denis Trystram:
From Preemptive to Non-preemptive Scheduling Using Rejections. COCOON 2016: 510-519 - [c21]Giorgio Lucarelli, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram:
Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality. ESA 2016: 63:1-63:17 - [c20]Susanne Albers, Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Richard Stotz:
Scheduling on Power-Heterogeneous Processors. LATIN 2016: 41-54 - 2015
- [j11]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Nemparis:
From preemptive to non-preemptive speed-scaling scheduling. Discret. Appl. Math. 181: 11-20 (2015) - [j10]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
Green scheduling, flows and matchings. Theor. Comput. Sci. 579: 126-136 (2015) - [c19]Giorgio Lucarelli, Fernando Machado Mendonca, Denis Trystram, Frédéric Wagner:
Contiguity and Locality in Backfilling Scheduling. CCGRID 2015: 586-595 - [c18]Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen:
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems. ESA 2015: 35-46 - [i7]Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen:
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems. CoRR abs/1502.03946 (2015) - 2014
- [j9]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis:
Bounded max-colorings of graphs. J. Discrete Algorithms 26: 56-68 (2014) - [j8]Sahar Talebi, Evripidis Bampis, Giorgio Lucarelli, Iyad A. Katib, George N. Rouskas:
Spectrum Assignment in Optical Networks: A Multiprocessor Scheduling Perspective. JOCN 6(8): 754-763 (2014) - [c17]Evripidis Bampis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Milis, Georgios Zois:
Energy Efficient Scheduling of MapReduce Jobs. Euro-Par 2014: 198-209 - [c16]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
Speed-Scaling with No Preemptions. ISAAC 2014: 259-269 - [c15]Sahar Talebi, Evripidis Bampis, Giorgio Lucarelli, Iyad A. Katib, George N. Rouskas:
The spectrum assigment (SA) problem in optical networks: A multiprocesor scheduling perspective. ONDM 2014: 55-60 - [c14]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
A note on multiprocessor speed scaling with precedence constraints. SPAA 2014: 138-142 - [i6]Evripidis Bampis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Milis, Georgios Zois:
Energy Efficient Scheduling of MapReduce Jobs. CoRR abs/1402.2810 (2014) - [i5]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy Efficient Scheduling and Routing via Randomized Rounding. CoRR abs/1403.4991 (2014) - [i4]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
Speed-scaling with no Preemptions. CoRR abs/1407.7654 (2014) - 2013
- [j7]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis:
On multiprocessor temperature-aware scheduling problems. J. Sched. 16(5): 529-538 (2013) - [c13]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Nemparis:
From Preemptive to Non-preemptive Speed-Scaling Scheduling. COCOON 2013: 134-146 - [c12]Evripidis Bampis, Alexander V. Kononov, Dimitrios Letsios, Giorgio Lucarelli, Maxim Sviridenko:
Energy Efficient Scheduling and Routing via Randomized Rounding. FSTTCS 2013: 449-460 - [c11]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Exact and Approximation Algorithms for Densest k-Subgraph. WALCOM 2013: 114-125 - [c10]Evripidis Bampis, Vincent Chau, Dimitrios Letsios, Giorgio Lucarelli, Ioannis Milis:
Energy Minimization via a Primal-Dual Algorithm for a Convex Program. SEA 2013: 366-377 - 2012
- [j6]Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online maximum k-coverage. Discret. Appl. Math. 160(13-14): 1901-1913 (2012) - [j5]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié:
The max quasi-independent set problem. J. Comb. Optim. 23(1): 94-117 (2012) - [c9]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis, Ioannis Milis:
On Multiprocessor Temperature-Aware Scheduling Problems. FAW-AAIM 2012: 149-160 - [c8]Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli:
Green Scheduling, Flows and Matchings. ISAAC 2012: 106-115 - [i3]Evripidis Bampis, Giorgio Lucarelli, Ioannis Nemparis:
Improved Approximation Algorithms for the Non-preemptive Speed-scaling Problem. CoRR abs/1209.6481 (2012) - 2011
- [j4]Giorgio Lucarelli, Ioannis Milis:
Improved approximation algorithms for the Max Edge-Coloring problem. Inf. Process. Lett. 111(16): 819-823 (2011) - [c7]Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online Maximum k-Coverage. FCT 2011: 181-192 - [c6]Giorgio Lucarelli, Ioannis Milis:
Improved Approximation Algorithms for the Max-Edge Coloring Problem. TAPAS 2011: 206-216 - 2010
- [j3]Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
On the max-weight edge coloring problem. J. Comb. Optim. 20(4): 429-442 (2010) - [j2]Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Approximating the max-edge-coloring problem. Theor. Comput. Sci. 411(34-36): 3055-3067 (2010) - [c5]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié:
The max quasi-independent set Problem. CSR 2010: 60-71 - [c4]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis:
Bounded Max-colorings of Graphs. ISAAC (1) 2010: 353-365
2000 – 2009
- 2009
- [b1]Giorgio Lucarelli:
Scheduling in computer and communication systems and generalized graph coloring problems. Athens University Economics and Business, Greece, 2009 - [c3]Nicolas Bourgeois, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Approximating the Max Edge-Coloring Problem. IWOCA 2009: 83-94 - [i2]Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Max Edge Coloring of Trees. CoRR abs/0901.4002 (2009) - [i1]Evripidis Bampis, Alexander V. Kononov, Giorgio Lucarelli, Ioannis Milis:
Bounded Max-Colorings of Graphs. CoRR abs/0904.1705 (2009) - 2008
- [c2]Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
On the Maximum Edge Coloring Problem. WAOA 2008: 279-292 - 2007
- [j1]Georgios Lucarelli, Xenofon Vasilakos, Ion Androutsopoulos:
Named Entity Recognition in Greek Texts with an Ensemble of SVMs and Active Learning. Int. J. Artif. Intell. Tools 16(6): 1015-1045 (2007) - 2006
- [c1]Georgios Lucarelli, Ion Androutsopoulos:
A Greek Named-Entity Recognizer That Uses Support Vector Machines and Active Learning. SETN 2006: 203-213
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
