Timothée Corsini

13 papers B 1C 1Journal 7Unranked 3
YearRankTypeTitle / Venue / Authors
2025 — conf
Dismountability in Temporal Cliques Revisited.
SAND
Daniele Carnevale, Arnaud Casteigts, Timothée Corsini
2025 J jnl
Dismountability in Temporal Cliques Revisited.
CoRR
Daniele Carnevale, Arnaud Casteigts, Timothée Corsini
2025 — conf
Temporal Orienteering with Changing Fuel Costs.
ALGOWIN
Timothée Corsini, Jessica A. Enright, Laura Larios-Jones, Kitty Meeks
2025 J jnl
Temporal Orienteering with Changing Fuel Costs.
CoRR
Timothée Corsini, Jessica A. Enright, Laura Larios-Jones, Kitty Meeks
2024 B conf
In Search of the Lost Tree - Hardness and Relaxation of Spanning Trees in Temporal Graphs.
SIROCCO
Arnaud Casteigts, Timothée Corsini
2024 — —
Reachability in temporal graphs and related problems. (Accessibilité dans les graphes temporels et problèmes associés).
Timothée Corsini
2024 J jnl
Simple, strict, proper, happy: A study of reachability in temporal graphs.
Theor. Comput. Sci.
Arnaud Casteigts, Timothée Corsini, Writika Sarkar
2023 J jnl
In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs.
CoRR
Arnaud Casteigts, Timothée Corsini
2023 J jnl
Partitioning into degenerate graphs in linear time.
Eur. J. Comb.
Timothée Corsini, Quentin Deschamps, Carl Feghali, Daniel Gonçalves, Hélène Langlois, Alexandre Talon
2022 C conf
Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs.
SSS
Arnaud Casteigts, Timothée Corsini, Writika Sarkar
2022 J jnl
Partitioning into degenerate graphs in linear time.
CoRR
Timothée Corsini, Quentin Deschamps, Carl Feghali, Daniel Gonçalves, Hélène Langlois, Alexandre Talon
2022 — conf
Robustness of Distances and Diameter in a Fragile Network.
SAND
Arnaud Casteigts, Timothée Corsini, Hervé Hocquard, Arnaud Labourel
2022 J jnl
Simple, strict, proper, happy: A study of reachability in temporal graphs.
CoRR
Arnaud Casteigts, Timothée Corsini, Writika Sarkar