Home Docenti Daniele Frigioni

Professore Ordinario

Daniele Frigioni

0000-0002-2180-8813

Algorithms engineering, graph algorithms and data structures
11 Ingegneria Informatica
ING-INF/05 - Sistemi di elaborazione delle informazioni
Information Engineering

Curriculum   Scholar DBLP Scopus Research Gate

Publications

Volumes Edited

  • D. Frigioni, P. Schiewe (Eds.). Algorithmic Approaches for Transportation Modelling, Optimization, and Systems.  Proceedings of the 23rd Symposium (ATMOS2023), September 7-8, 2023, Amsterdam, The Netherlands.  OASIcs, vol. 115, Schloss Dagstuhl, 2023.
  • D. Frigioni, S. Stiller (Eds.). Algorithmic Approaches for Transportation Modelling, Optimization, and Systems.  Proceedings of the 13th Workshop (ATMOS2013), September 5, 2013, Sophia Antipolis, France.  OASIcs, vol. 33, Schloss Dagstuhl, 2013.
  • G. S. Brodal, D. Frigioni, A. Marchetti-Spaccamela (Eds).  Algorithm Engineering.  Proceedings of the 5th International Workshop (WAE2001), Aarhus, Denmark, August 28-31, 2001. Lecture Notes in Computer Science, vol. 2141, Springer-Verlag, 2001.

Book Chapters

  • S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra, M. Schachtebeck, A. Schoebel. Recoverable Robustness in Shunting and Timetabling. Volume on Robust and online large-scale optimization. Lecture Notes in Computer Science , vol. 5868, pp. 28-60, Springer-Verlag, 2009.
  • G. D'Angelo, M. D'Emidio, D. Frigioni. Distance Vector Algorithms for Distributed Shortest Paths Computation in Dynamic Networks. In Adamatzky, A (Ed.), Shortest path solvers. From software to wetware, vol. 32, pp. 99-144, Springer, 2018.

Journal papers

  • S. Cicerone, M. D'Emidio, D. Frigioni, F. Tirabassi-Pascucci. Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem. ACM Transactions on Spatial Algorithms and Systems, vol. 7, n.4 (2021), pp. 1-37, ACM.

  • F. Basciani, M. D'Emidio, D. Di Ruscio, D. Frigioni, L. Iovino, A. Pierantonio.  Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms.  IEEE Transactions on Software Engineering, vol. 46, n. 3 (2020), pp. 251-279, IEEE.

  • M. D'Emidio, I. Khan, D. Frigioni. Journey Planning Algorithms for Massive Delay-prone Transit Networks. Algorithms, vol. 13, n. 1 (2020), Article n. 2, MDPI.

  • M. D'Emidio, D. Frigioni. Algorithms Engineering: Towards Practically Efficient Solutions to Combinatorial Problems. Algorithms, vol. 12, n.11 (2019), Article n. 229, MDPI.

  • M. D'Emidio, L. Forlizzi, D. Frigioni, S. Leucci, G. Proietti. Hardness, Approximability, and Fixed-parameter Tractability of the Clustered Shortest-path Tree Problem. Journal of Combinatorial Optimization, vol. 38, n.1 (2019), pp. 165-184, Springer.

  • G. D'Angelo, M. D'Emidio, D. Frigioni. Fully Dynamic 2-Hop Cover Labeling. ACM Journal of Experimental Algorithmics, vol. 24, n.1 (2019), Article 1.6, ACM.

  • M. D'Emidio, G. Di Stefano, D. Frigioni, A. Navarra. Characterizing the Computational Power of Mobile Robots on Graphs and Implications for the Euclidean Plane. Information and Computation, vol. 263 (2018), pp. 57-74, Elsevier.

  • A. Cionini, G. D'Angelo, M. D'Emidio, D. Frigioni, K. Giannakopoulou, A. Paraskevopoulos, C. Zaroliagis.  Engineering Graph-Based Models for Dynamic Timetable Information Systems.  Journal of Discrete Algorithms, vol. 46-47 (2017) pp. 40-58, Elsevier.

  • D. Romano, G. Antonini, M. D’Emidio, D. Frigioni, A. Mori, M. Bandinelli. Rigorous DC Solution of Partial Element Equivalent Circuit Models. IEEE Transactions on Circuits and Systems-I: Regular Papers, vol. 63, n. 9 (2016), pp. 1499-1510, IEEE.

  • M. D'Emidio, D. Frigioni, A. Navarra.  Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs. Electronic Notes in Theoretical Computer Science, vol. 322 (2016), pp. 169-180, Elsevier. 

  • M. D’Emidio, D. Frigioni, A. Navarra.  Explore and repair graphs with black holes using mobile entities. Theoretical Computer Science, vol. 605 (2015), pp. 129-145, Elsevier.

  • A. D'Andrea, M. D'Emidio, D. Frigioni, S. Leucci, G. Proietti.  Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. Journal of Experimental Algorithmics, vol. 20, n. 1 (2015), Article 1.5, ACM. 

  • G. D'Angelo, M. D'Emidio, D. Frigioni, D. Romano. Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. Theory of Computing Systems, vol. 57, n. 2 (2015), pp. 444-477, Springer.

  • G. D'Angelo, M. D'Emidio, D. Frigioni. Fully Dynamic Update of Arc-Flags. Networks, vol. 63, n. 3, (2014), pp. 243-259, Wiley.

  • G. D'Angelo, M. D'Emidio, D. Frigioni. A Loop-free Shortest-path Routing Algorithm for Dynamic Networks. Theoretical Computer Science, vol. 516, (2014), pp. 1-19, Elsevier.

  • G. D'Angelo, M. D'Emidio, D. Frigioni. Pruning the Computation of Distributed Shortest Paths in Power-law Networks. Informatica, vol. 37, n. 3 (2013), pp. 253-265, Slovenian Society Informatika.

  • S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, V. Maurizio. Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica, vol. 66, n. 1 (2013), pp. 51-86, Springer.

Conference papers

  • F. Caruso, T. Di Mascio, D. Frigioni, L. Pomante, G. Valente, S. Delucchi, P. Burgio, M. Di Frangia, L. Paganin, C. Garibotto, D. Vallocchia. Sentient Spaces: Intelligent Totem Use Case in the ECSEL FRACTAL Project. Proceedings 25th Euromicro Conference on Digital System Design (DSD22), pag. 741-747, IEEE, 2022.

  • M. D'Emidio, D. Frigioni. Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: an Experimental Study. Proceedings 19th Int. Conf. on Computational Science and its Applications (ICCSA19).  Lecture Notes in Computer Science, n. 11620, pp. 72-81, Springer, 2019.

  • Francesco Basciani, Mattia D'Emidio, Davide Di Ruscio, Daniele Frigioni, Ludovico Iovino, Alfonso Pierantonio. A Tool for Automatically Selecting Optimal Model Transformation Chains. Proceedings 21st International Conference on Model Driven Engineering Languages and Systems (MODELS18).  Companion Proceedings, pp. 2-6, ACM, 2018.
  • S. Cicerone, M. D'Emidio, D. Frigioni. On Mining Distances in Large-Scale Dynamic Graphs. Proceedings 19th Italian Conference on Theoretical Computer Science (ICTCS18).  CEUR Workshop Proceedings, vol. 2243, pp. 77-81, 2018.

  • G. D'Angelo, M. D'Emidio, D. Frigioni. Distance Queries in Large-Scale Fully Dynamic Complex Networks. Proceedings 27th International Workshop on Combinatorial Algorithms (IWOCA16), Lecture Notes in Computer Science, n. 9843, pp. 109-121, Springer, 2016.

  • M. D'Emidio, D. Frigioni, A. Navarra.  Characterizing the Computational Power of Anonymous Mobile Robots. Proceedings 36th IEEE International Conference on Distributed Computing Systems (ICDCS 2016), pp. 293-302, IEEE, 2016.

  • M. D'Emidio, L. Forlizzi, D. Frigioni, S. Leucci, G. Proietti. On the Clustered Shortest-Path Tree Problem. Proceedings 17th Italian Conference on Theoretical Computer Science (ICTCS16). CEUR Workshop Proceedings, vol. 1720, pp. 263-268, 2016.
  • M. D'Emidio, G. Di Stefano, D. Frigioni, A. Navarra.  Improved Protocols for Luminous Asynchronous Robots. Proceedings 17th Italian Conference on Theoretical Computer Science (ICTCS16).  CEUR Workshop Proceedings,  vol. 1720, pp. 136-148, 2016. 
  • A. D'Andrea, M. D'Emidio, D. Frigioni, S. Leucci, G. Proietti.  Path-Fault-Tolerant Approximate Shortest-Path Trees. Proc. 22th Colloquium on Structural Information and Communication Complexity (SIROCCO15).  Lecture Notes in Computer Science, n. 9439, pp. 224-238, Springer, 2015.

  • A. Cionini, G. D'Angelo, M. D'Emidio, D. Frigioni, K. Giannakopoulou, A. Paraskevopoulos, C. Zaroliagis. Engineering Graph-Based Models for Dynamic Timetable Information Systems. Proceedings 14th ATMOS Workshop (ATMOS14). Open Access Series in Informatics, vol. 42, pp. 46-62, Schloss Daghstul, 2014.

  • M. D'Emidio, D. Frigioni. Engineering Shortest-Path Algorithms for Dynamic Networks. Proceedings 15th Italian Conference on Theoretical Computer Science (ICTCS14). CEUR Workshop Proceedings, vol. 1231, pp. 265-269, 2014.

  • A. D'Andrea, M. D'Emidio, D. Frigioni, S. Leucci, G. Proietti. Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. Proc. 13th International Symposium on Experimental Algorithmics (SEA2014). Lecture Notes in Computer Science, n. 8504, pp. 283-294, Springer, 2014.

  • A. D'Andrea, M. D'Emidio, D. Frigioni, S. Leucci, G. Proietti.  Dynamically Maintaining Shortest Path Trees Under Batches Of Updates. Proc. 20th Colloquium on Structural Information and Communication Complexity (SIROCCO13).  Lecture Notes in Computer Science, n. 8179, pp. 286-297, Springer, 2013.

  • M. D'Emidio, D. Frigioni, A. Navarra.  Exploring and Making Safe Dangerous Networks Using Mobile Entities. Proc. 12th International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW13).  Lecture Notes in Computer Science, n. 7960, pp. 136-147, Springer, 2013.

  • G. D'Angelo, M. D'Emidio, D. Frigioni, D. Romano.  Enhancing the Computation of Distributed Shortest Paths in Real Dynamic Networks. Proc. 1st Mediterranean Conference on Algorithms (MedAlg12).  Lecture Notes in Computer Science, n. 7659, pp. 148-158, Springer, 2012.

  • G. D'Angelo, M. D'Emidio, D. Frigioni, D. Romano. Efficient Algorithms for Distributed Shortest Paths on Power-Law Networks. Proc. 13th Italian Conference on Theoretical Computer Science (ICTCS12), pp. 94-97, 2012.

  • G. D'Angelo, M. D'Emidio, D. Frigioni, V. Maurizio.  Engineering a New Loop-Free Shortest Paths Routing Algorithm. Proc. 11th Int. Simposium on Experimental Algorithmics (SEA12).  Lecture Notes in Computer Science, n. 7276, pp. 123-134, Springer, 2012.

  • G. D'Angelo, M. D'Emidio, D. Frigioni, C. Vitale.  Fully Dynamic Maintenance of Arc Flags in Road Networks.  Proc. 11th Int. Simposium on Experimental Algorithmics (SEA12).  Lecture Notes in Computer Science, n. 7276, pp. 135-147, Springer, 2012.

  • G. D'Angelo, M. D'Emidio, D. Frigioni, V. Maurizio.  A Speed-Up Technique for Distributed Shortest Paths Computation.  Proceedings 11th Int. Conf. on Computational Science and its Applications (ICCSA11).  Lecture Notes in Computer Science, n. 6783, pp. 578-593, Springer, 2011.

  • G. D'Angelo, D. Frigioni, C. Vitale.  Dynamic Arc Flags in Road Networks. Proceedings 10th International Symposium on Experimental Algorithms (SEA11).  Lecture Notes in Computer Science, n. 6630, pp. 88-99, Springer, 2011.

  • G. D'Angelo, D. Frigioni, V. Maurizio.  An Experimental Study of Distributed Algorithms for Shortest Paths on Real Networks. Proceedings of the 12th Italian Conference on Theoretical Computer Science (ICTCS10), 2010.

  • S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, V. Maurizio.  A New Fully Dynamic Algorithm for Distributed Shortest Paths and its Experimental Evaluation. Proceedings 9th International Symposium on Experimental Algorithms (SEA10). Lecture Notes in Computer Science, n. 6049, pp. 59-70, Springer, 2010.

  • P. Di Marco, T. Di Mascio, D. Frigioni, M. Gastaldi.  Evaluating the Effectiveness and the Efficiency of a Vector Image Search Tool. Proceedings of 13th International Conference on Human Computer Interaction (HCII09). Lecture Notes in Computer Science, n. 5618, pp. 259-268, Springer, 2009.

  • S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra. Delay Management Problem: Complexity Results and Robust Algorithms. Proceedings Int. Conference on Combinatorial Optimization and Applications (COCOA08).  Lecture Notes in Computer Science, n. 5165, pp. 458-468, Springer, 2008.

  • G. Miscione, G. Antonini, D. Frigioni.  A Mixed Nodal-Mesh Formulation of the PEEC Method Based on Efficient Graph Algorithms.  Proceedings IEEE International Symposium on Electromagnetic Compatibility (EMC08), pp. 1-6, IEEE, 2008. 

  • F. Bruera, S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni. Maintenance of Multi-level Overlay Graphs for Timetable Queries. Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS07), pp. 226-242, IBFI Schloss Dagstuhl, 2007.

  • S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, A. Navarra. Robust Algorithms and Price of Robustness in Shunting Problems. Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS07), pp. 175-190, IBFI Schloss Dagstuhl, 2007.

  • T. Di Mascio, D. Frigioni, L. Tarantino.  Evaluation of VISTO: a New Vector Image Search TOol. Proceedings of 12th International Conference on Human Computer Interaction (HCII07). Lecture Notes in Computer Science, vol. 4552, pp. 836-845, Springer, 2007.

  • T. Di Mascio, D. Frigioni, L. Tarantino.  Evaluation of a CBIR System for Vector Images.  Proceedings of the Computer Human Interaction (CHItaly07).

  • G. D'Angelo, S. Cicerone, G. Di Stefano, D. Frigioni.  Partially Dynamic Concurrent Update of Distributed Shortest Paths. Proceedings IEEE International Conference on Computing: Theory and Applications (ICCTA07), pp. 32-38, IEEE-Press, 2007.

  • T. Di Mascio, D. Frigioni, L. Tarantino.  A Visual Environment for Tuning a Content-Based Vector Image Retrieval Engine. Proceedings of 11th International Conference on Human Computer Interaction (HCII05). Lawrence Erlbaum Associates, 2005.

  • T. Di Mascio, M. Francesconi, D. Frigioni, L. Tarantino.  Tuning a CBIR System for Vector Images: The Interface Support. Proceedings of the ACM International Conference on Advanced Visual Interfaces (AVI04), pp. 425-428, ACM Press, 2004.

  • D. Frigioni, L. Tarantino.  Interactive Poster: A Zooming Model for Geographic Maps.  Proceedings of the IEEE International Workshop on Information Visualization (InfoVis02), pp. 16-17, IEEE Press, 2002.

  • G. Ausiello, P. G. Franciosa, D. Frigioni.  Directed Hypergraphs: Problems, Algorithmic Results and a Novel Decremental Approach.  Proceedings of the 7th Italian Conference on Theoretical Computer Science (ICTCS01).  Lecture Notes in Computer Science, vol. 2202, pp. 312-327, Springer, 2001.

  • C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, U. Nanni.  Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.  Proceedings of the 3rd Workshop on Algorithm Engineering (WAE2000).  Lecture Notes in Computer Science, vol. 1982, pp. 218-229, Springer, 2000.

  • S. Cicerone, G. Di Stefano, D. Frigioni, U. Nanni.  A Fully Dynamic Algorithm for Distributed Shortest Paths.  Proceedings of the Latin American Theoretical INformatics (LATIN2000).  Lecture Notes in Computer Science, vol. 1776, pp. 247-256, Springer, 2000.

  • S. Cicerone, D. Frigioni, P. Di Felice.  Decomposing Spatial Databases and Applications.  Proceedings of the IEEE Workshop on Advanced Spatial Data Management (ASDM2000), pp. 861-868, IEEE Press, 2000.

  • S. Cicerone, D. Frigioni, L. Tarantino.  Interacting with Geographic Databases: a Focus+Context Approach.  Proceedings of the IEEE Workshop on Advanced Spatial Data Management (ASDM2000), pp. 869-876, IEEE Press, 2000.

  • S. Cicerone, D. Frigioni, L. Tarantino.  Supporting a Focus+Context Interaction Style for Spatial Databases.  Proceedings of the IEEE International Conference on Web Information Systems Engineering(WISE2000), pp. 317-324, IEEE Press, 2000.

  • S. Cicerone, D. Frigioni, L. Tarantino.  On the Formalization of Zoom-based Interaction with Geographic Databases.  Proceedings of the annual Italian conference on Sistemi Evoluti per Basi di Dati (SEBD2000), pp. 401-414, 2000.

  • S. Cicerone, D. Frigioni, L. Tarantino, P. Di Felice.  Interacting with Topological Invariants of Spatial Databases.  Proceedings of the IEEE Symposium on Database Applications in Non-Traditional Environments(DANTE99), pp. 114-119, IEEE Press, 1999.

  • D. Frigioni, A. Marchetti-Spaccamela, U. Nanni. Fully dynamic shortest path and negative cycle detection on digraphs with arbitrary arc weights. Proceedings of the 6th annual European Symposium on Algorithms (ESA98).  Lecture Notes in Computer Science, vol. 1461, pp. 320-331, Springer, 1998.

  • D. Frigioni, T. Miller, U. Nanni, G. Pasqualone, G. Shaefer, C. Zaroliagis.  An Experimental Study of Dynamic Algorithms for Directed Graph.  Proceedings of the 6th European Symposium on Algorithms (ESA98).  Lecture Notes in Computer Science, vol. 1461, pp. 368-380, Springer, 1998.

  • G. Ausiello, P. G. Franciosa, D. Frigioni, R. Giaccio.  Decremental Maintenance of Reachability in Hypergraphs and Minimum Model of Horn Formulae. Proceedings 8th International Symposium on Algorithms and Computation (ISAAC97). Lecture Notes in Computer Science, vol. 1350, pp. 122-131, Springer, 1997.

  • D. Frigioni, G. F. Italiano.  Dynamically Switching Vertices in Planar Graphs. Proceedings of the 5th European Symposium on Algorithms (ESA97).  Lecture Notes in Computer Science, vol. 1284, pp. 186-199, Springer, 1997.

  • P. G. Franciosa, D. Frigioni, R. Giaccio.  Semi Dynamic Shortest Paths and Breadth First Search in Digraphs.  Proceedings 14th Symposium on Theoretical Aspects of Computer Science (STACS97).  Lecture Notes in Computer Science, vol. 1200, pp. 33-46, Springer, 1997.

  • D. Frigioni, M. Ioffreda, U. Nanni, G. Pasqualone.  Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem.  Proceedings of the 1st Workshop on Algorithm Engineering (WAE97), pp. 54-63, 1997.

  • D. Frigioni, A. Marchetti-Spaccamela, U. Nanni.  Fully Dynamic Output Bounded Single Source Shortest Path Problem.  Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), pp. 212-221, ACM-SIAM Press, 1996.

  • S. Cicerone, D. Frigioni, U. Nanni, F. Pugliese.  Counting Edges in a Dag.  Proceedings 22nd Int. Workshop on Graph Theoretic Concepts in Computer Science (WG96).  Lecture Notes in Computer Science, vol. 1197, pp. 85-100, Springer, 1996.

  • D. Frigioni, A. Marchetti-Spaccamela, U. Nanni.  Incremental Algorithms for the Single Source Shortest Path Problem. Proceedings 14th Foundation of Software Technology and Th. Computer Science (FST&TCS94).  Lecture Notes in Computer Science, vol. 880, pp. 113-124, Springer, 1994.

  • D. Frigioni, A. Marchetti-Spaccamela, U. Nanni.  Dynamization of the Backtrack-free Search for the Constraint Satisfaction Problem.  Proceedings of the 2nd Italian Conference on Algorithms and Complexity (CIAC94).  Lecture Notes in Computer Science vol. 778, pp. 136-151, Springer, 1994.

 

Menu

Contatti

daniele.frigioni@univaq.it
0862434448

Indirizzo

Edificio Coppito 1, Room 2089, II Piano, Corridoio DISIM
Via Vetoio - 67100 L'Aquila, Italy

Annunci

Non ci sono annunci disponibili.

Sezioni

Cerca per Tag

Tesi di Laurea Seminari Lezioni
Utilizziamo i cookie per offrirti il ​​nostro servizio. Continuando a utilizzare questo sito acconsenti al nostro utilizzo dei cookie come descritto nella nostra policy.