\usepackage[section,ruled]{algorithm}
\newtheorem{thm}{Theorem}[section]
\renewcommand{\thealgorithm}{\arabic{section}.\arabic{algorithm}}
\section{Introduction}\label{sec:intro}
The progress that has been made to date is summarized later in Section 
\section{Notation}
\section{An Elegant and Simple Torus Embedding Algorithm}\label{sec:newalg}
%\subsection{A Brief History of Graph Embedding Algorithms}
\subsection{Quadratic Planar Embedding: the DMP Algorithm}
\subsection{Exponential Torus Embedding: DMP-Style}
with two caveats which we will explore in the next sections.
\subsection{Finding a Kuratowski Subgraph}
\subsection{Where to Embed a Bisecting Path}
%\subsection{Challenging Faces}
\subsection{Bridge Penalties}\label{penalty}
The caveats described in Section \ref{bisectingpath} lend our algorithm nicely to the use of recursion to explore
\subsection{Pseudocode}
%We will explain where this penalty comes from as we proceed through the next sections.
	\STATE Choose a bisecting path $P$ from $B$ with endpoints $u_{f}$ and $v_{f}$ (see Section \ref{penalty}).
%\subsection{Correctness and Exponential Running Time}
\subsection{Improving the Running Time}
\subsection{Results}
\section{The Known Torus Obstructions}
\section{Conclusions and Future Work}
As evidenced by the number of authors mentioned in Section \ref{knownobs} 
\section{The Torus Obstructions}
%\section{Afterword}
%We are grateful to all of the authors who have contributed to generating the large collection of obstructions presented here.
