PROGRAM
Days: Monday, June 8th Tuesday, June 9th Wednesday, June 10th Thursday, June 11th Friday, June 12th
Monday, June 8th
View this program: with abstractssession overviewtalk overview
14:20-15:00 Session 2: Conflict-free problems
Location: Amphi 2
| 14:20 | Improved Bounds on Proper Conflict-free Coloring of Graphs (abstract) |
| 14:40 | Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts (abstract) |
15:00-16:00 Session 3: Digraphs
Location: Amphi 2
| 15:00 | A BFS-Width-2 Normal Form for PAFP on DAGS, with a Width-2 Contrast (abstract) |
| 15:20 | Solid-resolving sets on directed graphs (abstract) |
| 15:40 | Reachability in Graphs with Polynomially many Surface Non-Separating Cycles is in UL (abstract) |
16:00-16:20 Session 4: Break
Location: Cafeteria
16:20-17:20 Session 5: Online algorithms
Location: Amphi 2
| 16:20 | Minimizing the Weighted Makespan with Restarts on a Single Machine (abstract) |
| 16:40 | Removable Online Knapsack: Exploiting Recourse and Bounded Item Sizes (abstract) |
| 17:00 | Online Drone Coverage of Targets on a Line (abstract) |
17:20-18:20 Session 6: Parameterized algorithms for botanists
Location: Amphi 2
| 17:20 | Exact Algorithms for Edge Deletion to Cactus (abstract) |
| 17:40 | Parameterized Algorithms for Computing MAD Trees (abstract) |
| 18:00 | Breadth-First Search Trees with Many or Few Leaves (abstract) |
Tuesday, June 9th
View this program: with abstractssession overviewtalk overview
09:00-10:20 Session 7: Combinatorial algorithms and extremal theory
Location: Amphi 2
| 09:00 | Cryptographic applications of combinatorial ranking algorithms for integer compositions (abstract) |
| 09:20 | One Sequence to Rule them All: O(1)-Time Parallel Generation of Mixed-Radix Gray Codes (abstract) |
| 09:40 | Bounds on Linear Tur\'{a}n Number for Trees (abstract) |
| 10:00 | Realizing Planar Linkages in Polygonal Domains (abstract) |
10:20-10:40 Session 8: Break
Location: Cafeteria
10:40-11:30 Session 9: Plenary talk 1
Sergio Cabello - Computational Geometry with Predictions
Location: Amphi 2
11:30-12:30 Session 10: Time and uncertainty
Location: Amphi 2
| 11:30 | Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds (abstract) |
| 11:50 | Enumerating Spanners in Directed Temporal Graphs (abstract) |
| 12:10 | Beer Path Problems in Temporal Graphs (abstract) |
12:30-14:00 Session 11: Lunch
Location: A002/A004
14:00-15:00 Session 12: Inversion
Location: Amphi 2
| 14:00 | Parameterized algorithms for k-Inversion (abstract) |
| 14:20 | On the $(\leq p)$-inversion diameter of oriented graphs (abstract) |
| 14:40 | Tight upper bounds on color reversal by local inversions (abstract) |
16:00-16:20 Session 14: Break
Location: Cafeteria
16:20-17:00 Session 15: Parameterized algorithms
Location: Amphi 2
| 16:20 | On the rank and the general position number in cycle convexity (abstract) |
| 16:40 | Minimum Clique Bicoloring (abstract) |
Wednesday, June 10th
View this program: with abstractssession overviewtalk overview
09:00-10:20 Session 17: Approximation
Location: Amphi 2
| 09:00 | Minimizing Makespan in Sublinear Time via Weighted Random Sampling (abstract) |
| 09:20 | Fast Order Statistics with Group Inequality Testing (abstract) |
| 09:40 | Domination and Coverage Problems under Vulnerability Constraints (abstract) |
| 10:00 | Hardness of SetCover Reoptimization (abstract) |
10:20-10:40 Session 18: Break
Location: Cafeteria
10:40-11:30 Session 19: Plenary talk 2
Neeldhara Misra - On Fairness with Graphical Valuations
Location: Amphi 2
11:30-12:30 Session 20: Structural graph theory
Location: Amphi 2
| 11:30 | On $(1,\leq l)$-locating-dominating codes in infinite triangular grid (abstract) |
| 11:50 | Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs (abstract) |
| 12:10 | (Even hole, triangle)-free graphs revisited (abstract) |
12:30-14:00 Session 21: Lunch
Location: A002/A004
14:00-18:00 Excursion at Puy de Dôme
- Bus departure at 14h00
- Train for the top at 14h40
- Return train at 17h20
- Departure for the city center at 18h00
19:00-22:00 Gala dinner at Brasserie Madeleine
Address : 3 place de la Victoire, 63000 Clermont-Ferrand, France
Thursday, June 11th
View this program: with abstractssession overviewtalk overview
09:00-10:20 Session 22: Graph algorithms
Location: Amphi 2
| 09:00 | Hardness Results on Bondage and Reinforcement Problems in Chordal Graphs (abstract) |
| 09:20 | An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs (abstract) |
| 09:40 | Degree Realization with Maximum Matching (abstract) |
| 10:00 | On the Complexity of Vertex-Splitting Into an Interval Graph (abstract) |
10:20-10:40 Session 23: Break
Location: Cafeteria
10:40-11:30 Session 24: Plenary talk 3
Pierre Fraigniaud - Algorithmic Meta-Theorems for Distributed Computing
Location: Amphi 2
11:30-12:30 Session 25: Parameterized algorithms 2
Location: Amphi 2
| 11:30 | Dominating Set with Quotas: Balancing Coverage and Constraints (abstract) |
| 11:50 | The Parameterized Complexity of Scheduling with Precedence Delays: Shuffle Product and Directed Bandwidth (abstract) |
| 12:10 | On the Complexity of Signed Domination (abstract) |
12:30-14:00 Session 26: Lunch
Location: A002/A004
Friday, June 12th
View this program: with abstractssession overviewtalk overview
12:30-14:00 Session 29: Lunch
Location: A002/A004