Mattia D'Emidio

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 32

Top Topics

Computational Power

Top Venues

Publications

Andrea D'Ascenzo, Mattia D'Emidio
Top-k Distance Queries on Large Time-Evolving Graphs. IEEE Access 11 (2023)
Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco
Digraph k-Coloring Games: From Theory to Practice. SEA (2022)
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) (2021)
Serafino Cicerone, Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
On the effectiveness of the genetic paradigm for polygonization. Inf. Process. Lett. 171 (2021)
Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. IEEE Access 8 (2020)
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) (2020)
Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe
Leader Election and Compaction for Asynchronous Silent Programmable Matter. AAMAS (2020)
Mattia D'Emidio, Imran Khan, Daniele Frigioni
Journey Planning Algorithms for Massive Delay-Prone Transit Networks. Algorithms 13 (1) (2020)
Mattia D'Emidio
Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs. Algorithms 13 (8) (2020)
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) (2019)
Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
Bamboo Garden Trimming Problem: Priority Schedulings. Algorithms 12 (4) (2019)
Mattia D'Emidio, Daniele Frigioni
Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study. ICCSA (2) (2019)
Mattia D'Emidio, Daniele Frigioni
Special Issue on "Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems". Algorithms 12 (11) (2019)
Mattia D'Emidio, Imran Khan
Dynamic Public Transit Labeling. ICCSA (1) (2019)
Mattia D'Emidio, Imran Khan
Collision-free allocation of temporally constrained tasks in multi-robot systems. Robotics Auton. Syst. 119 (2019)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Fully Dynamic 2-Hop Cover Labeling. ACM J. Exp. Algorithmics 24 (1) (2019)
Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
Priority Scheduling in the Bamboo Garden Trimming Problem. SOFSEM (2019)
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 (2018)
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)
Davide Arcelli, Vittorio Cortellessa, Mattia D'Emidio, Daniele Di Pompeo
EASIER: An Evolutionary Approach for Multi-objective Software ArchItecturE Refactoring. ICSA (2018)
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 (2018)
Gianlorenzo D'Angelo, Mattia D'Emidio
Report on SEA 2018. Bull. EATCS 126 (2018)
Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni
On Mining Distances in Large-Scale Dynamic Graphs. ICTCS (2018)
Mattia D'Emidio, Imran Khan
Multi-robot Task Allocation Problem: Current Trends and New Ideas. ICTCS/CILC (2017)
Feliciano Colella, Mattia D'Emidio, Guido Proietti
Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings. ICTCS/CILC (2017)
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 (2017)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Distance Queries in Large-Scale Fully Dynamic Complex Networks. IWOCA (2016)
Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
Characterizing the Computational Power of Anonymous Mobile Robots. ICDCS (2016)
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. (9) (2016)
Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
Improved Protocols for Luminous Asynchronous Robots. ICTCS (2016)
Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs. Electron. Notes Theor. Comput. Sci. 322 (2016)
Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti
On the Clustered Shortest-Path Tree Problem. ICTCS (2016)
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) (2015)
Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
Explore and repair graphs with black holes using mobile entities. Theor. Comput. Sci. 605 (2015)
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 (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR (2015)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Path-Fault-Tolerant Approximate Shortest-Path Trees. SIROCCO (2015)
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)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Fully dynamic update of arc-flags. Networks 63 (3) (2014)
Mattia D'Emidio, Daniele Frigioni
Engineering shortest-path algorithms for dynamic networks. ICTCS (2014)
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)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci. 516 (2014)
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti
Dynamically Maintaining Shortest Path Trees under Batches of Updates. SIROCCO (2013)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni
Pruning the Computation of Distributed Shortest Paths in Power-law Networks. Informatica (Slovenia) 37 (3) (2013)
Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra
Exploring and Making Safe Dangerous Networks Using Mobile Entities. ADHOC-NOW (2013)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale
Fully Dynamic Maintenance of Arc-Flags in Road Networks. SEA (2012)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio
Engineering a New Loop-Free Shortest Paths Routing Algorithm. SEA (2012)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano
Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. MedAlg (2012)
Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio
A Speed-Up Technique for Distributed Shortest Paths Computation. ICCSA (2) (2011)