10:00-10:20
|
Lovász
László (ELTE)
|
Megnyitó
|
10:20-10:45
|
Sebő András (Grenoble)
|
From
Seymour Graphs to the Odd Jungle
|
10:45-11:10
|
Jordán Tibor (ELTE)
|
When
highly k-tree connected graphs are what we need
|
|
kávészünet |
|
11:40-12:05
|
Szigeti Zoltán (Grenoble)
|
Hypergraph Edge Connectivity
Augmentation
|
12:05-12:30
|
Király Tamás
(ELTE/EGRES) |
Hyperedges: potatoes, stars, or cephalopods?
|
|
ebédszünet
|
|
| 14:00-14:25 |
Tardos Éva (Cornell) |
Ad
Auction Nash Equilibria with Conservative Bidders |
14:25-14:50
|
Szabó Jácint
(SZTAKI/ELTE)
|
Matroid
parity and jump systems
|
14:50-15:15
|
Pap Gyula (Cornell)
|
Is there an alternating path algorithm for the path matching problem?
|
|
kávészünet |
|
16:00-16:25
|
Lex Schrijver
(CWI, Amsterdam)
|
Jacobi and the Hungarian Method
|
16:25-16:50
|
Király Zoltán
(ELTE)
|
On partition connectivity
|
16:50-17:15
|
Szegő László
(Corvinus)
|
A distorted point of view: about a stunning joint result with Andras
|
