On the Densest k-Subgraph problem (no audio)
Aravindan VijayaraghavanPrinceton University

You may browse the slides
in the presentation (a browser capable of displaying PNG graphics
is required).
Or, you may download a higher-resolution printer-ready
version
in PDF format
(requires Acrobat Reader).