Past Events
May
02
Discrete Mathematics Seminar
Ankur Moitra , IAS
A polynomial time algorithm for lossy population recovery
Apr
18
Apr
11
Discrete Mathematics Seminar
Vaidy Sivaraman , Binghamton University
Transversal signed-graphic matroids
Mar
28
Discrete Mathematics Seminar
Tony Huynh , Simon Fraser
Even-cycle decompositions of graphs with no odd-K_4-minor
Mar
14
Discrete Mathematics Seminar
Tom Hales , University of Pittsburgh Mellon
Informal and formal verification of nonlinear inequalities with applications to discrete geometry
Mar
07
Discrete Mathematics Seminar
Amanda Redlich , Rutgers University
Graph constructions, graph decompositions, and random graphs
Feb
21
Feb
14
Discrete Mathematics Seminar
Emmanuel Abbe , Princeton University
Polar codes and randomness extraction for structured sources
Dec
06
Discrete Mathematics Seminar
David Pritchard, Princeton University
Cover-decomposition and polychromatic numbers
Nov
29
Nov
15
Discrete Mathematics Seminar
Bruce Reed , McGill University
How long does it take to catch a drunk miscreant?
Nov
08
Oct
25
Discrete Mathematics Seminar
Manor Mendel , Open U Israel and IAS
Expanders with respect to random regular graphs
Oct
18
Discrete Mathematics Seminar
Shiva Kintali, Princeton University
Directed width parameters: algorithms and structural properties
Oct
11
Oct
04
Discrete Mathematics Seminar
Sanjeev Arora, Princeton University
What have we learned about graph partitioning?
Sep
27
Sep
20
Discrete Mathematics Seminar
Peter Nelson, Victoria University of Wellington
The Erdos-Stone Theorem for finite geometries