Daniele Frigioni

Citado por

	Total	Desde 2020
Citas	2148	450
Índice h	23	12
Índice i10	52	13

160

120

199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420256 17 5 23 50 43 54 78 57 66 83 74 93 78 72 93 90 104 92 112 119 119 144 113 81 90 70 91 5

Acceso público

Ver todo

11 artículos

7 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Gianlorenzo D'AngeloGran Sasso Science Institute (GSSI)Dirección de correo verificada de gssi.it
Mattia D'EmidioUniversity of L'AquilaDirección de correo verificada de univaq.it
Serafino CiceroneUniversity of L'Aquila, ItalyDirección de correo verificada de univaq.it
Umberto NanniFull Professor, University of Rome "La Sapienza"Dirección de correo verificada de dis.uniroma1.it
Alberto Marchetti-SpaccamelaProfessor of Computer Engineering, Sapienza University of RomeDirección de correo verificada de diag.uniroma1.it
Gabriele Di StefanoProfessor of Computer Science, University of L'Aquila, ItalyDirección de correo verificada de univaq.it
Alfredo Navarra, PhDDipartimento di Matematica e Informatica, Università degli Studi di PerugiaDirección de correo verificada de unipg.it
Paolo Franciosaprof. in Computer Science, Statistics Dept, Sapienza University RomeDirección de correo verificada de uniroma1.it
Laura TarantinoAssociate Professor, Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica, Università degli Studi dell'AquilaDirección de correo verificada de univaq.it
Stefano LeucciDepartment of Information Engineering, Computer Science, and Mathematics - University of L'AquilaDirección de correo verificada de univaq.it
Guido ProiettiProfessor of Computer Science, University of L'AquilaDirección de correo verificada de univaq.it
Christos ZaroliagisProfessor of Algorithm Design, Analysis and Engineering, University of PatrasDirección de correo verificada de ceid.upatras.gr
Giulio AntoniniFull Professor at Università degli Studi dell'AquilaDirección de correo verificada de univaq.it
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, ItalyDirección de correo verificada de luiss.it
Andreas ParaskevopoulosUniversity of PatrasDirección de correo verificada de ceid.upatras.gr
Anita SchoebelProfessorin für Angewandte Mathematik, TU Kaiserslautern und Fraunhofer ITWMDirección de correo verificada de itwm.fraunhofer.de
Camil DemetrescuProfessor of Computer Science, Sapienza University of RomeDirección de correo verificada de diag.uniroma1.it
Guido SchäferCWIDirección de correo verificada de cwi.nl
Gerth Stølting BrodalAarhus UniversityDirección de correo verificada de cs.au.dk
Giacomo ValenteAssistant Professor, University of L'AquilaDirección de correo verificada de univaq.it

Seguir

Daniele Frigioni

Professor of Computer Engineering, University of L'Aquila, Italy

Dirección de correo verificada de univaq.it - Página principal

Algorithm engineering


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Fully dynamic algorithms for maintaining shortest paths trees D Frigioni, A Marchetti-Spaccamela, U Nanni Journal of Algorithms 34 (2), 251-281, 2000	267	2000
Directed hypergraphs: Problems, algorithmic results, and a novel decremental approach G Ausiello, PG Franciosa, D Frigioni Theoretical Computer Science: ICTCS 2001, 312-328, 2001	130*	2001
Semidynamic algorithms for maintaining single-source shortest path trees D Frigioni, A Marchetti-Spaccamela, U Nanni Algorithmica 22 (3), 250-274, 1998	99	1998
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	97	2009
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	92	1998
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	89	1996
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	72	1997
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	60	2009
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	60	2007
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	54	2001
Dynamically switching vertices in planar graphs D Frigioni, GF Italiano Algorithmica 28, 76-103, 2000	47	2000
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	46	2003
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	42	2003
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	42*	2002
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	40	2019
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	39	1994
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	38	2001
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	34	2018
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	30	2009
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	29	2008

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores