Остановите войну!
for scientists:
default search action
Mattia D'Emidio
- > Home > Persons > Mattia D'Emidio
Publications
- 2020
- [j19]Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe:
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. IEEE Access 8: 207619-207634 (2020) - [c24]Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe:
Leader Election and Compaction for Asynchronous Silent Programmable Matter. AAMAS 2020: 276-284 - 2019
- [j12]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Fully Dynamic 2-Hop Cover Labeling. ACM J. Exp. Algorithmics 24(1): 1.6:1-1.6:36 (2019) - 2018
- [j10]Gianlorenzo D'Angelo, Mattia D'Emidio:
Report on SEA 2018. Bull. EATCS 126 (2018) - 2017
- [j8]Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Christos D. Zaroliagis:
Engineering graph-based models for dynamic timetable information systems. J. Discrete Algorithms 46-47: 40-58 (2017) - 2016
- [c12]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Distance Queries in Large-Scale Fully Dynamic Complex Networks. IWOCA 2016: 109-121 - 2015
- [j5]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano:
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. Theory Comput. Syst. 57(2): 444-477 (2015) - 2014
- [j3]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Fully dynamic update of arc-flags. Networks 63(3): 243-259 (2014) - [j2]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci. 516: 1-19 (2014) - [c9]Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Christos D. Zaroliagis:
Engineering Graph-Based Models for Dynamic Timetable Information Systems. ATMOS 2014: 46-61 - 2013
- [j1]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Pruning the Computation of Distributed Shortest Paths in Power-law Networks. Informatica (Slovenia) 37(3): 253-265 (2013) - 2012
- [c4]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano:
Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. MedAlg 2012: 148-158 - [c3]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
Engineering a New Loop-Free Shortest Paths Routing Algorithm. SEA 2012: 123-134 - [c2]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale:
Fully Dynamic Maintenance of Arc-Flags in Road Networks. SEA 2012: 135-147 - 2011
- [c1]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
A Speed-Up Technique for Distributed Shortest Paths Computation. ICCSA (2) 2011: 578-593
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 2023-10-16 23:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint