Daniele Frigioni

92 papers A* 1A 5B 12C 10Journal 40Unranked 22

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	A New HW/SW Co-Design Approach for Monitored Systems-on-Chip Development. ACM Trans. Embed. Comput. Syst. Giacomo Valente, Vittoriano Muttillo, Luigi Pomante, Daniele Frigioni, Tania Di Mascio
2025	—	`conf`	System-Level Timing Performance Estimation Based on a Unifying HW/SW Performance Metric. PARMA-DITAM Vittoriano Muttillo, Vincenzo Stoico, Giacomo Valente, Marco Santic, Luigi Pomante, Daniele Frigioni
2024	C	`conf`	SLIDE-x-ML: System-Level Infrastructure for Dataset E-xtraction and Machine Learning Framework for High-Level Synthesis Estimations. ICCD Vittoriano Muttillo, Vincenzo Stoico, Marco Santic, Giacomo Valente, Luigi Pomante, Daniele Frigioni
2023	C	`ed.`	23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023, Amsterdam, The Netherlands, September 7-8, 2023 ATMOS Daniele Frigioni, Philine Schiewe
2022	C	`conf`	Sentient Spaces: Intelligent Totem Use Case in the ECSEL FRACTAL Project. DSD Federica Caruso, Tania Di Mascio, Daniele Frigioni, Luigi Pomante, Giacomo Valente, Stefano Delucchi, Paolo Burgio, Manuel Di Frangia, Luca Paganin, Chiara Garibotto, Damiano Vallocchia
2021	J	`jnl`	Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem. ACM Trans. Spatial Algorithms Syst. Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni, Filippo Tirabassi Pascucci
2020	J	`jnl`	Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms. IEEE Trans. Software Eng. Francesco Basciani, Mattia D'Emidio, Davide Di Ruscio, Daniele Frigioni, Ludovico Iovino, Alfonso Pierantonio
2020	J	`jnl`	Journey Planning Algorithms for Massive Delay-Prone Transit Networks. Algorithms Mattia D'Emidio, Imran Khan, Daniele Frigioni
2019	—	`conf`	Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study. ICCSA (2) Mattia D'Emidio, Daniele Frigioni
2019	J	`jnl`	Fully Dynamic 2-Hop Cover Labeling. ACM J. Exp. Algorithmics Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2019	J	`jnl`	Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. J. Comb. Optim. Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
2019	J	`jnl`	Special Issue on "Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems". Algorithms Mattia D'Emidio, Daniele Frigioni
2018	—	`conf`	A tool for automatically selecting optimal model transformation chains. MoDELS (Companion) Francesco Basciani, Davide Di Ruscio, Mattia D'Emidio, Daniele Frigioni, Alfonso Pierantonio, Ludovico Iovino
2018	J	`jnl`	Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. Inf. Comput. Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2018	J	`jnl`	Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem. CoRR Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
2018	—	`conf`	On Mining Distances in Large-Scale Dynamic Graphs. ICTCS Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni
2017	J	`jnl`	Engineering graph-based models for dynamic timetable information systems. J. Discrete Algorithms Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Christos D. Zaroliagis
2016	A	`conf`	Characterizing the Computational Power of Anonymous Mobile Robots. ICDCS Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
2016	C	`conf`	Distance Queries in Large-Scale Fully Dynamic Complex Networks. IWOCA Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2016	—	`conf`	Improved Protocols for Luminous Asynchronous Robots. ICTCS Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2016	—	`conf`	On the Clustered Shortest-Path Tree Problem. ICTCS Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
2016	J	`jnl`	Rigorous DC Solution of Partial Element Equivalent Circuit Models. IEEE Trans. Circuits Syst. I Regul. Pap. Daniele Romano, Giulio Antonini, Mattia D'Emidio, Daniele Frigioni, Alessandro Mori, Mauro Bandinelli
2015	J	`jnl`	Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments. ACM J. Exp. Algorithmics Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios. Theory Comput. Syst. Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano
2015	J	`jnl`	Explore and repair graphs with black holes using mobile entities. Theor. Comput. Sci. Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
2015	B	`conf`	Path-Fault-Tolerant Approximate Shortest-Path Trees. SIROCCO Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
2015	J	`jnl`	Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
2015	—	`conf`	Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs. ICTCS Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
2014	J	`jnl`	A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci. Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2014	C	`conf`	Engineering Graph-Based Models for Dynamic Timetable Information Systems. ATMOS Alessio Cionini, Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Kalliopi Giannakopoulou, Andreas Paraskevopoulos, Christos D. Zaroliagis
2014	—	`conf`	Engineering shortest-path algorithms for dynamic networks. ICTCS Mattia D'Emidio, Daniele Frigioni
2014	B	`conf`	Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches. SEA Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
2014	J	`jnl`	Fully dynamic update of arc-flags. Networks Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2013	C	`ed.`	13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2013, Sophia Antipolis, France, September 5, 2013 ATMOS Daniele Frigioni, Sebastian Stiller
2013	B	`conf`	Dynamically Maintaining Shortest Path Trees under Batches of Updates. SIROCCO Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
2013	J	`jnl`	Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. Algorithmica Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio
2013	—	`conf`	Exploring and Making Safe Dangerous Networks Using Mobile Entities. ADHOC-NOW Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
2013	J	`jnl`	Pruning the Computation of Distributed Shortest Paths in Power-law Networks. Informatica (Slovenia) Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
2012	B	`conf`	Engineering a New Loop-Free Shortest Paths Routing Algorithm. SEA Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio
2012	—	`conf`	Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. MedAlg Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano
2012	B	`conf`	Fully Dynamic Maintenance of Arc-Flags in Road Networks. SEA Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale
2011	—	`conf`	A Speed-Up Technique for Distributed Shortest Paths Computation. ICCSA (2) Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio
2011	B	`conf`	Dynamic Arc-Flags in Road Networks. SEA Gianlorenzo D'Angelo, Daniele Frigioni, Camillo Vitale
2010	B	`conf`	A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation. SEA Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio
2010	J	`jnl`	Hybrid Formulation of the Equation Systems of the 3-D PEEC Model Based on Graph Algorithms. IEEE Trans. Circuits Syst. I Regul. Pap. Giulio Antonini, Daniele Frigioni, Giuseppe Miscione
2010	J	`jnl`	Partially dynamic efficient algorithms for distributed shortest paths. Theor. Comput. Sci. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
2010	J	`jnl`	VISTO: A new CBIR system for vector images. Inf. Syst. Tania Di Mascio, Daniele Frigioni, Laura Tarantino
2009	—	`conf`	Evaluating the Effectiveness and the Efficiency of a Vector Image Search Tool. HCI (9) Patrizia Di Marco, Tania Di Mascio, Daniele Frigioni, Massimo Gastaldi
2009	J	`jnl`	Recoverable Robustness for Train Shunting Problems. Algorithmic Oper. Res. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2009	—	`ch.`	Recoverable Robustness in Shunting and Timetabling. Robust and Online Large-Scale Optimization Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra, Michael Schachtebeck, Anita Schöbel
2009	J	`jnl`	Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases. J. Comb. Optim. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2008	C	`conf`	Delay Management Problem: Complexity Results and Robust Algorithms. COCOA Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2008	J	`jnl`	Dynamic Multi-level Overlay Graphs for Shortest Paths. Math. Comput. Sci. Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
2007	—	`conf`	Evaluation of VISTO: A New Vector Image Search TOol. HCI (3) Tania Di Mascio, Daniele Frigioni, Laura Tarantino
2007	C	`conf`	Maintenance of Multi-level Overlay Graphs for Timetable Queries. ATMOS Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
2007	J	`jnl`	Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation. J. Comput. Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alberto Petricola
2007	—	`conf`	Partially Dynamic Concurrent Update of Distributed Shortest Paths. ICCTA Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni
2007	C	`conf`	Robust Algorithms and Price of Robustness in Shunting Problems. ATMOS Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
2005	J	`jnl`	Partially dynamic maintenance of minimum weight hyperpaths. J. Discrete Algorithms Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni
2004	B	`conf`	Tuning a CBIR system for vector images: the interface support. AVI Tania Di Mascio, Marco Francesconi, Daniele Frigioni, Laura Tarantino
2003	J	`jnl`	A fully dynamic algorithm for distributed shortest paths. Theor. Comput. Sci. Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
2003	J	`jnl`	Fully dynamic shortest paths in digraphs with arbitrary arc weights. J. Algorithms Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
2003	J	`jnl`	Multiple zooming in geographic maps. Data Knowl. Eng. Daniele Frigioni, Laura Tarantino
2002	J	`jnl`	A general strategy for decomposing topological invariants of spatial databases and an application. Data Knowl. Eng. Serafino Cicerone, Daniele Frigioni, Paolino Di Felice
2002	J	`jnl`	On Formal Aspects of Zooming in Geographic Maps. Informatica (Slovenia) Daniele Frigioni, Laura Tarantino, Tania Di Mascio
2001	—	`ed.`	Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela
2001	J	`jnl`	An Experimental Study of Dynamic Algorithms for Transitive Closure. ACM J. Exp. Algorithmics Daniele Frigioni, Tobias Miller, Umberto Nanni, Christos D. Zaroliagis
2001	—	`conf`	Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ICTCS Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni
2001	J	`jnl`	Dynamic algorithms for classes of constraint satisfaction problems. Theor. Comput. Sci. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
2001	J	`jnl`	Semi-dynamic breadth-first search in digraphs. Theor. Comput. Sci. Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
2000	B	`conf`	A Fully Dynamic Algorithm for Distributed Shortest Paths. LATIN Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni
2000	—	`conf`	Decomposing Spatial Databases and Applications. DEXA Workshop Serafino Cicerone, Daniele Frigioni, Paolino Di Felice
2000	J	`jnl`	Dynamically Switching Vertices in Planar Graphs. Algorithmica Daniele Frigioni, Giuseppe F. Italiano
2000	J	`jnl`	Fully Dynamic Algorithms for Maintaining Shortest Paths Trees. J. Algorithms Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
2000	—	`conf`	Interacting with Geographic Databases: A Focus+Context Approach. DEXA Workshop Serafino Cicerone, Daniele Frigioni, Laura Tarantino
2000	—	`conf`	Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study. WAE Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
2000	—	`conf`	On the formalization of zoom-based interaction with geographic databases. SEBD Serafino Cicerone, Daniele Frigioni, Laura Tarantino
2000	B	`conf`	Supporting a Focus+Context Interaction Style for Spatial Databases. WISE Serafino Cicerone, Daniele Frigioni, Laura Tarantino
1999	—	`conf`	Interacting with Topological Invariants of Spatial Databases. DANTE Serafino Cicerone, Daniele Frigioni, Laura Tarantino, Paolino Di Felice
1998	J	`jnl`	A Uniform Approach to Semi-Dynamic Problems on Digraphs. Theor. Comput. Sci. Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
1998	A	`conf`	An Experimental Study of Dynamic Algorithms for Directed Graphs. ESA Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis
1998	J	`jnl`	Experimental Analysis of Dynamic Algorithms for the Single-Source Shortest-Path Problem. ACM J. Exp. Algorithmics Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone
1998	A	`conf`	Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights. ESA Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
1998	J	`jnl`	Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees. Algorithmica Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
1997	B	`conf`	Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae. ISAAC Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
1997	A	`conf`	Dynamically Switching Vertices in Planar Graphs (Extended Abstract). ESA Daniele Frigioni, Giuseppe F. Italiano
1997	—	`conf`	Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem. WAE Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone
1997	A	`conf`	Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs. STACS Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio
1996	B	`conf`	Counting Edges in a Dag. WG Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese
1996	A*	`conf`	Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). SODA Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
1994	C	`conf`	Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. CIAC Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
1994	—	`conf`	Incremental Algorithms for the Single-Source Shortest Path Problem. FSTTCS Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni