Daniele Frigioni

Publication Activity (10 Years)

Years Active: 1994-2022
Publications (10 Years): 24

Top Topics

Computational Power

Top Venues

ACM J. Exp. Algorithmics

Publications

Federica Caruso, Tania Di Mascio, Daniele Frigioni, Luigi Pomante, Giacomo Valente, Stefano Delucchi, Paolo Burgio, Manuel Di Frangia, Luca Paganin, Chiara Garibotto, Damiano Vallocchia
Sentient Spaces: Intelligent Totem Use Case in the ECSEL FRACTAL Project. DSD (2022)
Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni, Filippo Tirabassi Pascucci
Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem. ACM Trans. Spatial Algorithms Syst. 7 (4) (2021)
Francesco Basciani, Mattia D'Emidio, Davide Di Ruscio, Daniele Frigioni, Ludovico Iovino, Alfonso Pierantonio
Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms. IEEE Trans. Software Eng. 46 (3) (2020)
Mattia D'Emidio, Imran Khan, Daniele Frigioni
Journey Planning Algorithms for Massive Delay-Prone Transit Networks. Algorithms 13 (1) (2020)
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim. 38 (1) (2019)
Mattia D'Emidio, Daniele Frigioni
Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study. ICCSA (2) (2019)
Mattia D'Emidio, Daniele Frigioni
Special Issue on "Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems". Algorithms 12 (11) (2019)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Fully Dynamic 2-Hop Cover Labeling. ACM J. Exp. Algorithmics 24 (1) (2019)
Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. Inf. Comput. 263 (2018)
Francesco Basciani, Davide Di Ruscio, Mattia D'Emidio, Daniele Frigioni, Alfonso Pierantonio, Ludovico Iovino
A tool for automatically selecting optimal model transformation chains. MoDELS (Companion) (2018)
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem. CoRR (2018)
Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni
On Mining Distances in Large-Scale Dynamic Graphs. ICTCS (2018)
Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Christos D. Zaroliagis
Engineering graph-based models for dynamic timetable information systems. J. Discrete Algorithms (2017)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Distance Queries in Large-Scale Fully Dynamic Complex Networks. IWOCA (2016)
Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
Characterizing the Computational Power of Anonymous Mobile Robots. ICDCS (2016)
Daniele Romano, Giulio Antonini, Mattia D'Emidio, Daniele Frigioni, Alessandro Mori, Mauro Bandinelli
Rigorous DC Solution of Partial Element Equivalent Circuit Models. IEEE Trans. Circuits Syst. I Regul. Pap. (9) (2016)
Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Improved Protocols for Luminous Asynchronous Robots. ICTCS (2016)
Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs. Electron. Notes Theor. Comput. Sci. 322 (2016)
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
On the Clustered Shortest-Path Tree Problem. ICTCS (2016)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. Theory Comput. Syst. 57 (2) (2015)
Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
Explore and repair graphs with black holes using mobile entities. Theor. Comput. Sci. 605 (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. ACM J. Exp. Algorithmics 20 (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Path-Fault-Tolerant Approximate Shortest-Path Trees. SIROCCO (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. SEA (2014)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Fully dynamic update of arc-flags. Networks 63 (3) (2014)
Mattia D'Emidio, Daniele Frigioni
Engineering shortest-path algorithms for dynamic networks. ICTCS (2014)
Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Christos D. Zaroliagis
Engineering Graph-Based Models for Dynamic Timetable Information Systems. ATMOS (2014)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci. 516 (2014)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Dynamically Maintaining Shortest Path Trees under Batches of Updates. SIROCCO (2013)
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) (2013)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Pruning the Computation of Distributed Shortest Paths in Power-law Networks. Informatica (Slovenia) 37 (3) (2013)
Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
Exploring and Making Safe Dangerous Networks Using Mobile Entities. ADHOC-NOW (2013)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale
Fully Dynamic Maintenance of Arc-Flags in Road Networks. SEA (2012)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio
Engineering a New Loop-Free Shortest Paths Routing Algorithm. SEA (2012)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano
Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. MedAlg (2012)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio
A Speed-Up Technique for Distributed Shortest Paths Computation. ICCSA (2) (2011)
Gianlorenzo D'Angelo, Daniele Frigioni, Camillo Vitale
Dynamic Arc-Flags in Road Networks. SEA (2011)
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)
Tania Di Mascio, Daniele Frigioni, Laura Tarantino
VISTO: A new CBIR system for vector images. Inf. Syst. 35 (7) (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) (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. Circuits Syst. I Regul. Pap. (1) (2010)
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Recoverable Robustness for Train Shunting Problems. Algorithmic Oper. Res. 4 (2) (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) (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)
Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
Dynamic Multi-level Overlay Graphs for Shortest Paths. Math. Comput. Sci. 1 (4) (2008)
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Delay Management Problem: Complexity Results and Robust Algorithms. COCOA (2008)
Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni
Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA (2007)
Tania Di Mascio, Daniele Frigioni, Laura Tarantino
Evaluation of VISTO: A New Vector Image Search TOol. HCI (3) (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, Alberto Petricola
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. J. Comput. 2 (9) (2007)
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS (2007)
Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni
Partially dynamic maintenance of minimum weight hyperpaths. J. Discrete Algorithms 3 (1) (2005)
Tania Di Mascio, Marco Francesconi, Daniele Frigioni, Laura Tarantino
Tuning a CBIR system for vector images: the interface support. AVI (2004)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Fully dynamic shortest paths in digraphs with arbitrary arc weights. J. Algorithms 49 (1) (2003)
Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. 297 (1-3) (2003)
Daniele Frigioni, Laura Tarantino
Multiple zooming in geographic maps. Data Knowl. Eng. 47 (2) (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) (2002)
Daniele Frigioni, Laura Tarantino, Tania Di Mascio
On Formal Aspects of Zooming in Geographic Maps. Informatica (Slovenia) 26 (3) (2002)
Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ICTCS (2001)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Dynamic algorithms for classes of constraint satisfaction problems. Theor. Comput. Sci. 259 (1-2) (2001)
Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis
An Experimental Study of Dynamic Algorithms for Transitive Closure. ACM J. Exp. Algorithmics 6 (2001)
Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
Semi-dynamic breadth-first search in digraphs. Theor. Comput. Sci. 250 (1-2) (2001)
Serafino Cicerone, Daniele Frigioni, Laura Tarantino
Supporting a Focus+Context Interaction Style for Spatial Databases. WISE (2000)
Serafino Cicerone, Daniele Frigioni, Laura Tarantino
Interacting with Geographic Databases: A Focus+Context Approach. DEXA Workshop (2000)
Daniele Frigioni, Giuseppe F. Italiano
Dynamically Switching Vertices in Planar Graphs. Algorithmica 28 (1) (2000)
Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN (2000)
Serafino Cicerone, Daniele Frigioni, Laura Tarantino
On the formalization of zoom-based interaction with geographic databases. SEBD (2000)
Serafino Cicerone, Daniele Frigioni, Paolino Di Felice
Decomposing Spatial Databases and Applications. DEXA Workshop (2000)
Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. WAE (2000)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. J. Algorithms 34 (2) (2000)
Serafino Cicerone, Daniele Frigioni, Laura Tarantino, Paolino Di Felice
Interacting with Topological Invariants of Spatial Databases. DANTE (1999)
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)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. ESA (1998)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. Algorithmica 22 (3) (1998)
Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone
Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem. ACM J. Exp. Algorithmics 3 (1998)
Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
A Uniform Approach to Semi-Dynamic Problems on Digraphs. Theor. Comput. Sci. 203 (1) (1998)
Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae. ISAAC (1997)
Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem. WAE (1997)
Daniele Frigioni, Giuseppe F. Italiano
Dynamically Switching Vertices in Planar Graphs (Extended Abstract). ESA (1997)
Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. STACS (1997)
Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
Counting Edges in a Dag. WG (1996)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). SODA (1996)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. CIAC (1994)
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
Incremental Algorithms for the Single-Source Shortest Path Problem. FSTTCS (1994)