Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (CIAC, 1994)

Incremental Algorithms for the Single-Source Shortest Path Problem. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (FSTTCS, 1994)

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

Counting Edges in a Dag. - Serafino Cicerone; Daniele Frigioni; Umberto Nanni; Francesco Pugliese (WG, 1996)

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

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

Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. - Paolo Giulio Franciosa; Daniele Frigioni; Roberto Giaccio (STACS, 1997)

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

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

Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (Algorithmica, 1998)

Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem. - Daniele Frigioni; Mario Ioffreda; Umberto Nanni; Giulio Pasqualone (ACM J. Exp. Algorithmics, 1998)

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

Interacting with Topological Invariants of Spatial Databases. - Serafino Cicerone; Daniele Frigioni; Laura Tarantino; Paolino Di Felice (DANTE, 1999)

Decomposing Spatial Databases and Applications. - Serafino Cicerone; Daniele Frigioni; Paolino Di Felice (DEXA Workshop, 2000)

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

On the formalization of zoom-based interaction with geographic databases. - Serafino Cicerone; Daniele Frigioni; Laura Tarantino (SEBD, 2000)

Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. - Camil Demetrescu; Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (WAE, 2000)

Supporting a Focus+Context Interaction Style for Spatial Databases. - Serafino Cicerone; Daniele Frigioni; Laura Tarantino (WISE, 2000)

Dynamically Switching Vertices in Planar Graphs. - Daniele Frigioni; Giuseppe F. Italiano (Algorithmica, 2000)

Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (J. Algorithms, 2000)

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

An Experimental Study of Dynamic Algorithms for Transitive Closure. - Daniele Frigioni; Tobias Miller; Umberto Nanni; Christos D. Zaroliagis (ACM J. Exp. Algorithmics, 2001)

Semi-dynamic breadth-first search in digraphs. - Paolo Giulio Franciosa; Daniele Frigioni; Roberto Giaccio (Theor. Comput. Sci., 2001)

Dynamic algorithms for classes of constraint satisfaction problems. - Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni (Theor. Comput. Sci., 2001)

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

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

Multiple zooming in geographic maps. - Daniele Frigioni; Laura Tarantino (Data Knowl. Eng., 2003)

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

A fully dynamic algorithm for distributed shortest paths. - Serafino Cicerone; Gabriele Di Stefano; Daniele Frigioni; Umberto Nanni (Theor. Comput. Sci., 2003)

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

Partially dynamic maintenance of minimum weight hyperpaths. - Giorgio Ausiello; Paolo Giulio Franciosa; Daniele Frigioni (J. Discrete Algorithms, 2005)

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

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

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

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

Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alberto Petricola (J. Comput., 2007)

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

Dynamic Multi-level Overlay Graphs for Shortest Paths. - Francesco Bruera; Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni (Math. Comput. Sci., 2008)

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

Recoverable Robustness for Train Shunting Problems. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (Algorithmic Oper. Res., 2009)

Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (J. Comb. Optim., 2009)

Recoverable Robustness in Shunting and Timetabling. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra; Michael Schachtebeck; Anita Schöbel (Robust and Online Large-Scale Optimization, 2009)

A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Vinicio Maurizio (SEA, 2010)

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

Hybrid Formulation of the Equation Systems of the 3-D PEEC Model Based on Graph Algorithms. - Giulio Antonini; Daniele Frigioni; Giuseppe Miscione (IEEE Trans. Circuits Syst. I Regul. Pap., 2010)

Partially dynamic efficient algorithms for distributed shortest paths. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni (Theor. Comput. Sci., 2010)

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

Dynamic Arc-Flags in Road Networks. - Gianlorenzo D'Angelo; Daniele Frigioni; Camillo Vitale (SEA, 2011)

Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni; Daniele Romano (MedAlg, 2012)

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

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

Exploring and Making Safe Dangerous Networks Using Mobile Entities. - Mattia D'Emidio; Daniele Frigioni; Alfredo Navarra (ADHOC-NOW, 2013)

Dynamically Maintaining Shortest Path Trees under Batches of Updates. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (SIROCCO, 2013)

Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. - Serafino Cicerone; Gianlorenzo D'Angelo; Gabriele Di Stefano; Daniele Frigioni; Vinicio Maurizio (Algorithmica, 2013)

Pruning the Computation of Distributed Shortest Paths in Power-law Networks. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni (Informatica (Slovenia), 2013)

Engineering shortest-path algorithms for dynamic networks. - Mattia D'Emidio; Daniele Frigioni (ICTCS, 2014)

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (SEA, 2014)

Fully dynamic update of arc-flags. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni (Networks, 2014)

A loop-free shortest-path routing algorithm for dynamic networks. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni (Theor. Comput. Sci., 2014)

Path-Fault-Tolerant Approximate Shortest-Path Trees. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (SIROCCO, 2015)

Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs. - Mattia D'Emidio; Daniele Frigioni; Alfredo Navarra (ICTCS, 2015)

Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. - Annalisa D'Andrea; Mattia D'Emidio; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (ACM J. Exp. Algorithmics, 2015)

Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni; Daniele Romano (Theory Comput. Syst., 2015)

Explore and repair graphs with black holes using mobile entities. - Mattia D'Emidio; Daniele Frigioni; Alfredo Navarra (Theor. Comput. Sci., 2015)

Characterizing the Computational Power of Anonymous Mobile Robots. - Mattia D'Emidio; Daniele Frigioni; Alfredo Navarra (ICDCS, 2016)

On the Clustered Shortest-Path Tree Problem. - Mattia D'Emidio; Luca Forlizzi; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (ICTCS, 2016)

Improved Protocols for Luminous Asynchronous Robots. - Mattia D'Emidio; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (ICTCS, 2016)

Distance Queries in Large-Scale Fully Dynamic Complex Networks. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni (IWOCA, 2016)

Rigorous DC Solution of Partial Element Equivalent Circuit Models. - Daniele Romano; Giulio Antonini; Mattia D'Emidio; Daniele Frigioni; Alessandro Mori; Mauro Bandinelli (IEEE Trans. Circuits Syst. I Regul. Pap., 2016)

Engineering graph-based models for dynamic timetable information systems. - Alessio Cionini; Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni; Kalliopi Giannakopoulou; Andreas Paraskevopoulos; Christos D. Zaroliagis (J. Discrete Algorithms, 2017)

On Mining Distances in Large-Scale Dynamic Graphs. - Serafino Cicerone; Mattia D'Emidio; Daniele Frigioni (ICTCS, 2018)

A tool for automatically selecting optimal model transformation chains. - Francesco Basciani; Davide Di Ruscio; Mattia D'Emidio; Daniele Frigioni; Alfonso Pierantonio; Ludovico Iovino (MoDELS (Companion), 2018)

Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. - Mattia D'Emidio; Gabriele Di Stefano; Daniele Frigioni; Alfredo Navarra (Inf. Comput., 2018)

Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study. - Mattia D'Emidio; Daniele Frigioni (ICCSA (2), 2019)

Special Issue on "Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems". - Mattia D'Emidio; Daniele Frigioni (Algorithms, 2019)

Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. - Mattia D'Emidio; Luca Forlizzi; Daniele Frigioni; Stefano Leucci 001; Guido Proietti (J. Comb. Optim., 2019)

Fully Dynamic 2-Hop Cover Labeling. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni (ACM J. Exp. Algorithmics, 2019)

Journey Planning Algorithms for Massive Delay-Prone Transit Networks. - Mattia D'Emidio; Imran Khan 008; Daniele Frigioni (Algorithms, 2020)

Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms. - Francesco Basciani; Mattia D'Emidio; Davide Di Ruscio; Daniele Frigioni; Ludovico Iovino; Alfonso Pierantonio (IEEE Trans. Software Eng., 2020)

Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem. - Serafino Cicerone; Mattia D'Emidio; Daniele Frigioni; Filippo Tirabassi Pascucci (ACM Trans. Spatial Algorithms Syst., 2021)

Sentient Spaces: Intelligent Totem Use Case in the ECSEL FRACTAL Project. - Federica Caruso; Tania Di Mascio; Daniele Frigioni; Luigi Pomante; Giacomo Valente; Stefano Delucchi; Paolo Burgio; Manuel Di Frangia; Luca Paganin; Chiara Garibotto; Damiano Vallocchia (DSD, 2022)

SLIDE-x-ML: System-Level Infrastructure for Dataset E-xtraction and Machine Learning Framework for High-Level Synthesis Estimations. - Vittoriano Muttillo; Vincenzo Stoico; Marco Santic; Giacomo Valente; Luigi Pomante; Daniele Frigioni (ICCD, 2024)

System-Level Timing Performance Estimation Based on a Unifying HW/SW Performance Metric. - Vittoriano Muttillo; Vincenzo Stoico; Giacomo Valente; Marco Santic; Luigi Pomante; Daniele Frigioni (PARMA-DITAM, 2025)