Folgen
Daniele Frigioni
Daniele Frigioni
Professor of Information Engineering, University of L'Aquila, Italy
Bestätigte E-Mail-Adresse bei univaq.it - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Fully dynamic algorithms for maintaining shortest paths trees
D Frigioni, A Marchetti-Spaccamela, U Nanni
Journal of Algorithms 34 (2), 251-281, 2000
2652000
Directed hypergraphs: Problems, algorithmic results, and a novel decremental approach
G Ausiello, PG Franciosa, D Frigioni
Theoretical Computer Science: ICTCS 2001, 312-328, 2001
125*2001
Semidynamic algorithms for maintaining single-source shortest path trees
D Frigioni, A Marchetti-Spaccamela, U Nanni
Algorithmica 22 (3), 250-274, 1998
1001998
Recoverable robustness in shunting and timetabling
S Cicerone, G D’Angelo, G Di Stefano, D Frigioni, A Navarra, ...
Robust and Online Large-Scale Optimization: Models and Techniques for …, 2009
922009
Experimental analysis of dynamic algorithms for the single source shortest paths problem
D Frigioni, M Ioffreda, U Nanni, G Pasqualone
ACM Journal of Experimental Algorithmics (JEA) 3, 5-es, 1998
891998
Fully dynamic output bounded single source shortest path problem
D Frigioni, A Marchetti-Spaccamela, U Nanni
Proceedings 7th Symposium on Discrete Algorithms (SODA96), 212-221, 1996
881996
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
592007
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, 229-257, 2009
582009
Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study
C Demetrescu, D Frigioni, A Marchetti-Spaccamela, U Nanni
Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken …, 2001
512001
Dynamically switching vertices in planar graphs
D Frigioni, GF Italiano
Algorithmica 28, 76-103, 2000
472000
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
462003
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
432003
Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights
D Frigioni, A Marchetti-Spaccamela, U Nanni
Proceedings 6th Annual European Symposium on Algorithms (ESA’98), 320-331, 2002
41*2002
An experimental study of dynamic algorithms for transitive closure
D Frigioni, T Miller, U Nanni, C Zaroliagis
ACM Journal of Experimental Algorithmics (JEA) 6, 9-es, 2001
392001
Incremental algorithms for the single-source shortest path problem
D Frigioni, A Marchetti-Spaccamela, U Nanni
Foundation of Software Technology and Theoretical Computer Science: 14th …, 1994
391994
Fully dynamic 2-hop cover labeling
G D'Angelo, M D'Emidio, D Frigioni
ACM Journal of Experimental Algorithmics 24 (1), Article 1.6, 2019
302019
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, 709-736, 2008
292008
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
M D'Emidio, G Di Stefano, D Frigioni, A Navarra
Information and Computation 263, 57-74, 2018
282018
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
282009
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20