Andrea D'Ascenzo

According to our database, Andrea D'Ascenzo authored at least 10 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Beer Path Problems in Temporal Graphs.

Andrea D'Ascenzo, Giuseppe F. Italiano, Sotiris Kanellopoulos, Anna Mpanti, Aris Pagourtzis, Christos Pergaminelis

CoRR, July, 2025

k-shortest simple paths in bounded treewidth graphs.

David Coudert, Andrea D'Ascenzo, Clément Rambaud

Theor. Comput. Sci., 2025

On the Performance of Mildly Greedy Players in k-Coloring Games.

Vittorio Bilò, Andrea D'Ascenzo, Mattia D'Emidio, Giuseppe F. Italiano

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024

D-hash/ShortestBeerDistanceQueries.

David Coudert, Andrea D'Ascenzo, Mattia D'Emidio

Dataset, November, 2024

An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators.

Claudio Arbib, Andrea D'Ascenzo, Fabrizio Rossi, Daniele Santoni

J. Comput. Biol., 2024

Digraph k-Coloring Games: New Algorithms and Experiments.

Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco

J. Artif. Intell. Res., 2024

Indexing Graphs for Shortest Beer Path Queries.

David Coudert, Andrea D'Ascenzo, Mattia D'Emidio

Proceedings of the 24th Symposium on Algorithmic Approaches for Transportation Modelling, 2024

On Mining Dynamic Graphs for k Shortest Paths.

Andrea D'Ascenzo, Mattia D'Emidio

Proceedings of the Social Networks Analysis and Mining - 16th International Conference, 2024

2023

Top-k Distance Queries on Large Time-Evolving Graphs.

Andrea D'Ascenzo, Mattia D'Emidio

IEEE Access, 2023

2022

Digraph k-Coloring Games: From Theory to Practice.

Andrea D'Ascenzo, Mattia D'Emidio, Michele Flammini, Gianpiero Monaco

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022