ACO The ACO Seminar (2014–2015)

Spring 2014

Jan. 15, 3:30pm, Wean 8220
Alexander Barvinok, University of Michigan
Computing partition functions in hard problems of combinatorial optimization

Jan. 21 and Jan. 23, 3:30pm, Wean 8220   (Note 2-day lecture series on unusual days)
Nike Sun, MIT
The exact k-SAT threshold for large k

Feb. 5, 3:30pm, Wean 8220
Sergey Norine, McGill University
Densities of minor-closed families of graphs

Feb. 26, 3:30pm, Wean 8220
Milan Bradonjic, Bell Labs, Alcatel-Lucent
Asymptotic laws for coloring sparse random geometric graphs with constant number of colors

Mar. 12, 3:30pm, Wean 8220
Tobias Müller, Utrecht University
Hyperbolic random geometric graphs

Mar. 19, 3:30pm, Gates 8102   (Note unusual location)
Shahin Kamali, University of Waterloo
Online bin packing problem: alternative analysis methods and new applications

Mar. 26, 3:30pm, Wean 8220
Andrew McDowell, Carnegie Mellon University
DNA origami and the complexity of Eulerian circuits with turning costs

Apr. 20, 4:30pm, Porter Hall 226A   (Note unusual day, time, and location)
David Conlon, University of Oxford
On the Erdős–Gyárfás problem in generalised Ramsey theory

Apr. 30, 3:30pm, Wean 8220
Robin Pemantle, UPenn
Permutations and sumsets of a random Poisson-Zipf set

May. 7, 3:30pm, Gates 6115   (Note unusual location)
Kevin Schewior, TU Berlin
New Results on Resource Augmentation in Online Deadline Scheduling

Fall 2014

Sep. 25, 3:30pm, Wean 8220
Oleg Pikhurko, University of Warwick
Measurable equidecompositions via augmenting paths

Oct. 2, 3:30pm, Wean 8220
Jie Ma, Carnegie Mellon University
Relations between digraph colorings and cycle class

Oct. 9, 3:30pm, Wean 8220
Humberto Naves, Institute for Mathematics and its Applications, University of Minnesota
The threshold probability for long cycles

Oct. 29, noon, Gates 6115   (Note unusual day, time and location)
Noga Alon, Tel Aviv University
The Complexity of Forming an Effective Government  (Algorithmic Economics Seminar/Theory Lunch)

Oct. 30, 3:30pm, Gates 8115   (Note unusual location)
Thomas Rothvoß, University of Washington
The matching polytope has exponential extension complexity

Nov. 13, 3:30pm, Wean 8220
Mikhail Kapralov, IBM Watson
Spectral Sparsification in Dynamic Streams

Nov. 20, 3:30pm, Wean 8220
Hoi Nguyen, Ohio State University
Near invariance of the hypercube

Nov. 27, everywhere except Wean 8220
Turkey, Thanksgiving

Dec. 4, 3:30pm, Wean 8220
Hao Huang, Institute for Mathematics and its Applications, University of Minnesota
Biclique decomposition of random graphs

If you want to be a speaker or have questions or suggestions about the seminar, please contact the organizer: Boris Bukh ()

Subscribe to the ACO seminar mailing list

Past Schedule:

1995–96 1996–97 1998–99 1999–00 2000–01 2001–02 2004–05 2005–06 2006–07 2007–08 2008–09 2009–10 2010–11 2011–12 2012–13 2013–14

ACO Back to the ACO home page