|
|
Symposium Diskrete Mathematik 2016Freie Universität Berlin
|
|
|
|
|
|
|
|
|
|
|
______Home______Program______Registration______Booklet______Accommodation______Travel______Richard-Rado Prize______Poster
|
|
|
|
|
|
|
|
|
Schedule
The schedule of the Symposium can be found here.
Petter Brändén (Stockholm): Hyperbolic polynomials and matroids
Ben Green (Oxford): Permutations and number theory
Jochen Koenemann (Waterloo): From Deadline Scheduling to Information Cascades in Networks
Daniela Kühn (Birmingham): Decompositions and packings of graphs
Marc Noy (Barcelona): Random cubic planar graphs revisited
Johannes Carmesin (Cambridge): All infinite graphs have tree-decompositions displaying their topological ends
Shagnik Das (Berlin): Families of Mass Destruction
Florian Frick (Ithaca): Intersection Patterns of Finite Sets and of Convex Sets
Katharina Jochemko (Vienna): Discrete vs. Continous valuations: similarities and differences
Felix Joos (Birmingham): A Flat Wall theorem for group-labelled graphs and its applications
Lukas Katthän (Frankfurt): Which formal power series are Hilbert series?
Florian Lehner (Hamburg): The reconstruction problem for infinite graphs
Stefan Weltge (Zürich): Maximum Semidefinite and Linear Extension Complexity of Families of Polytopes
|
|