This is the example conference talk shipped with Beamer, by Till Tantau and co-authors. The talk is on the complexity of SNP block partitioning, with five authors' affiliations on the title slide. It uses an outline and four sections: Introduction, Bad News: Hardness Results, Good News: Tractability Results and Summary. TikZ draws the diagrams, and babel, fontenc and inputenc are loaded. It runs to 31 pages.
Shared under the GNU General Public License v2.0 or later. All credit to Vedran Miletić, Till Tantau, Louis Stuart; the licence comes with the project's files.