Fall 2009-2010 - Discrete Math Seminar
<-- Return to the list| MAP Estimation with Perfect Graphs | |
| Speaker | Date/Location |
| Tony Jebara, Columbia University | 11-24-2009 Start Time: 3:00pm End Time: 4:00pm Mudd 303 |
| A polynomial algorithm for the edge-disjoint paths problem in tournaments | |
| Speaker | Date/Location |
| Sasha Fradkin, Princeton University | 11-17-2009 Start Time: 3:00pm End Time: 4:00pm Math 622 |
| Fractionally and integrally co-strongly perfect claw-free graphs | |
| Speaker | Date/Location |
| Yori Zwols, Columbia University | 11-10-2009 Start Time: 3:00pm End Time: 4:00pm Mudd 303 |
| Applying a Local Lemma to Thue games | |
| Speaker | Date/Location |
| Wesley Pegden, Rutgers University | 10-27-2009 Start Time: 3:00pm End Time: 4:00pm Math 622 |
| Counting flags in digraphs | |
| Speaker | Date/Location |
| Sergey Norin, Princeton University | 10-20-2009 Start Time: 3:00pm End Time: 4:00pm Mudd 303 |
| Graph norms and Sidorenko's conjecture | |
| Speaker | Date/Location |
| Hamed Hatami, Princeton University / IAS | 10-13-2009 Start Time: 3:00pm End Time: 4:00pm Math 622 |
| The minimum number of monochromatic $4$-term progressions | |
| Speaker | Date/Location |
| Julia Wolf, Rutgers University | 10-06-2009 Start Time: 3:00pm End Time: 4:00pm Mudd 303 |
| Fast First-Order Methods for Semidefinite Programming Relaxations of Combinatorial Optimization Problems | |
| Speaker | Date/Location |
| Donald Goldfarb, IEOR: Columbia University | 09-29-2009 Start Time: 3:00pm End Time: 4:00pm Math 622 |
| Well-quasi-ordering tournaments and Rao's degree-sequence conjecture | |
| Speaker | Date/Location |
| Paul Seymour, Princeton University | 09-22-2009 Start Time: 3:00pm End Time: 4:00pm Mudd 303 |
| Fractional total colourings of graphs of high girth | |
| Speaker | Date/Location |
| Andrew King, Columbia | 09-15-2009 Start Time: 3:00pm End Time: 4:30pm Math 622 |