D'EMIDIO, MATTIA
D'EMIDIO, MATTIA
Dipartimento di Ingegneria e scienze dell'informazione e matematica
Improved Algorithms for the Capacitated Team Orienteering Problem
2024-01-01 D'Angelo, Gianlorenzo; D'Emidio, Mattia; Delfarazpahlevanloo, Esmaeil; DI STEFANO, Gabriele
Indexing Graphs for Shortest Beer Path Queries
2024-01-01 Coudert, David; D'Ascenzo, Andrea; D'Emidio, Mattia
Route Planning Algorithms for Fleets of Connected Vehicles: State of the Art, Implementation, and Deployment
2024-01-01 D'Emidio, Mattia; Delfarazpahlevanloo, Esmaeil; DI STEFANO, Gabriele; Frittella, Giannantonio; Vittoria, Edgardo
Digraph k-Coloring Games: New Algorithms and Experiments
2024-01-01 D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero
Top-k Distance Queries on Large Time-Evolving Graphs
2023-01-01 D'Ascenzo, Andrea; D'Emidio, Mattia
Digraph k-Coloring Games: From Theory to Practice
2022-01-01 D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero
Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem
2021-01-01 Cicerone, Serafino; D’Emidio, Mattia; Frigioni, Daniele; Pascucci, Filippo Tirabassi
On the effectiveness of the genetic paradigm for polygonization
2021-01-01 Cicerone, S.; D'Emidio, M.; Di Stefano, G.; Navarra, A.
Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms
2020-01-01 Basciani, Francesco; Demidio, Mattia; Di Ruscio, Davide; Frigioni, Daniele; Iovino, Ludovico; Pierantonio, Alfonso
Creating an Holistic Emergency Alert Management Platform
2020-01-01 Iovino, Ludovico; D'Emidio, M.; Modica, Marco
Leader Election and Compaction for Asynchronous Silent Programmable Matter
2020-01-01 D'Angelo, Gianlorenzo; D'Emidio, Mattia; Das, Shantanu; Navarra, Alfredo; Prencipe, Giuseppe
Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs
2020-01-01 D’Emidio, Mattia
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction
2020-01-01 D'Angelo, G.; D'Emidio, Mattia; Das, Shantanu; Navarra, A.; Prencipe, Giuseppe
Journey Planning Algorithms for Massive Delay-Prone Transit Networks
2020-01-01 D'Emidio, Mattia; Khan, Imran; Frigioni, Daniele
Bamboo Garden Trimming Problem: Priority Schedulings
2019-01-01 D’Emidio, Mattia; DI STEFANO, Gabriele; Navarra, Alfredo
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
2019-01-01 D’Emidio, Mattia; Forlizzi, Luca; Frigioni, Daniele; Leucci, Stefano; Proietti, Guido
Fully dynamic 2-hop cover labeling
2019-01-01 D'Angelo, Gianlorenzo; D'Emidio, Mattia; Frigioni, Daniele
Collision-free allocation of temporally constrained tasks in multi-robot systems
2019-01-01 D'Emidio, M.; Khan, I.
Special Issue on “Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems”
2019-01-01 D’Emidio, Mattia; Frigioni, Daniele
Dynamic Public Transit Labeling
2019-01-01 D'Emidio, M.; Khan, I.
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
Improved Algorithms for the Capacitated Team Orienteering Problem | 1-gen-2024 | D'Angelo, Gianlorenzo; D'Emidio, Mattia; Delfarazpahlevanloo, Esmaeil; DI STEFANO, Gabriele | |
Indexing Graphs for Shortest Beer Path Queries | 1-gen-2024 | Coudert, David; D'Ascenzo, Andrea; D'Emidio, Mattia | |
Route Planning Algorithms for Fleets of Connected Vehicles: State of the Art, Implementation, and Deployment | 1-gen-2024 | D'Emidio, Mattia; Delfarazpahlevanloo, Esmaeil; DI STEFANO, Gabriele; Frittella, Giannantonio; Vittoria, Edgardo | |
Digraph k-Coloring Games: New Algorithms and Experiments | 1-gen-2024 | D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero | |
Top-k Distance Queries on Large Time-Evolving Graphs | 1-gen-2023 | D'Ascenzo, Andrea; D'Emidio, Mattia | |
Digraph k-Coloring Games: From Theory to Practice | 1-gen-2022 | D'Ascenzo, Andrea; D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero | |
Combining Polygon Schematization and Decomposition Approaches for Solving the Cavity Decomposition Problem | 1-gen-2021 | Cicerone, Serafino; D’Emidio, Mattia; Frigioni, Daniele; Pascucci, Filippo Tirabassi | |
On the effectiveness of the genetic paradigm for polygonization | 1-gen-2021 | Cicerone, S.; D'Emidio, M.; Di Stefano, G.; Navarra, A. | |
Automated Selection of Optimal Model Transformation Chains via Shortest-Path Algorithms | 1-gen-2020 | Basciani, Francesco; Demidio, Mattia; Di Ruscio, Davide; Frigioni, Daniele; Iovino, Ludovico; Pierantonio, Alfonso | |
Creating an Holistic Emergency Alert Management Platform | 1-gen-2020 | Iovino, Ludovico; D'Emidio, M.; Modica, Marco | |
Leader Election and Compaction for Asynchronous Silent Programmable Matter | 1-gen-2020 | D'Angelo, Gianlorenzo; D'Emidio, Mattia; Das, Shantanu; Navarra, Alfredo; Prencipe, Giuseppe | |
Faster Algorithms for Mining Shortest-Path Distances from Massive Time-Evolving Graphs | 1-gen-2020 | D’Emidio, Mattia | |
Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction | 1-gen-2020 | D'Angelo, G.; D'Emidio, Mattia; Das, Shantanu; Navarra, A.; Prencipe, Giuseppe | |
Journey Planning Algorithms for Massive Delay-Prone Transit Networks | 1-gen-2020 | D'Emidio, Mattia; Khan, Imran; Frigioni, Daniele | |
Bamboo Garden Trimming Problem: Priority Schedulings | 1-gen-2019 | D’Emidio, Mattia; DI STEFANO, Gabriele; Navarra, Alfredo | |
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem | 1-gen-2019 | D’Emidio, Mattia; Forlizzi, Luca; Frigioni, Daniele; Leucci, Stefano; Proietti, Guido | |
Fully dynamic 2-hop cover labeling | 1-gen-2019 | D'Angelo, Gianlorenzo; D'Emidio, Mattia; Frigioni, Daniele | |
Collision-free allocation of temporally constrained tasks in multi-robot systems | 1-gen-2019 | D'Emidio, M.; Khan, I. | |
Special Issue on “Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems” | 1-gen-2019 | D’Emidio, Mattia; Frigioni, Daniele | |
Dynamic Public Transit Labeling | 1-gen-2019 | D'Emidio, M.; Khan, I. |