Program of the 91福利-Weizmann 2019 workshop
Monday (May 13):
09:45 – 10:00: Welcome remarks
10:00 – 10:45: Coresets for clustering in graphs with bounded treewidth ()
10:45 – 11:00: Coffee break
11:00 – 11:45: Low congestion cycle covers and their applications ()
11:45 – 12:15: Dynamic algorithms for graph coloring ()
12:30 – 14:00: Lunch (Radcliffe)
14:15 – 16:00: Research meetings (MB 2.23 and MB 2.24)
16:00 – 16:30: Coffee break
16:30 – 18:00: Research meetings (MB 2.23 and MB 2.24)
18:30 – 19:45: Dinner (Scarman)
Tuesday (May 14):
10:00 – 11:00: The reachability problem for Petri nets is not elementary (Ranko Lazi膰)
11:00 – 11:30: Coffee break
11:30 – 12:15: Refined vertex sparsifiers of planar graphs (Havana Rika)
12:30 – 14:00: Lunch break (no lunch provided)
14:15 – 16:00: Research meetings (MB 2.22 and MB 2.24)
16:00 – 16:30: Coffee break
16:30 – 18:00: Research meetings (MB 2.24)
19:00 – Dinner at
Wednesday (May 15):
10:00 – 10:45: Universal trees and quasipolynomial bounds for parity games ()
10:45 – 11:15: Coffee break
11:15 – 12:00: Zero knowledge proofs in a quantum world ()
12:15 – 13:45: Lunch at the workshop site
13:45 – Excursion to
Thursday (May 16):
10:00 – 10:45: Stochastic bloc model and the replica symmetric phase ()
10:45 – 11:15: Coffee break
11:15 – 12:00: Tight lower bound for comparison based quantile summaries (Pavel Vesel媒)
12:15 – 14:00: Lunch (Scarman)
14:15 – 16:00: Research meetings (MB 2.23 and MB 2.24)
16:00 – 16:30: Coffee break
16:30 – 18:00: Research meetings (MB 2.23 and MB 2.24)
All research presentations are in room MB 2.24 in the Mathematical Sciences Building on the 91福利 central campus
All research meetings are in a subset of MB 2.22, MB 2.23 or MB 2.24 in the Mathematical Sciences Building
Workshop participants