Andrea D'Ascenzo

Orcid: 0000-0001-5612-0798

According to our database1, Andrea D'Ascenzo authored at least 13 papers between 2022 and 2026.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2026
Fast Landmark Reconfiguration for Highway Cover Indexes.
Proceedings of the Proceedings 29th International Conference on Extending Database Technology, 2026

2025
Accelerating Graph Similarity Search through Integer Linear Programming.
CoRR, November, 2025

Enhancing Graph Edit Distance Computation: Stronger and Orientation-based ILP Formulations.
Proc. VLDB Endow., July, 2025

Beer Path Problems in Temporal Graphs.
CoRR, July, 2025

k-shortest simple paths in bounded treewidth graphs.
Theor. Comput. Sci., 2025

On the Performance of Mildly Greedy Players in k-Coloring Games.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024
D-hash/ShortestBeerDistanceQueries.
Dataset, November, 2024

An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators.
J. Comput. Biol., 2024

Digraph k-Coloring Games: New Algorithms and Experiments.
J. Artif. Intell. Res., 2024

Indexing Graphs for Shortest Beer Path Queries.
Proceedings of the 24th Symposium on Algorithmic Approaches for Transportation Modelling, 2024

On Mining Dynamic Graphs for k Shortest Paths.
Proceedings of the Social Networks Analysis and Mining - 16th International Conference, 2024

2023
Top-k Distance Queries on Large Time-Evolving Graphs.
IEEE Access, 2023

2022
Digraph k-Coloring Games: From Theory to Practice.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022


  Loading...