Daniele Frigioni
Daniele Frigioni
Professor of Information Engineering, University of L'Aquila, Italy
Verified email at univaq.it
Title
Cited by
Cited by
Year
Fully dynamic algorithms for maintaining shortest paths trees
D Frigioni, A Marchetti-Spaccamela, U Nanni
Journal of Algorithms 34 (2), 251-281, 2000
2472000
Directed hypergraphs: Problems, algorithmic results, and a novel decremental approach
G Ausiello, PG Franciosa, D Frigioni
Italian conference on theoretical computer science, 312-328, 2001
1132001
Semidynamic algorithms for maintaining single-source shortest path trees
D Frigioni, A Marchetti-Spaccamela, U Nanni
Algorithmica 22 (3), 250-274, 1998
931998
Fully dynamic output bounded single source shortest path problem
D Frigioniyz, A Marchetti-Spaccamelaz, U Nanniz
871996
Experimental analysis of dynamic algorithms for the single source shortest paths problem
D Frigioni, M Ioffreda, U Nanni, G Pasqualone
Journal of Experimental Algorithmics (JEA) 3, 5-es, 1998
831998
Recoverable robustness in shunting and timetabling
S Cicerone, G D’Angelo, G Di Stefano, D Frigioni, A Navarra, ...
Robust and online large-scale optimization, 28-60, 2009
772009
Semi-dynamic shortest paths and breadth-first search in digraphs
PG Franciosa, D Frigioni, R Giaccio
Annual Symposium on Theoretical Aspects of Computer Science, 33-46, 1997
681997
Robust Algorithms and Price of Robustness in Shunting Problems
S Cicerone, G D'Angelo, G Di Stefano, D Frigioni, A Navarra
7th Workshop on Algorithmic Approaches for Transportation Modeling …, 2007
552007
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
S Cicerone, G D’Angelo, G Di Stefano, D Frigioni, A Navarra
Journal of Combinatorial Optimization 18 (3), 229, 2009
512009
Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study
C Demetrescu, D Frigioni, A Marchetti-Spaccamela, U Nanni
International Workshop on Algorithm Engineering, 218-229, 2000
492000
A fully dynamic algorithm for distributed shortest paths
S Cicerone, G Di Stefano, D Frigioni, U Nanni
Theoretical Computer Science 297 (1-3), 83-102, 2003
412003
Fully dynamic shortest paths in digraphs with arbitrary arc weights
D Frigioni, A Marchetti-Spaccamela, U Nanni
Journal of Algorithms 49 (1), 86-113, 2003
382003
Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights
D Frigioni, A Marchetti-Spaccamela, U Nanni
European Symposium on Algorithms, 320-331, 1998
381998
Dynamically switching vertices in planar graphs
D Frigioni, GF Italiano
Algorithmica 28 (1), 76-103, 2000
372000
Incremental algorithms for the single-source shortest path problem
D Frigioni, A Marchetti-Spaccamela, U Nanni
International Conference on Foundations of Software Technology and …, 1994
371994
An experimental study of dynamic algorithms for transitive closure
D Frigioni, T Miller, U Nanni, C Zaroliagis
Journal of Experimental Algorithmics (JEA) 6, 9-es, 2001
292001
Recoverable robustness for train shunting problems
S Cicerone, G D'Angelo, G Di Stefano, D Frigioni, A Navarra
Algorithmic Operations Research 4 (2), 102-116, 2009
252009
Dynamic multi-level overlay graphs for shortest paths
F Bruera, S Cicerone, G D’Angelo, G Di Stefano, D Frigioni
Mathematics in Computer Science 1 (4), 709-736, 2008
242008
Human-Computer Interaction. HCI Applications and Services: 12th International Conference, HCI International 2007, Beijing, China, July 22-27, 2007, Proceedings, Part IV
JA Jacko
Springer, 2007
232007
Engineering graph-based models for dynamic timetable information systems
A Cionini, G D'Angelo, M D'Emidio, D Frigioni, K Giannakopoulou, ...
Journal of Discrete Algorithms 46, 40-58, 2017
222017
The system can't perform the operation now. Try again later.
Articles 1–20