AFLB
From ResearchWiki
The Algorithms For Lunch Bunch
Fridays at noon.
Contents |
[edit]
Schedule
[edit]
Oct 30, 2009
All: Discussion of topics for Spring 2010 Algorithms Seminar on Graph Algorithms
- planarity testing
- advanced MSTs ? randomized MST
- other randomized graph algorithms
- treewidth/pathwidth
- minors
- robertson seymour (in brief)
- Baker decomposition for planar graphs
- Klein-Borradaile results on new decompositions
- shortest paths, matrix mult, new developments
- evasiveness in graph properties, and the topological angle
- Spectral graph theory?
[edit]
Nov 7, 2009
- John, Raj: Practice talks for FWCG 09
- Parasaran: Geometry of Soft Clusterings
[edit]
Nov 14, 2009
No AFLB (FWCG 2009)
[edit]
Nov 21, 2009
Pick a paper...
[edit]
Papers for discussion
- Natural Algorithms (Chazelle, SODA 09 Best paper)
- A constructive proof of the general Lovasz Local Lemma (Moser, earlier version STOC 09 Best Student Paper)
- Homology Flows, Cohomology Cuts (Chambers, Erickson and Nayyeri, STOC 09)
- Affiliation Networks (Lattanzi, Sivakumar, STOC 09)
- Sorting and Selection with Imprecise Comparisons (Ajtai, Feldman, Hassidim, Nelson, ICALP 09)
- Quantum Proofs for Classical Theorems (Drucker, Wolf)
