Mattia D'Emidio

60 papers A 4B 9C 5Journal 26Unranked 15

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Fast Landmark Reconfiguration for Highway Cover Indexes. EDBT David Coudert, Andrea D'Ascenzo, Mattia D'Emidio, Giuseppe F. Italiano
2026	A	`conf`	On Computing Top-k Simple Shortest Paths from a Single Source. ALENEX Mattia D'Emidio, Gabriele Di Stefano
2025	—	`conf`	A Software Tool for Robust and Reliable Electromagnetic Models: the case of Reconfigurable Intelligent Surfaces. CAMAD Giuseppe Pettanice, Edgardo Vittoria, Giannantonio Frittella, Daniele Romano, Roberto Valentini, Piergiuseppe Di Marco, Mattia D'Emidio, Serafino Cicerone, Fortunato Santucci, Marco Di Renzo, Giulio Antonini
2025	J	`jnl`	On Computing Top- CoRR Mattia D'Emidio, Gabriele Di Stefano
2025	B	`conf`	On the Performance of Mildly Greedy Players in k-Coloring Games. MFCS Vittorio Bilò, Andrea D'Ascenzo, Mattia D'Emidio, Giuseppe F. Italiano
2024	J	`jnl`	Digraph k-Coloring Games: New Algorithms and Experiments. J. Artif. Intell. Res. Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco
2024	C	`conf`	Improved Algorithms for the Capacitated Team Orienteering Problem. ATMOS Gianlorenzo D'Angelo, Mattia D'Emidio, Esmaeil Delfaraz, Gabriele Di Stefano
2024	C	`conf`	Indexing Graphs for Shortest Beer Path Queries. ATMOS David Coudert, Andrea D'Ascenzo, Mattia D'Emidio
2024	—	`conf`	On Mining Dynamic Graphs for k Shortest Paths. ASONAM (1) Andrea D'Ascenzo, Mattia D'Emidio
2023	J	`jnl`	Top-k Distance Queries on Large Time-Evolving Graphs. IEEE Access Andrea D'Ascenzo, Mattia D'Emidio
2022	C	`ed.`	22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2022, Potsdam, Germany, September 8-9, 2022 ATMOS Mattia D'Emidio, Niels Lindner
2022	B	`conf`	Digraph k-Coloring Games: From Theory to Practice. SEA Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco
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
2021	J	`jnl`	On the effectiveness of the genetic paradigm for polygonization. Inf. Process. Lett. Serafino Cicerone, Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
2020	J	`jnl`	Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. IEEE Access Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe
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`	Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs. Algorithms Mattia D'Emidio
2020	J	`jnl`	Journey Planning Algorithms for Massive Delay-Prone Transit Networks. Algorithms Mattia D'Emidio, Imran Khan, Daniele Frigioni
2020	A	`conf`	Leader Election and Compaction for Asynchronous Silent Programmable Matter. AAMAS Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe
2019	J	`jnl`	Bamboo Garden Trimming Problem: Priority Schedulings. Algorithms Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
2019	J	`jnl`	Collision-free allocation of temporally constrained tasks in multi-robot systems. Robotics Auton. Syst. Mattia D'Emidio, Imran Khan
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	—	`conf`	Dynamic Public Transit Labeling. ICCSA (1) Mattia D'Emidio, Imran Khan
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	B	`conf`	Priority Scheduling in the Bamboo Garden Trimming Problem. SOFSEM Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra
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	A	`conf`	EASIER: An Evolutionary Approach for Multi-objective Software ArchItecturE Refactoring. ICSA Davide Arcelli, Vittorio Cortellessa, Mattia D'Emidio, Daniele Di Pompeo
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
2018	J	`jnl`	Report on SEA 2018. Bull. EATCS Gianlorenzo D'Angelo, Mattia D'Emidio
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
2017	—	`conf`	Multi-robot Task Allocation Problem: Current Trends and New Ideas. ICTCS/CILC Mattia D'Emidio, Imran Khan
2017	—	`conf`	Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings. ICTCS/CILC Feliciano Colella, Mattia D'Emidio, Guido Proietti
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	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	—	`—`	Engineering shortest-path algorithms for dynamic networks. Mattia D'Emidio
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