default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAristotelis Giannakos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Chuang Li
, Aoli He, Gang Liu, Yanhua Wen, Anthony Theodore Chronopoulos, Aristotelis Giannakos:
RFL-APIA: A Comprehensive Framework for Mitigating Poisoning Attacks and Promoting Model Aggregation in IIoT Federated Learning. IEEE Trans. Ind. Informatics 20(11): 12935-12944 (2024)- 2023
- [c9]Rodrigue Govan, Nazha Selmaoui-Folcher, Aristotelis Giannakos, Philippe Fournier-Viger:
Extraction de co-localisations sous contrainte de la structure spatiale. CNIA 2023 - [c8]Rodrigue Govan, Nazha Selmaoui-Folcher, Aristotelis Giannakos, Philippe Fournier-Viger:
Co-location Pattern Mining Under the Spatial Structure Constraint. DEXA (1) 2023: 186-193
2010 – 2019
- 2017
- [j6]Aristotelis Giannakos, Mhand Hifi, R. Kheffache, Rachid Ouafi:
An approximation algorithm for the k-fixed depots problem. Comput. Ind. Eng. 111: 50-55 (2017) - [j5]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) - [i1]Aristotelis Giannakos, Mhand Hifi, Gregory Karagiorgos:
Data Delivery by Mobile Agents with Energy Constraints over a fixed path. CoRR abs/1703.05496 (2017) - 2013
- [c7]Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos:
Exact and Approximation Algorithms for Densest k-Subgraph. WALCOM 2013: 114-125 - 2012
- [j4]Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online maximum k-coverage. Discret. Appl. Math. 160(13-14): 1901-1913 (2012) - [j3]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) - 2011
- [c6]Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online Maximum k-Coverage. FCT 2011: 181-192 - 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
2000 – 2009
- 2009
- [j2]Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos:
Greedy Algorithms For On-Line Set-Covering. Algorithmic Oper. Res. 4(1): 36-48 (2009) - [c4]Aristotelis Giannakos, Gregory Karagiorgos, Ioannis Stavrakakis:
A Message-Optimal Sink Mobility Model for Wireless Sensor Networks. ICN 2009: 287-291 - 2007
- [c3]Aristotelis Giannakos, Laurent Gourvès, Jérôme Monnot, Vangelis Th. Paschos:
On the Performance of Congestion Games for Optimum Satisfiability Problems. WINE 2007: 220-231 - 2006
- [c2]Giorgio Ausiello, Aristotelis Giannakos, Vangelis Th. Paschos:
Greedy algorithms for on-line set-covering and related problems. CATS 2006: 145-151 - 2000
- [j1]Evripidis Bampis, Aristotelis Giannakos, Alexander V. Karzanov, Yannis Manoussakis, Ioannis Milis:
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases. RAIRO Theor. Informatics Appl. 34(2): 87-98 (2000)
1990 – 1999
- 1996
- [c1]Aristotelis Giannakos, Jean-Claude König, Alix Munier:
On the Cyclic Scheduling Problem with Small Communication Delays (Extended Abstract). Euro-Par, Vol. II 1996: 578-581
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-12-02 22:26 CET 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:
