Daniele Frigioni 个人学术档案

引用次数

	总计	2019 年至今
引用	2124	568
h 指数	23	12
i10 指数	53	23

160

120

19971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320246 17 5 23 50 43 54 78 57 66 83 74 93 79 72 93 90 106 92 112 120 119 148 114 83 92 70 61

开放获取的出版物数量

查看全部

11 篇文章

7 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Gianlorenzo D'AngeloGran Sasso Science Institute (GSSI)在 gssi.it 的电子邮件经过验证
Mattia D'EmidioProfessor and Researcher, University of L'Aquila在 univaq.it 的电子邮件经过验证
Serafino CiceroneUniversity of L'Aquila, Italy在 univaq.it 的电子邮件经过验证
Umberto NanniFull Professor, University of Rome "La Sapienza"在 dis.uniroma1.it 的电子邮件经过验证
Alberto Marchetti-SpaccamelaProfessor of Computer Engineering, Sapienza University of Rome在 diag.uniroma1.it 的电子邮件经过验证
Gabriele Di StefanoProfessor of Computer Science, University of L'Aquila, Italy在 univaq.it 的电子邮件经过验证
Alfredo Navarra, PhDDipartimento di Matematica e Informatica, Università degli Studi di Perugia在 unipg.it 的电子邮件经过验证
Paolo Franciosaprof. in Computer Science, Statistics Dept, Sapienza University Rome在 uniroma1.it 的电子邮件经过验证
Laura TarantinoAssociate Professor, Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica, Università degli Studi dell'Aquila在 univaq.it 的电子邮件经过验证
Stefano LeucciDepartment of Information Engineering, Computer Science, and Mathematics - University of L'Aquila在 univaq.it 的电子邮件经过验证
Guido ProiettiProfessor of Computer Science, University of L'Aquila在 univaq.it 的电子邮件经过验证
Christos ZaroliagisProfessor of Algorithm Design, Analysis and Engineering, University of Patras在 ceid.upatras.gr 的电子邮件经过验证
Giulio AntoniniFull Professor at Università degli Studi dell'Aquila在 univaq.it 的电子邮件经过验证
Giuseppe F. ItalianoProfessor of Computer Science, LUISS University, Rome, Italy在 luiss.it 的电子邮件经过验证
Anita SchoebelProfessorin für Angewandte Mathematik, TU Kaiserslautern und Fraunhofer ITWM在 itwm.fraunhofer.de 的电子邮件经过验证
Andreas ParaskevopoulosUniversity of Patras在 ceid.upatras.gr 的电子邮件经过验证
Camil DemetrescuProfessor of Computer Science, Sapienza University of Rome在 diag.uniroma1.it 的电子邮件经过验证
Guido SchäferCWI在 cwi.nl 的电子邮件经过验证
Gerth Stølting BrodalAarhus University在 cs.au.dk 的电子邮件经过验证
Sebastian StillerTechnische Universität Braunschweig在 tu-braunschweig.de 的电子邮件经过验证

关注

Daniele Frigioni

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

在 univaq.it 的电子邮件经过验证 - 首页

Algorithm engineering


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Fully dynamic algorithms for maintaining shortest paths trees D Frigioni, A Marchetti-Spaccamela, U Nanni Journal of Algorithms 34 (2), 251-281, 2000	264	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	125*	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	92	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	91	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	61	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	59	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	52	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
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
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	35	2019
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	32	2018
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
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	28	2009

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用