Graph Algorithms (14X061)

Enseignant : Arnaud Casteigts
Assistants : Himika Das

Every Monday, room 301 (Battelle campus) - 11am (course) - 2pm (exercises).

Other pages for this class

• Moodle (all documents + communications)
• Unige (administrative page)
• Previous years (may differ from this year)

Lecture notes

This section will be updated after each class.

• Preambule: [slides]

1. Basics of graph theory: [lecture notes]
2. Basic algorithms: [lecture notes]

Mini-class projects (in May 2026)

Objective: give a mini-class on a particular topic. Using slides is strongly recommended, possibly with hybrid content on the whiteboard.

Timing: 10 to 15 minutes + 5 minutes of questions.

Typical plan:

1. Broader context and overview of known results on this topic (3 to 5 min)
2. Presentation of a particular algorithm or theorem (5 to 8 min)
3. If applicable, main challenges or conjectures (∼3 min)
4. Questions