5 citations · 5 across the 6 of their papers we have counts for
9 papers
Temporal Path Covers: Dilworth Properties and Parameterized Complexity
Lapo Cioni, Sotiris Kanellopoulos, Edouard Nemery +3
The Temporal Path Cover (TPC) and Temporally Disjoint Path Cover (TDPC) problems were introduced by [Chakraborty, Dailly, Foucaud, Klasing, MFCS '24] as the natural temporal analog…
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…
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…
Pop Stacks with a Bypass
Lapo Cioni, Luca Ferrari, Rebecca Smith
We consider sorting procedures for permutations making use of pop stacks with a bypass operation, and explore the combinatorial properties of the associated algorithms.
Preimages under the bubblesort operator
Mathilde Bouvel, Lapo Cioni, Luca Ferrari
We study preimages of permutations under the bubblesort operator . We achieve a description of these preimages much more complete than what is known for the more compli…
The interval posets of permutations seen from the decomposition tree perspective
Mathilde Bouvel, Lapo Cioni, Benjamin Izart
The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:20…