3 papers
cs.DS2026
Temporal Path Covers: Dilworth Properties and Parameterized Complexity
Lapo Cioni, Sotiris Kanellopoulos, Edouard Nemery +3
The Minimum Temporal Path Cover (TPC) and Minimum Temporally Disjoint Path Cover (TDPC) problems were introduced by [Chakraborty, Dailly, Foucaud, Klasing, MFCS '24]. Both were sho…
cs.DS2025
Matching and Edge Cover in Temporal Graphs
Lapo Cioni, Riccardo Dondi, Andrea Marino +2
Temporal graphs are a special class of graphs for which a temporal component is added to edges, that is, each edge possesses a set of times at which it is available and can be trav…
cs.DM2025
Sorting permutations using a pop stack with a bypass
Lapo Cioni, Luca Ferrari, Rebecca Smith
We introduce a new sorting device for permutations which makes use of a pop stack augmented with a bypass operation. This results in a sorting machine, which is more powerful than…