3 papers
cs.CG2026
Optimal Trajectories in Discrete Space with Acceleration Constraints
Arnaud Casteigts, Matteo De Francesco, Pierre Leone
In the racetrack acceleration model, proposed by Martin Gardner in 1973, each step consists of changing the position of the vehicle by a vector in , with the constrai…
cs.DS2025
Realization of Temporally Connected Graphs Based on Degree Sequences
Arnaud Casteigts, Michelle Döring, Nils Morawietz
Given an undirected graph , the problem of deciding whether admits a simple and proper time-labeling that makes it temporally connected is known to be NP-hard (Göbel et al.,…
cs.DM2025
Dismountability in Temporal Cliques Revisited
Daniele Carnevale, Arnaud Casteigts, Timothée Corsini
A temporal graph is a graph whose edges are available only at certain points in time. It is temporally connected if the nodes can reach each other by paths that traverse the edges…