Graphs and surfaces: algorithms, combinatorics and topology / Graphes et surfaces : algorithmique, combinatoire et topologie

Collection Graphs and surfaces: algorithms, combinatorics and topology / Graphes et surfaces : algorithmique, combinatoire et topologie

Organizer(s) Colin de Verdière, Éric ; Schaeffer, Gilles

Date(s) 09/05/2016 - 13/05/2016

linked URL http://conferences.cirm-math.fr/1438.html

00:00:00 / 00:00:00

4 4

Algorithmic aspects of embeddability: higher-dimensional analogues of graph planarity

Information about the video

Date of recording 12/05/2016
Date of publication 26/05/2016
Institution CIRM
Licence CC BY NC ND
Language English
Audience Researchers, Graduate Students
Director(s) Guillaume Hennenfent
Format MP4

Citation data

DOI 10.24350/CIRM.V.18968203
Cite this video Wagner, Uli (12/05/2016). Algorithmic aspects of embeddability: higher-dimensional analogues of graph planarity. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.18968203
URL https://dx.doi.org/10.24350/CIRM.V.18968203

Domain(s)

MSC codes

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow

All the collection videos

01:20:38

published on May 26, 2016

Coloring graphs on surfaces

By Louis Esperet

01:01:11

published on May 26, 2016

Embedding extension problems

By Bojan Mohar

01:19:10

published on May 26, 2016

Bidimensionality and subexponential parameterized algorithms

By Dimitrios Thilikos

01:40:06

published on May 26, 2016

Algorithmic aspects of embeddability: higher-dimensional analogues of graph planarity

By Uli Wagner

Copyright Carmin.tv 2026

Give feedback