Mattia D'Emidio

According to our database, Mattia D'Emidio authored at least 47 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Top-k Distance Queries on Large Time-Evolving Graphs.

Andrea D'Ascenzo, Mattia D'Emidio

IEEE Access, 2023

2022

Digraph k-Coloring Games: From Theory to Practice.

Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

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

On the effectiveness of the genetic paradigm for polygonization.

Serafino Cicerone, Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra

Inf. Process. Lett., 2021

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

Journey Planning Algorithms for Massive Delay-Prone Transit Networks.

Mattia D'Emidio, Imran Khan, Daniele Frigioni

Algorithms, 2020

Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs.

Mattia D'Emidio

Algorithms, 2020

Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction.

Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe

IEEE Access, 2020

Leader Election and Compaction for Asynchronous Silent Programmable Matter.

Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Collision-free allocation of temporally constrained tasks in multi-robot systems.

Mattia D'Emidio, Imran Khan

Robotics Auton. Syst., 2019

Fully Dynamic 2-Hop Cover Labeling.

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni

ACM J. Exp. Algorithmics, 2019

Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem.

Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti

J. Comb. Optim., 2019

Bamboo Garden Trimming Problem: Priority Schedulings.

Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra

Algorithms, 2019

Special Issue on "Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems".

Mattia D'Emidio, Daniele Frigioni

Algorithms, 2019

Priority Scheduling in the Bamboo Garden Trimming Problem.

Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Dynamic Public Transit Labeling.

Mattia D'Emidio, Imran Khan

Proceedings of the Computational Science and Its Applications - ICCSA 2019, 2019

Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study.

Mattia D'Emidio, Daniele Frigioni

Proceedings of the Computational Science and Its Applications - ICCSA 2019, 2019

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

Report on SEA 2018.

Gianlorenzo D'Angelo, Mattia D'Emidio

Bull. EATCS, 2018

A tool for automatically selecting optimal model transformation chains.

Francesco Basciani, Davide Di Ruscio, Mattia D'Emidio, Daniele Frigioni, Alfonso Pierantonio, Ludovico Iovino

Proceedings of the 21st ACM/IEEE International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings, 2018

On Mining Distances in Large-Scale Dynamic Graphs.

Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni

Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

EASIER: An Evolutionary Approach for Multi-objective Software ArchItecturE Refactoring.

Davide Arcelli, Vittorio Cortellessa, Mattia D'Emidio, Daniele Di Pompeo

Proceedings of the IEEE International Conference on Software Architecture, 2018

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

Multi-robot Task Allocation Problem: Current Trends and New Ideas.

Mattia D'Emidio, Imran Khan

Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings.

Feliciano Colella, Mattia D'Emidio, Guido Proietti

Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

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

Distance Queries in Large-Scale Fully Dynamic Complex Networks.

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni

Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Improved Protocols for Luminous Asynchronous Robots.

Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

On the Clustered Shortest-Path Tree Problem.

Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Characterizing the Computational Power of Anonymous Mobile Robots.

Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra

Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

2015

Explore and repair graphs with black holes using mobile entities.

Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra

Theor. Comput. Sci., 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

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, Guido Proietti

ACM J. Exp. Algorithmics, 2015

Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs.

Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

Path-Fault-Tolerant Approximate Shortest-Path Trees.

Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti

Proceedings of the Structural Information and Communication Complexity, 2015

2014

A loop-free shortest-path routing algorithm for dynamic networks.

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni

Theor. Comput. Sci., 2014

Fully dynamic update of arc-flags.

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni

Networks, 2014

Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches.

Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Engineering shortest-path algorithms for dynamic networks.

Mattia D'Emidio, Daniele Frigioni

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013

Engineering shortest-path algorithms for dynamic networks.

Mattia D'Emidio

PhD thesis, 2013

Pruning the Computation of Distributed Shortest Paths in Power-law Networks.

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni

Informatica (Slovenia), 2013

Dynamically Maintaining Shortest Path Trees under Batches of Updates.

Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti

Proceedings of the Structural Information and Communication Complexity, 2013

Exploring and Making Safe Dangerous Networks Using Mobile Entities.

Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra

Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012

Fully Dynamic Maintenance of Arc-Flags in Road Networks.

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Engineering a New Loop-Free Shortest Paths Routing Algorithm.

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks.

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano

Proceedings of the Design and Analysis of Algorithms, 2012

2011

A Speed-Up Technique for Distributed Shortest Paths Computation.

Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011