Discrete Mathematics and Optimization - A Group Meeting
Information
Time: Tuesday 4.00pm - 5.00pm
Location: MC 320
Subscribe to the DMO mailing list
here.
Scheduled Talks
Tuesday, April 9, 2013
Morphic Words and Nested Recurrence Relations
Marcel Celaya
Previous Talks
Tuesday, March 19, 2013
Rainbow Turán Problems
Jonathan Noel
Tuesday, March 26, 2013
Sidorenko’s conjecture for a class of graphs
Liana Yepremyan
Tuesday, February 13 and 20, 2013
Title: Proof of (n/2-n/2-n/2)-Conjecture for large n
Hehui Wu
February 5 2013.
Graph connectivities, network coding, and expander graphs
Bundit Laekhanukit
Thursday, December 6, 2012.
Market Clustering and the Fundamental Theorems of Welfare Economics
Adrian Vetta
Thursday, November 15, 2012.
A proof of a conjecture of Ohba
Jonathan Noel
Thursday, November 1, 2012.
Communication Complexity
Anil Ada
Thursday, October 25, 2012.
The mixing time of the Newman-Watts small world
Tao Lei
Thursday, October 18, 2012.
A Rounding by Sampling Approach to the Minimum Size k-Arc
Connected Subgraph Problem
Bundit Laekhanukit
Thursday, October 11, 2012.
Nearly Tight Linear Programming Bounds for Demand Matching in Bipartite Graphs
Hehui Wu
Wednesday, March 21 and Friday, March 24, 2012.
Composition of low-error 2-query PCPs using decodable PCPs
Bundit Laekhanukit
Friday, March 9, 2012
The Communication Complexity of Gap Hamming Distance
Omar Fawzi
Friday, February 17 and Wednesday, February 22, 2012
A quasi-polynomial Freiman-Ruzsa theorem
Hamed Hatami
Friday, January 13, 2012
Hardness of Approximating Rooted k-Connectivity Problems
Bundit Laekhanukit
Thursday, December 8, 2011
Packet Routing with BGP
Adrian Vetta
Thursday, September 1, 2011
An extension of Nash-Williams for two infinite family of graphs
Chenglong Zou
Thursday, August 11, 2011
Hat game on graphs
Peter Sloan
Thursday, July 14, 2011
Complexity analysis of some routing problems
Gerardo Berbeglia
Thursday, June 23, 2011
Bounded rationality: lookahead search and some applications
Adrian Vetta
Thursday, April 14, 2011
Connectivity Threshold for Bluetooth Graphs
Nicolas Fraiman
Thursday, March 25, 2011
Embedding small and big trees into graphs
Laura Eslava
Thursday, Febuary 3, 2011
Linear time algorithms for graph minors
Zhentao Li
Thursday, January 27, 2011
Approximation algorithms for (S,T)-connectivity problems.
Bundit Laekhanukit
Thursday, January 6, 2011
Packing T-joins in Planar Graphs
Katherine Edwards
Thursday, November 25, 2010
Fractional Graph Colouring
Sean Kennedy
Thursday, November 18 (and December 2), 2010
Tight spans of distances and the dual fractionality of undirected multiflow problems
Guyslain Naves
Thursday, October 21, November 4 2010
Open Problems Session
Thursday, October 14, 2010
On the Efficiency of Markets with Two-sided Proportional Allocation
Mechanisms
Volodymyr Kuleshov
Thursday, September 30 and October 7, 2010
Approximation Algorithms for LabelCover Problems
Bundit Laekhanukit
Wednesday, September 15, 2010
Some open problems in Graph Theory
Zhentao Li