First name *

Last name *

Email * Please use your institutional email if applicable.

Billing contact email If someone other than you will handle the payment, please provide their email.

Affiliation *

Affiliation country *

Student *

Yes No

Visiting tour (July 2, evening, before social dinner) *

Yes, just me Yes, me + one accompanying person Yes, me + more than one accompanying person (please, contact organizers) No

Social dinner (July 2, evening) *

Yes, just me Yes, me + one accompanying person (extra: 40€) Yes, me + more than one accompanying person (please, contact organizers) No

Dietary requirements *

Vegetarian Vegan Gluten-free Dairy-free Halal Kosher Nut-free None Other:

Payment mode * — Please select — Bank transfer Bon de commande (for French educational institutions) Credit card (only possible on site during the conference)

Associated paper or Brief Announcement Select the paper or brief announcement associated to this registration, if any. — No Paper or Brief Announcement — P1 — Families of tractable problems with respect to vertex-interval-membership width and its generalisations P2 — Complexity gaps between point and interval temporal graphs for some reachability problems P3 — Broadcasts in anonymous, dynamic networks: A new algorithm and impossibility results P4 — Extending Ghouila-Houri's characterization of comparability graphs to temporal graphs P5 — Asynchronous rendezvous of anonymous deterministic mobile automata in the plane P6 — FO and MSO model checking on temporal graphs P7 — Asymptotic subspace consensus in dynamic networks P8 — Sublinear-time reconfiguration of programmable matter with joint movements P9 — Nanobot algorithms for treatment of diffuse cancer P10 — Online algorithms for set packing with renewable capacities P11 — Robust temporal cut P12 — Designing sparse temporal graphs satisfying connectivity requirements P13 — On sufficient conditions for short journeys in temporal graphs P14 — Label correcting algorithms for the multiobjective temporal shortest path problem P15 — Searching for an eventually-emerging black hole in rings P16 — Minimize the sum of waiting times in periodic temporal trees B1 — Brief Announcement: Exploration of always S-connected temporal graphs B2 — Brief Announcement: Revisiting the realizability of periodic temporal graphs with bounded stretch B3 — Brief Announcement: Time-travel planning with tenet turnstiles B4 — Brief Announcement: A special case of maximum flow over time with network changes B5 — Brief Announcement: DACH: Demand-aware consistent hashing with bounded loads and greedy routing B6 — Brief Announcement: Fault-tolerant 3D leader election in the Amoebot model B7 — Brief Announcement: Leader election with noisy reconfigurable circuits in the Amoebot model B8 — Brief Announcement: Adaptive self-organization in anonymous dynamic networks

Additional information Any other information you would like to share with the organizers.

Submit registration