Program

Video recording of Laci Lovász' plenary talk (Partitioning and decomposing graphs) presented just prior the Building Bridges II conference at the 20th European Conference on Mathematics for Industry, Budapest, June 18^th, 2018.

Volume of abstracts can be downloaded here.

Clicking on the titles in dark red video recording of the talk opens up.

Monday, July 2^nd

Time	Speaker	Title
7:30 - 8:45	Registration
8:45 - 9:00	Opening	Part 1 Part 2
9:00 - 9:50	Noga Alon	Lovász, vectors, graphs and codes
10:00 - 10:50	Anders Björner	Continuous matroids revisited
10:50 - 11:20	Coffee Break
11:20 - 12:10	Persi Diaconis	Approximate counting; A conversation with Laci
12:10 - 14:00	Lunch break
14:00 - 14:50	Béla Bollobás	The Sharp Threshold for Making Squares
15:00 - 15:50	Sourav Chatterjee	Large deviations for random graphs
15:50 - 16:20	Coffee break
16:20 - 17:10	László Babai	A palace made of gems: The Laci Lovász treasure chest
17:20 - 17:45	Péter Csikvári	Sidorenko-type inequality for determinants
08:45 - 18:00	Posters posted	Apers, Assiyatun, Barabás, Molontay, Baskoro, Cao, Corsten

Tuesday, July 3^rd

Time	Speaker	Title
9:00 - 9:50	Uriel Feige	Bipartite matching games
10:00 - 10:50	Jacob Fox	Advances on regularity methods and its applications
10:50 - 11:20	Coffee Break
11:20 - 12:10	Tibor Jordán	Globally rigid graphs and frameworks
12:10 - 14:00	Lunch break
14:00 - 14:50	Gil Kalai	Demolishing bridges and building new ones
15:00 - 15:50	Van Vu	Real roots of Random functions
15:50 - 16:20	Coffee break
16:20 - 17:10	Ravi Kannan	Singular Value Decomposition in Algorithms: Proofs to Practice
17:20 - 17:45	Ágnes Backhausz	On the graph limit approach to the eigenvectors of random graphs
08:45 - 18:00	Posters posted	Cox, Dastjerdi, English, Farhrbach, Granovsky, Harper, Hyde, Issac

Wednesday, July 4^th

Time	Speaker	Title
9:00 - 9:50	Peter Keevash	Coloured and directed designs
10:00 - 10:50	Nati Linial	Some challenges in high-dimensional combinatorics
10:50 - 11:20	Coffee Break
11:20 - 12:10	Jaroslav Nešetřil	Structural limits, lifts and clustering
12:10 - 14:00	Lunch break
14:00 - 14:50	Alexander Razborov	Semantic Limits of Combinatorial Objects
15:00 - 15:50	Lex Schrijver	On ϑ and Θ
15:50 - 16:20	Coffee break
16:20 - 17:10	Joel Spencer	Needles in Exponential Haystacks
17:20 - 17:45	Hamed Hatami	Polynomial method and graph bootstrap percolation
08:45 - 18:00	Posters posted	Istraete, Jenne, Kamcev, Salum, Kodess, Li, Long, Long
19:30 -	Banquet	Boat cruise on the Danube

Thursday, July 5^th

Time	Speaker	Title
9:00 - 9:50	Endre Szemerédi	Embedding graphs into larger graphs, results, methods and problems
10:00 - 10:50	Tamás Szőnyi	Directions and blocking sets
10:50 - 11:20	Coffee Break
11:20 - 12:10	Éva Tardos	Small-loss bounds for online learning with partial information
12:10 - 14:00	Lunch break
14:00 - 14:50	Balázs Szegedy	Limits and exchangeability in the additive setting
15:00 - 15:50	Jennifer Chayes	Graphons and Graphexes as Limits of Sparse Graphs
15:50 - 16:20	Coffee break
16:20 - 17:10	Christian Borgs	Graphexes and Multigraphexes: A Deeper Look
17:20 - 17:45	Endre Csóka	Local algorithms on random graphs
08:45 - 18:00	Posters posted	Makowsky, Martins, Mohr, Papp, Pehova, Petti, Revuelta, Shlyk

Friday, July 6^th

Time	Speaker	Title
9:00 - 9:50	Terence Tao	Recent progress on Liouville sign patterns
10:00 - 10:50	Gábor Tardos	Extremal theory of vertex or edge ordered graphs
10:50 - 11:20	Coffee Break
11:20 - 12:10	Santosh Vempala	With or Without KLS
12:10 - 14:00	Lunch break
14:00 - 14:50	Avi Wigderson	Mathematics and Computation (through the lens of one problem and one algorithm)
14:50 - 15:20	Coffee break
15:20 - 15:45	László Végh	A constant-factor approximation algorithm for the asymmetric traveling salesman problem
08:45 - 16:00	Posters posted	Kaszanitzky, Simanjuntak, Simon, Varga, Volec, Walczak, Xu, Zhang

Back to main page