\documentclass[11pt]{article}
\input{18313-preamble}

\begin{document}
\handout{1}{Dan Ports}{2004/05/18}{drkp@mit.edu}{Lectures and Writeups
  List}


\section{Lectures}
\label{sec:lectures}

\begin{enumerate}
\item \textbf{February 25th} --- \emph{Tetris is Hard, Even to
    Approximate}. Erik D. Demaine, Susan Hohenberger, and David
  Liben-Nowell. Technical Report MIT-LCS-TR-865, Massachusetts
  Institute of Technology, October 21, 2002. Grade: \textbf{A}
  
\item \textbf{March 17th} --- \emph{Probabilistic Encryption}.
  Shafrira Goldwasser and Silvio Micali. Journal of Computer and
  System Science, 28:270--299, 1984. Grade: \textbf{A-}
    
\item \textbf{April 30th} --- \emph{A List Analogue of Equitable
    Coloring}{A. V. Kostochka, M. J. Pelsmajer, and D. B. West. J.
    Graph Th. 44-3, Nov. 2003.} Grade: \textbf{A-}
\end{enumerate}


\section{Writeups}
\label{sec:writeups}

\begin{enumerate}
\item \emph{Independent Sets and 2-Factors in Edge-Chromatic-Critical
  Graphs.} Grunewald and Steffen, J Graph Theory 45: 113 118,
  2004. Grade: \textbf{A} 
  
\item \emph{Tetris is Hard, Even to Approximate}. Erik D. Demaine,
  Susan Hohenberger, and David Liben-Nowell. Technical Report
  MIT-LCS-TR-865, Massachusetts Institute of Technology, October 21,
  2002. Grade: \textbf{A}
  
\item \emph{A List Analogue of Equitable Coloring}. {A. V. Kostochka, M.
    J. Pelsmajer, and D. B. West. J.  Graph Th. 44-3, Nov. 2003.}
  Grade: \textbf{A}

\item \emph{The Shoelace Problem}. {J. H. Halton. The Mathematical
  Intelligencer, 1995.} Grade: \textbf{B+}

\item \emph{Site-Swap Notation}. {Marc Strauss. MIT Undergraduate
Journal of Mathematics.} Grade: \textbf{A-}

\item \emph{The Jeep Problem: A More General Solution.} {C. G. Phipps,
  The American Mathematical Monthly, Vol. 54, No. 8. (Oct.,
  1947)}. Grade: \textbf{A}
\end{enumerate}


\section{Overall Grade}
\begin{itemize}
\item \textbf{A}
\end{itemize}

\end{document}
