D'ASCENZO, ANDREA
D'ASCENZO, ANDREA
An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators
2024-01-01 Arbib, Claudio; D'Ascenzo, Andrea; Rossi, Fabrizio; Santoni, Daniele
Beer Path Problems in Temporal Graphs
2026-01-01 D’Ascenzo, Andrea; Italiano, Giuseppe F.; Kanellopoulos, Sotiris; Mpanti, Anna; Pagourtzis, Aris; Pergaminelis, Christos
Digraph k-Coloring Games: From Theory to Practice
2022-01-01 D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero; D'Ascenzo, Andrea
Digraph k-Coloring Games: New Algorithms and Experiments
2024-01-01 D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero; D'Ascenzo, Andrea
Enhancing Graph Edit Distance Computation: Stronger and Orientation-Based ILP Formulations
2025-01-01 D'Ascenzo, Andrea; Meffert, Julian; Mutzel, Petra; Rossi, Fabrizio
Fast Landmark Reconfiguration for Highway Cover Indexes
2026-01-01 Coudert, David; D'Ascenzo, Andrea; D'Emidio, Mattia; Italiano, Giuseppe F.
Indexing Graphs for Shortest Beer Path Queries
2024-01-01 Coudert, David; D'Ascenzo, Andrea; D'Emidio, Mattia
Integer Programming Models for the Median of a 0-1 String Set Under Levenshtein Distance
2026-01-01 Arbib, Claudio; D'Ascenzo, Andrea; Karaşan, Oya E.; Pizzuti, Andrea
K-Hole Separation in PEO‑Based ILP Treewidth Formulation
2026-01-01 D'Ascenzo, Andrea
k-shortest simple paths in bounded treewidth graphs
2025-01-01 Coudert, David; D'Ascenzo, Andrea; Rambaud, Clément
On Mining Dynamic Graphs for k Shortest Paths
2025-01-01 D'Ascenzo, Andrea; D'Emidio, Mattia
On the Performance of Mildly Greedy Players in k-Coloring Games
2025-01-01 Bilò, Vittorio; D'Ascenzo, Andrea; D'Emidio, Mattia; Italiano, Giuseppe F.
Top-k Distance Queries on Large Time-Evolving Graphs
2023-01-01 D'Ascenzo, Andrea; D'Emidio, Mattia
| Titolo | Data di pubblicazione | Autore(i) | File |
|---|---|---|---|
| An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators | 1-gen-2024 | Arbib, Claudio; D'Ascenzo, Andrea; Rossi, Fabrizio; Santoni, Daniele | |
| Beer Path Problems in Temporal Graphs | 1-gen-2026 | D’Ascenzo, Andrea; Italiano, Giuseppe F.; Kanellopoulos, Sotiris; Mpanti, Anna; Pagourtzis, Aris; Pergaminelis, Christos | |
| Digraph k-Coloring Games: From Theory to Practice | 1-gen-2022 | D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero; D'Ascenzo, Andrea | |
| Digraph k-Coloring Games: New Algorithms and Experiments | 1-gen-2024 | D'Emidio, Mattia; Flammini, Michele; Monaco, Gianpiero; D'Ascenzo, Andrea | |
| Enhancing Graph Edit Distance Computation: Stronger and Orientation-Based ILP Formulations | 1-gen-2025 | D'Ascenzo, Andrea; Meffert, Julian; Mutzel, Petra; Rossi, Fabrizio | |
| Fast Landmark Reconfiguration for Highway Cover Indexes | 1-gen-2026 | Coudert, David; D'Ascenzo, Andrea; D'Emidio, Mattia; Italiano, Giuseppe F. | |
| Indexing Graphs for Shortest Beer Path Queries | 1-gen-2024 | Coudert, David; D'Ascenzo, Andrea; D'Emidio, Mattia | |
| Integer Programming Models for the Median of a 0-1 String Set Under Levenshtein Distance | 1-gen-2026 | Arbib, Claudio; D'Ascenzo, Andrea; Karaşan, Oya E.; Pizzuti, Andrea | |
| K-Hole Separation in PEO‑Based ILP Treewidth Formulation | 1-gen-2026 | D'Ascenzo, Andrea | |
| k-shortest simple paths in bounded treewidth graphs | 1-gen-2025 | Coudert, David; D'Ascenzo, Andrea; Rambaud, Clément | |
| On Mining Dynamic Graphs for k Shortest Paths | 1-gen-2025 | D'Ascenzo, Andrea; D'Emidio, Mattia | |
| On the Performance of Mildly Greedy Players in k-Coloring Games | 1-gen-2025 | Bilò, Vittorio; D'Ascenzo, Andrea; D'Emidio, Mattia; Italiano, Giuseppe F. | |
| Top-k Distance Queries on Large Time-Evolving Graphs | 1-gen-2023 | D'Ascenzo, Andrea; D'Emidio, Mattia |