default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniele Frigioni
Person information
- affiliation: University of L'Aquila, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c47]Vittoriano Muttillo, Vincenzo Stoico, Marco Santic, Giacomo Valente, Luigi Pomante, Daniele Frigioni:
SLIDE-x-ML: System-Level Infrastructure for Dataset E-xtraction and Machine Learning Framework for High-Level Synthesis Estimations. ICCD 2024: 616-619- 2023
- [e3]Daniele Frigioni
, Philine Schiewe:
23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023, September 7-8, 2023, Amsterdam, The Netherlands. OASIcs 115, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-302-7 [contents] - 2022
- [c46]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: 741-747 - 2021
- [j37]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): 22:1-22:37 (2021) - 2020
- [j36]Mattia D'Emidio, Imran Khan, Daniele Frigioni:
Journey Planning Algorithms for Massive Delay-Prone Transit Networks. Algorithms 13(1): 2 (2020) - [j35]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): 251-279 (2020)
2010 – 2019
- 2019
- [j34]Mattia D'Emidio, Daniele Frigioni:
Special Issue on "Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems". Algorithms 12(11): 229 (2019) - [j33]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): 165-184 (2019) - [j32]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Fully Dynamic 2-Hop Cover Labeling. ACM J. Exp. Algorithmics 24(1): 1.6:1-1.6:36 (2019) - [c45]Mattia D'Emidio, Daniele Frigioni:
Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study. ICCSA (2) 2019: 72-81 - 2018
- [j31]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: 57-74 (2018) - [c44]Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni:
On Mining Distances in Large-Scale Dynamic Graphs. ICTCS 2018: 77-81 - [c43]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: 2-6 - [i2]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 abs/1801.10416 (2018) - 2017
- [j30]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 46-47: 40-58 (2017) - 2016
- [j29]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. 63-I(9): 1499-1510 (2016) - [c42]Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra:
Characterizing the Computational Power of Anonymous Mobile Robots. ICDCS 2016: 293-302 - [c41]Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Improved Protocols for Luminous Asynchronous Robots. ICTCS 2016: 136-148 - [c40]Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti:
On the Clustered Shortest-Path Tree Problem. ICTCS 2016: 263-268 - [c39]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Distance Queries in Large-Scale Fully Dynamic Complex Networks. IWOCA 2016: 109-121 - 2015
- [j28]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: 1.5:1.1-1.5:1.33 (2015) - [j27]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): 444-477 (2015) - [j26]Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra:
Explore and repair graphs with black holes using mobile entities. Theor. Comput. Sci. 605: 129-145 (2015) - [c38]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Path-Fault-Tolerant Approximate Shortest-Path Trees. SIROCCO 2015: 224-238 - [c37]Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra:
Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs. ICTCS 2015: 169-180 - [i1]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1507.01695 (2015) - 2014
- [j25]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Fully dynamic update of arc-flags. Networks 63(3): 243-259 (2014) - [j24]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci. 516: 1-19 (2014) - [c36]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: 46-61 - [c35]Mattia D'Emidio, Daniele Frigioni:
Engineering shortest-path algorithms for dynamic networks. ICTCS 2014: 265-269 - [c34]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: 283-294 - 2013
- [j23]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) - [j22]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Pruning the Computation of Distributed Shortest Paths in Power-law Networks. Informatica (Slovenia) 37(3): 253-265 (2013) - [c33]Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra:
Exploring and Making Safe Dangerous Networks Using Mobile Entities. ADHOC-NOW 2013: 136-147 - [c32]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Dynamically Maintaining Shortest Path Trees under Batches of Updates. SIROCCO 2013: 286-297 - [e2]Daniele Frigioni, Sebastian Stiller:
13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2013, September 5, 2013, Sophia Antipolis, France. OASIcs 33, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-58-3 [contents] - 2012
- [c31]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 - [c30]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
Engineering a New Loop-Free Shortest Paths Routing Algorithm. SEA 2012: 123-134 - [c29]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale:
Fully Dynamic Maintenance of Arc-Flags in Road Networks. SEA 2012: 135-147 - 2011
- [c28]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
A Speed-Up Technique for Distributed Shortest Paths Computation. ICCSA (2) 2011: 578-593 - [c27]Gianlorenzo D'Angelo, Daniele Frigioni, Camillo Vitale:
Dynamic Arc-Flags in Road Networks. SEA 2011: 88-99 - 2010
- [j21]Tania Di Mascio, Daniele Frigioni, Laura Tarantino:
VISTO: A new CBIR system for vector images. Inf. Syst. 35(7): 709-734 (2010) - [j20]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. 57-I(1): 249-261 (2010) - [j19]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) - [c26]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
2000 – 2009
- 2009
- [j18]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Recoverable Robustness for Train Shunting Problems. Algorithmic Oper. Res. 4(2): 102-116 (2009) - [j17]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) - [c25]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 - [p1]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 - 2008
- [j16]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): 709-736 (2008) - [c24]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Delay Management Problem: Complexity Results and Robust Algorithms. COCOA 2008: 458-468 - 2007
- [j15]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): 16-26 (2007) - [c23]Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni:
Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS 2007 - [c22]Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS 2007 - [c21]Tania Di Mascio, Daniele Frigioni, Laura Tarantino:
Evaluation of VISTO: A New Vector Image Search TOol. HCI (3) 2007: 836-845 - [c20]Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni:
Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA 2007: 32-38 - 2005
- [j14]Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni:
Partially dynamic maintenance of minimum weight hyperpaths. J. Discrete Algorithms 3(1): 27-46 (2005) - 2004
- [c19]Tania Di Mascio, Marco Francesconi, Daniele Frigioni, Laura Tarantino:
Tuning a CBIR system for vector images: the interface support. AVI 2004: 425-428 - 2003
- [j13]Daniele Frigioni, Laura Tarantino:
Multiple zooming in geographic maps. Data Knowl. Eng. 47(2): 207-236 (2003) - [j12]Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Fully dynamic shortest paths in digraphs with arbitrary arc weights. J. Algorithms 49(1): 86-113 (2003) - [j11]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) - 2002
- [j10]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) - [j9]Daniele Frigioni, Laura Tarantino, Tania Di Mascio:
On Formal Aspects of Zooming in Geographic Maps. Informatica (Slovenia) 26(3) (2002) - 2001
- [j8]Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis:
An Experimental Study of Dynamic Algorithms for Transitive Closure. ACM J. Exp. Algorithmics 6: 9 (2001) - [j7]Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio:
Semi-dynamic breadth-first search in digraphs. Theor. Comput. Sci. 250(1-2): 201-217 (2001) - [j6]Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Dynamic algorithms for classes of constraint satisfaction problems. Theor. Comput. Sci. 259(1-2): 287-305 (2001) - [c18]Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni:
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ICTCS 2001: 312-327 - [e1]Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela:
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 [contents] - 2000
- [j5]Daniele Frigioni, Giuseppe F. Italiano:
Dynamically Switching Vertices in Planar Graphs. Algorithmica 28(1): 76-103 (2000) - [j4]Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. J. Algorithms 34(2): 251-281 (2000) - [c17]Serafino Cicerone, Daniele Frigioni, Paolino Di Felice:
Decomposing Spatial Databases and Applications. DEXA Workshop 2000: 861-868 - [c16]Serafino Cicerone, Daniele Frigioni, Laura Tarantino:
Interacting with Geographic Databases: A Focus+Context Approach. DEXA Workshop 2000: 869-875 - [c15]Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni:
A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN 2000: 247-257 - [c14]Serafino Cicerone, Daniele Frigioni, Laura Tarantino:
On the formalization of zoom-based interaction with geographic databases. SEBD 2000: 401-414 - [c13]Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. WAE 2000: 218-229 - [c12]Serafino Cicerone, Daniele Frigioni, Laura Tarantino:
Supporting a Focus+Context Interaction Style for Spatial Databases. WISE 2000: 328-335
1990 – 1999
- 1999
- [c11]Serafino Cicerone, Daniele Frigioni, Laura Tarantino, Paolino Di Felice:
Interacting with Topological Invariants of Spatial Databases. DANTE 1999: 213-217 - 1998
- [j3]Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. Algorithmica 22(3): 250-274 (1998) - [j2]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: 5 (1998) - [j1]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) - [c10]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 - [c9]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 - 1997
- [c8]Daniele Frigioni, Giuseppe F. Italiano:
Dynamically Switching Vertices in Planar Graphs (Extended Abstract). ESA 1997: 186-199 - [c7]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 - [c6]Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio:
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. STACS 1997: 33-46 - [c5]Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone:
Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem. WAE 1997: 54-63 - 1996
- [c4]Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). SODA 1996: 212-221 - [c3]Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese:
Counting Edges in a Dag. WG 1996: 85-100 - 1994
- [c2]Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. CIAC 1994: 136-151 - [c1]Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni:
Incremental Algorithms for the Single-Source Shortest Path Problem. FSTTCS 1994: 113-124
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 21:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
