Daniele Frigioni

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)

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

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio: Engineering a New Loop-Free Shortest Paths Routing Algorithm. SEA 2012: 123-134

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale: Fully Dynamic Maintenance of Arc-Flags in Road Networks. SEA 2012: 135-147

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio: A Speed-Up Technique for Distributed Shortest Paths Computation. ICCSA (2) 2011: 578-593

Gianlorenzo D'Angelo, Daniele Frigioni, Camillo Vitale: Dynamic Arc-Flags in Road Networks. SEA 2011: 88-99

Tania Di Mascio, Daniele Frigioni, Laura Tarantino: VISTO: A new CBIR system for vector images. Inf. Syst. 35(7): 709-734 (2010)

Giulio Antonini, Daniele Frigioni, Giuseppe Miscione: Hybrid Formulation of the Equation Systems of the 3-D PEEC Model Based on Graph Algorithms. IEEE Trans. on Circuits and Systems 57-I(1): 249-261 (2010)

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)

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

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra: Recoverable Robustness for Train Shunting Problems. Algorithmic Operations Research 4(2): 102-116 (2009)

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)

Patrizia Di Marco, Tania Di Mascio, Daniele Frigioni, Massimo Gastaldi: Evaluating the Effectiveness and the Efficiency of a Vector Image Search Tool. HCI (9) 2009: 259-268

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

Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni: Dynamic Multi-level Overlay Graphs for Shortest Paths. Mathematics in Computer Science 1(4): 709-736 (2008)

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra: Delay Management Problem: Complexity Results and Robust Algorithms. COCOA 2008: 458-468

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alberto Petricola: Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. JCP 2(9): 16-26 (2007)

Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni: Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS 2007

Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra: Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS 2007

Tania Di Mascio, Daniele Frigioni, Laura Tarantino: Evaluation of VISTO: A New Vector Image Search TOol. HCI (3) 2007: 836-845

Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni: Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA 2007: 32-38

Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni: Partially dynamic maintenance of minimum weight hyperpaths. J. Discrete Algorithms 3(1): 27-46 (2005)

Tania Di Mascio, Marco Francesconi, Daniele Frigioni, Laura Tarantino: Tuning a CBIR system for vector images: the interface support. AVI 2004: 425-428

Daniele Frigioni, Laura Tarantino: Multiple zooming in geographic maps. Data Knowl. Eng. 47(2): 207-236 (2003)

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully dynamic shortest paths in digraphs with arbitrary arc weights. J. Algorithms 49(1): 86-113 (2003)

Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni: A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. 297(1-3): 83-102 (2003)

Serafino Cicerone, Daniele Frigioni, Paolino Di Felice: A general strategy for decomposing topological invariants of spatial databases and an application. Data Knowl. Eng. 42(1): 57-87 (2002)

Daniele Frigioni, Laura Tarantino, Tania Di Mascio: On Formal Aspects of Zooming in Geographic Maps. Informatica (Slovenia) 26(3) (2002)

Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis: An Experimental Study of Dynamic Algorithms for Transitive Closure. ACM Journal of Experimental Algorithmics 6: 9 (2001)

Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio: Semi-dynamic breadth-first search in digraphs. Theor. Comput. Sci. 250(1-2): 201-217 (2001)

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamic algorithms for classes of constraint satisfaction problems. Theor. Comput. Sci. 259(1-2): 287-305 (2001)

Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni: Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ICTCS 2001: 312-327

Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela (Eds.): Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings. Lecture Notes in Computer Science 2141, Springer 2001, isbn 3-540-42500-4

Daniele Frigioni, Giuseppe F. Italiano: Dynamically Switching Vertices in Planar Graphs. Algorithmica 28(1): 76-103 (2000)

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. J. Algorithms 34(2): 251-281 (2000)

Serafino Cicerone, Daniele Frigioni, Paolino Di Felice: Decomposing Spatial Databases and Applications. DEXA Workshop 2000: 861-868

Serafino Cicerone, Daniele Frigioni, Laura Tarantino: Interacting with Geographic Databases: A Focus+Context Approach. DEXA Workshop 2000: 869-875

Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni: A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN 2000: 247-257

Serafino Cicerone, Daniele Frigioni, Laura Tarantino: On the formalization of zoom-based interaction with geographic databases. SEBD 2000: 401-414

Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. Algorithm Engineering 2000: 218-229

Serafino Cicerone, Daniele Frigioni, Laura Tarantino: Supporting a Focus+Context Interaction Style for Spatial Databases. WISE 2000: 328-335

Serafino Cicerone, Daniele Frigioni, Laura Tarantino, Paolino Di Felice: Interacting with Topological Invariants of Spatial Databases. DANTE 1999: 213-217

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. Algorithmica 22(3): 250-274 (1998)

Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasquale: Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem. ACM Journal of Experimental Algorithmics 3: 5 (1998)

Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese: A Uniform Approach to Semi-Dynamic Problems on Digraphs. Theor. Comput. Sci. 203(1): 69-90 (1998)

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. ESA 1998: 320-331

Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis: An Experimental Study of Dynamic Algorithms for Directed Graphs. ESA 1998: 368-380

Daniele Frigioni, Giuseppe F. Italiano: Dynamically Switching Vertices in Planar Graphs (Extended Abstract). ESA 1997: 186-199

Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio: Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae. ISAAC 1997: 122-131

Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio: Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. STACS 1997: 33-46

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). SODA 1996: 212-221

Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese: Counting Edges in a Dag. WG 1996: 85-100

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. CIAC 1994: 136-151

Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Incremental Algorithms for the Single-Source Shortest Path Problem. FSTTCS 1994: 113-124