A Speed-Up Technique for Distributed Shortest Paths Computation. - Gianlorenzo D'Angelo; Mattia D'Emidio; Daniele Frigioni; Vinicio Maurizio (ICCSA (2), 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)

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 (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)

Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings. - Feliciano Colella; Mattia D'Emidio; Guido Proietti (ICTCS/CILC, 2017)

Multi-robot Task Allocation Problem: Current Trends and New Ideas. - Mattia D'Emidio; Imran Khan 008 (ICTCS/CILC, 2017)

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)

EASIER: An Evolutionary Approach for Multi-objective Software ArchItecturE Refactoring. - Davide Arcelli; Vittorio Cortellessa; Mattia D'Emidio; Daniele Di Pompeo (ICSA, 2018)

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)

Report on SEA 2018. - Gianlorenzo D'Angelo; Mattia D'Emidio (Bull. EATCS, 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)

Dynamic Public Transit Labeling. - Mattia D'Emidio; Imran Khan 008 (ICCSA (1), 2019)

Priority Scheduling in the Bamboo Garden Trimming Problem. - Mattia D'Emidio; Gabriele Di Stefano; Alfredo Navarra (SOFSEM, 2019)

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

Bamboo Garden Trimming Problem: Priority Schedulings. - Mattia D'Emidio; Gabriele Di Stefano; Alfredo Navarra (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)

Collision-free allocation of temporally constrained tasks in multi-robot systems. - Mattia D'Emidio; Imran Khan 008 (Robotics Auton. Syst., 2019)

Leader Election and Compaction for Asynchronous Silent Programmable Matter. - Gianlorenzo D'Angelo; Mattia D'Emidio; Shantanu Das 001; Alfredo Navarra; Giuseppe Prencipe (AAMAS, 2020)

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. - Gianlorenzo D'Angelo; Mattia D'Emidio; Shantanu Das 001; Alfredo Navarra; Giuseppe Prencipe (IEEE Access, 2020)

Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs. - Mattia D'Emidio (Algorithms, 2020)

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)

On the effectiveness of the genetic paradigm for polygonization. - Serafino Cicerone; Mattia D'Emidio; Gabriele Di Stefano; Alfredo Navarra (Inf. Process. Lett., 2021)

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)

Digraph k-Coloring Games: From Theory to Practice. - Andrea D'Ascenzo; Mattia D'Emidio; Michele Flammini; Gianpiero Monaco (SEA, 2022)

Top-k Distance Queries on Large Time-Evolving Graphs. - Andrea D'Ascenzo; Mattia D'Emidio (IEEE Access, 2023)

On Mining Dynamic Graphs for k Shortest Paths. - Andrea D'Ascenzo; Mattia D'Emidio (ASONAM (1), 2024)

Indexing Graphs for Shortest Beer Path Queries. - David Coudert; Andrea D'Ascenzo; Mattia D'Emidio (ATMOS, 2024)

Improved Algorithms for the Capacitated Team Orienteering Problem. - Gianlorenzo D'Angelo; Mattia D'Emidio; Esmaeil Delfaraz; Gabriele Di Stefano (ATMOS, 2024)

Digraph k-Coloring Games: New Algorithms and Experiments. - Andrea D'Ascenzo; Mattia D'Emidio; Michele Flammini; Gianpiero Monaco (J. Artif. Intell. Res., 2024)

D-hash/ShortestBeerDistanceQueries. - David Coudert; Andrea D'Ascenzo; Mattia D'Emidio (DROPS Artifacts, 2024)

On the Performance of Mildly Greedy Players in k-Coloring Games. - Vittorio Bilò; Andrea D'Ascenzo; Mattia D'Emidio; Giuseppe F. Italiano (MFCS, 2025)