Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniele Frigioni
- > Home > Persons > Daniele Frigioni
Publications
- 2019
[j32]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)- 2017
- [j30]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
- [c39]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Distance Queries in Large-Scale Fully Dynamic Complex Networks. IWOCA 2016: 109-121 - 2015
- [j27]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
- [j25]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Fully dynamic update of arc-flags. Networks 63(3): 243-259 (2014) - [j24]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) - [c36]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
- [j23]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio:
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica 66(1): 51-86 (2013) - [j22]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
- [c31]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 - [c30]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
Engineering a New Loop-Free Shortest Paths Routing Algorithm. SEA 2012: 123-134 - [c29]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale:
Fully Dynamic Maintenance of Arc-Flags in Road Networks. SEA 2012: 135-147 - 2011
- [c28]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
A Speed-Up Technique for Distributed Shortest Paths Computation. ICCSA (2) 2011: 578-593 - [c27]Gianlorenzo D'Angelo, Daniele Frigioni, Camillo Vitale:
Dynamic Arc-Flags in Road Networks. SEA 2011: 88-99 - 2010
- [j19]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni:
Partially dynamic efficient algorithms for distributed shortest paths. Theor. Comput. Sci. 411(7-9): 1013-1037 (2010) - [c26]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio:
A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. SEA 2010: 59-70 - 2009
- [j18]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Recoverable Robustness for Train Shunting Problems. Algorithmic Oper. Res. 4(2): 102-116 (2009) - [j17]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. J. Comb. Optim. 18(3): 229-257 (2009) - [p1]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra, Michael Schachtebeck, Anita Schöbel:
Recoverable Robustness in Shunting and Timetabling. Robust and Online Large-Scale Optimization 2009: 28-60 - 2008
- [j16]Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni:
Dynamic Multi-level Overlay Graphs for Shortest Paths. Math. Comput. Sci. 1(4): 709-736 (2008) - [c24]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Delay Management Problem: Complexity Results and Robust Algorithms. COCOA 2008: 458-468 - 2007
- [j15]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alberto Petricola:
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. J. Comput. 2(9): 16-26 (2007) - [c23]Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni:
Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS 2007 - [c22]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS 2007 - [c20]Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni:
Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA 2007: 32-38
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-11-13 23:27 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:
