E-LIB Suche - Ergebnisse für: Casteigts, Arnaud

1

In Search of the Lost Tree: Hardness and Relaxation of Span..:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,

Casteigts, Arnaud ; Corsini, Timothée - p. 138-155 , 2024

Link: https://doi.org/10.1007/..

2

Sharp Thresholds in Random Simple Temporal Graphs:

Casteigts, Arnaud ; Raskin, Michael ; Renken, Malte.
SIAM Journal on Computing. 53 (2024) 2 - p. 346-388 , 2024

Link: https://doi.org/10.1137/..

3

Simple, strict, proper, happy: A study of reachability in t..:

Casteigts, Arnaud ; Corsini, Timothée ; Sarkar, Writika
Theoretical Computer Science. 991 (2024) - p. 114434 , 2024

Link: https://doi.org/10.1016/..

4

Sharp Thresholds in Random Simple Temporal Graphs:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),

Casteigts, Arnaud ; Raskin, Michael ; Renken, Malte. - p. 319-326 , 2022

Link: https://doi.org/10.1109/..

5

Invited Paper: Simple, Strict, Proper, Happy: A Study of Re..:

, In: Lecture Notes in Computer Science; Stabilization, Safety, and Security of Distributed Systems,

Casteigts, Arnaud ; Corsini, Timothée ; Sarkar, Writika - p. 3-18 , 2022

Link: https://doi.org/10.1007/..

6

A dynamic data structure for temporal reachability with uns..:

Brito, Luiz F. A. ; Albertini, Marcelo K. ; Casteigts, Arnaud.
Social Network Analysis and Mining. 12 (2021) 1 - p. , 2021

Link: https://doi.org/10.1007/..

7

Finding Temporal Paths Under Waiting Time Constraints:

Casteigts, Arnaud ; Himmel, Anne-Sophie ; Molter, Hendrik.
Algorithmica. 83 (2021) 9 - p. 2754-2802 , 2021

Link: https://doi.org/10.1007/..

8

Temporal cliques admit sparse spanners:

Casteigts, Arnaud ; Peters, Joseph G. ; Schoeters, Jason
Journal of Computer and System Sciences. 121 (2021) - p. 1-17 , 2021

Link: https://doi.org/10.1016/..

9

Robustness: A new form of heredity motivated by dynamic net..:

Casteigts, Arnaud ; Dubois, Swan ; Petit, Franck.
Theoretical Computer Science. 806 (2020) - p. 429-445 , 2020

Link: https://doi.org/10.1016/..

10

VectorTSP: A Traveling Salesperson Problem with Racetrack-L..:

, In: Algorithms for Sensor Systems; Lecture Notes in Computer Science,

Casteigts, Arnaud ; Raffinot, Mathieu ; Schoeters, Jason - p. 45-59 , 2020

Link: https://doi.org/10.1007/..

11

Computing Parameters of Sequence-Based Dynamic Graphs:

Casteigts, Arnaud ; Klasing, Ralf ; Neggaz, Yessin M..
Theory of Computing Systems. 63 (2018) 3 - p. 394-417 , 2018

Link: https://doi.org/10.1007/..

12

Maintaining a Distributed Spanning Forest in Highly Dynamic..:

Barjon, Matthieu ; Casteigts, Arnaud ; Chaumette, Serge...
The Computer Journal. 62 (2018) 2 - p. 231-246 , 2018

Link: https://doi.org/10.1093/..

13

On the expressivity of time-varying graphs:

Casteigts, Arnaud ; Flocchini, Paola ; Godard, Emmanuel..
Theoretical Computer Science. 590 (2015) - p. 27-37 , 2015

Link: https://doi.org/10.1016/..

14

Les systèmes d'information sociosanitaire à l'appui de la p..:

Bouchard, Louise ; Berthelot, Jean-Marie ; Casteigts, Arnaud...
Global Health Promotion. 21 (2014) 1_suppl - p. 15-22 , 2014

Link: https://doi.org/10.1177/..

15

Bluetooth scatternet formation from a time-efficiency persp..:

Jedda, Ahmed ; Casteigts, Arnaud ; Jourdan, Guy-Vincent.
Wireless Networks. 20 (2013) 5 - p. 1133-1156 , 2013

Link: https://doi.org/10.1007/..