Mattia D'Emidio

About Mattia D'Emidio

Mattia D'Emidio, With an exceptional h-index of 15 and a recent h-index of 11 (since 2020), a distinguished researcher at Università degli Studi dell'Aquila, specializes in the field of algorithm engineering, mobile computational entities, graph algorithms, computational geometry, big data.

His recent articles reflect a diverse array of research interests and contributions to the field:

Route Planning Algorithms for Fleets of Connected Vehicles: State of the Art, Implementation, and Deployment

Top-k Distance Queries on Large Time-Evolving Graphs

22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems

Digraph k-Coloring Games

OASIcs, Volume 106, ATMOS 2022, Complete Volume

Digraph k-Coloring Games: From Theory to Practice

On the effectiveness of the genetic paradigm for polygonization

Combining polygon schematization and decomposition approaches for solving the cavity decomposition problem

Mattia D'Emidio Information

University

Position

Assistant Professor@ Lecturer@Gran Sasso Science Institute (GSSI)

Citations(all)

499

Citations(since 2020)

343

Cited By

335

hIndex(all)

15

hIndex(since 2020)

11

i10Index(all)

23

i10Index(since 2020)

16

Email

University Profile Page

Google Scholar

Mattia D'Emidio Skills & Research Interests

algorithm engineering

mobile computational entities

graph algorithms

computational geometry

big data

Top articles of Mattia D'Emidio

Route Planning Algorithms for Fleets of Connected Vehicles: State of the Art, Implementation, and Deployment

2024/3/29

Top-k Distance Queries on Large Time-Evolving Graphs

IEEE Access

2023/9/18

22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems

2022/9

Digraph k-Coloring Games

SEA

2022/7

OASIcs, Volume 106, ATMOS 2022, Complete Volume

2022

Digraph k-Coloring Games: From Theory to Practice

2022

On the effectiveness of the genetic paradigm for polygonization

Information Processing Letters

2021/10/1

Combining polygon schematization and decomposition approaches for solving the cavity decomposition problem

ACM Transactions on Spatial Algorithms and Systems (TSAS)

2021/8/16

Asynchronous silent programmable matter achieves leader election and compaction

IEEE Access

2020/11/16

Faster algorithms for mining shortest-path distances from massive time-evolving graphs

Algorithms

2020/8/4

Leader election and compaction for asynchronous silent programmable matter

2020/5/5

Creating an holistic emergency alert management platform

Journal of urban technology

2020/4/2

See List of Professors in Mattia D'Emidio University(Università degli Studi dell'Aquila)

Co-Authors

academic-engine