default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMattia D'Emidio
Person information
- affiliation: University of L'Aquila, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j23]Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco:
Digraph k-Coloring Games: New Algorithms and Experiments. J. Artif. Intell. Res. 81: 163-202 (2024)- [c27]David Coudert, Andrea D'Ascenzo, Mattia D'Emidio:
Indexing Graphs for Shortest Beer Path Queries. ATMOS 2024: 2:1-2:18 - [c26]Gianlorenzo D'Angelo, Mattia D'Emidio, Esmaeil Delfaraz, Gabriele Di Stefano:
Improved Algorithms for the Capacitated Team Orienteering Problem. ATMOS 2024: 7:1-7:17 - 2023
- [j22]Andrea D'Ascenzo
, Mattia D'Emidio:
Top-k Distance Queries on Large Time-Evolving Graphs. IEEE Access 11: 102228-102242 (2023) - 2022
- [c25]Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco:
Digraph k-Coloring Games: From Theory to Practice. SEA 2022: 20:1-20:18 - [e1]Mattia D'Emidio, Niels Lindner:
22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2022, September 8-9, 2022, Potsdam, Germany. OASIcs 106, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-259-4 [contents] - 2021
- [j21]Serafino Cicerone, Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra:
On the effectiveness of the genetic paradigm for polygonization. Inf. Process. Lett. 171: 106134 (2021) - [j20]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): 22:1-22:37 (2021) - 2020
- [j19]Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe:
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction. IEEE Access 8: 207619-207634 (2020) - [j18]Mattia D'Emidio, Imran Khan, Daniele Frigioni:
Journey Planning Algorithms for Massive Delay-Prone Transit Networks. Algorithms 13(1): 2 (2020) - [j17]Mattia D'Emidio:
Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs. Algorithms 13(8): 191 (2020) - [j16]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): 251-279 (2020) - [c24]Gianlorenzo D'Angelo, Mattia D'Emidio, Shantanu Das, Alfredo Navarra, Giuseppe Prencipe:
Leader Election and Compaction for Asynchronous Silent Programmable Matter. AAMAS 2020: 276-284
2010 – 2019
- 2019
- [j15]Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra:
Bamboo Garden Trimming Problem: Priority Schedulings. Algorithms 12(4): 74 (2019) - [j14]Mattia D'Emidio, Daniele Frigioni:
Special Issue on "Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems". Algorithms 12(11): 229 (2019) - [j13]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): 165-184 (2019) - [j12]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Fully Dynamic 2-Hop Cover Labeling. ACM J. Exp. Algorithmics 24(1): 1.6:1-1.6:36 (2019) - [j11]Mattia D'Emidio, Imran Khan:
Collision-free allocation of temporally constrained tasks in multi-robot systems. Robotics Auton. Syst. 119: 151-172 (2019) - [c23]Mattia D'Emidio, Daniele Frigioni:
Distributed Shortest Paths on Power Law Networks in the Generalized Linear Preference Model: An Experimental Study. ICCSA (2) 2019: 72-81 - [c22]Mattia D'Emidio, Imran Khan:
Dynamic Public Transit Labeling. ICCSA (1) 2019: 103-117 - [c21]Mattia D'Emidio, Gabriele Di Stefano, Alfredo Navarra:
Priority Scheduling in the Bamboo Garden Trimming Problem. SOFSEM 2019: 136-149 - 2018
- [j10]Gianlorenzo D'Angelo, Mattia D'Emidio:
Report on SEA 2018. Bull. EATCS 126 (2018) - [j9]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: 57-74 (2018) - [c20]Davide Arcelli, Vittorio Cortellessa, Mattia D'Emidio, Daniele Di Pompeo:
EASIER: An Evolutionary Approach for Multi-objective Software ArchItecturE Refactoring. ICSA 2018: 105-114 - [c19]Serafino Cicerone, Mattia D'Emidio, Daniele Frigioni:
On Mining Distances in Large-Scale Dynamic Graphs. ICTCS 2018: 77-81 - [c18]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: 2-6 - [i2]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 abs/1801.10416 (2018) - 2017
- [j8]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 46-47: 40-58 (2017) - [c17]Feliciano Colella, Mattia D'Emidio, Guido Proietti:
Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings. ICTCS/CILC 2017: 51-62 - [c16]Mattia D'Emidio, Imran Khan:
Multi-robot Task Allocation Problem: Current Trends and New Ideas. ICTCS/CILC 2017: 99-103 - 2016
- [j7]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. 63-I(9): 1499-1510 (2016) - [c15]Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra:
Characterizing the Computational Power of Anonymous Mobile Robots. ICDCS 2016: 293-302 - [c14]Mattia D'Emidio, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra:
Improved Protocols for Luminous Asynchronous Robots. ICTCS 2016: 136-148 - [c13]Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci, Guido Proietti:
On the Clustered Shortest-Path Tree Problem. ICTCS 2016: 263-268 - [c12]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Distance Queries in Large-Scale Fully Dynamic Complex Networks. IWOCA 2016: 109-121 - 2015
- [j6]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: 1.5:1.1-1.5:1.33 (2015) - [j5]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): 444-477 (2015) - [j4]Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra:
Explore and repair graphs with black holes using mobile entities. Theor. Comput. Sci. 605: 129-145 (2015) - [c11]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Path-Fault-Tolerant Approximate Shortest-Path Trees. SIROCCO 2015: 224-238 - [c10]Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra:
Synchronous Robots vs Asynchronous Lights-Enhanced Robots on Graphs. ICTCS 2015: 169-180 - [i1]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Path-Fault-Tolerant Approximate Shortest-Path Trees. CoRR abs/1507.01695 (2015) - 2014
- [j3]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Fully dynamic update of arc-flags. Networks 63(3): 243-259 (2014) - [j2]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
A loop-free shortest-path routing algorithm for dynamic networks. Theor. Comput. Sci. 516: 1-19 (2014) - [c9]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: 46-61 - [c8]Mattia D'Emidio, Daniele Frigioni:
Engineering shortest-path algorithms for dynamic networks. ICTCS 2014: 265-269 - [c7]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: 283-294 - 2013
- [b1]Mattia D'Emidio:
Engineering shortest-path algorithms for dynamic networks. University of L'Aquila, Italy, 2013 - [j1]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
Pruning the Computation of Distributed Shortest Paths in Power-law Networks. Informatica (Slovenia) 37(3): 253-265 (2013) - [c6]Mattia D'Emidio, Daniele Frigioni, Alfredo Navarra:
Exploring and Making Safe Dangerous Networks Using Mobile Entities. ADHOC-NOW 2013: 136-147 - [c5]Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigioni, Stefano Leucci, Guido Proietti:
Dynamically Maintaining Shortest Path Trees under Batches of Updates. SIROCCO 2013: 286-297 - 2012
- [c4]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Daniele Romano:
Enhancing the Computation of Distributed Shortest Paths on Real Dynamic Networks. MedAlg 2012: 148-158 - [c3]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
Engineering a New Loop-Free Shortest Paths Routing Algorithm. SEA 2012: 123-134 - [c2]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Camillo Vitale:
Fully Dynamic Maintenance of Arc-Flags in Road Networks. SEA 2012: 135-147 - 2011
- [c1]Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni, Vinicio Maurizio:
A Speed-Up Technique for Distributed Shortest Paths Computation. ICCSA (2) 2011: 578-593
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-08 20:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
