search

Tag - Graph Embedding

Computing a maximum independent set in a graph embedded in a fixed surface when the odd cycle packing number is bounded Wed, Jan 16, 2019 12:30 CET

Speakers: Samuel Fiorini

Tomorrow Sam will tell us how to compute a maximum independent set in a graph embedded in a fixed surface if there are not many disjoint odd cycles in the graph. Note the unusual room: NO8.202 ("petit séminaire"), because of exams taking place in the other rooms.

Graph Embedding inside a polygon Wed, Jan 31, 2018 12:30 CET

Speakers: Till Miltzow

Excluded minors for isometric embeddings of graphs in $\ell_\infty^k$-spaces Wed, May 31, 2017 12:30 CEST

Speakers: Carole Muller