Frédéric Meunier
CERMICS, École nationale des ponts et chaussées

---

Slides

• Don't choose between workload balance and makespan minimization

• Existence results in topological combinatorics with open complexity status

• Topological bounds for graph representations

• A multilabeled version of Fan's lemma

• The mathematical work of Pierre Duchet (in French)

• Envy-free cake cutting

• New algorithms for crew pairing

• Colorful subgraphs of Kneser graphs

• A business dinner problem

• Bike sharing and operations research (survey)

• Uniqueness of equilibrium

• Hedetniemi's conjecture for Kneser hypergraphs

• The splitting necklace problem (popularization)