\documentclass{report}
\usepackage{latexsym,a4}
\usepackage{epsf,graphicx}
\pagestyle{empty}


\begin{document}
\begin{center}
\Large

\vfill
{\bf\Huge GOBLIN}

\vspace{1cm}
{\bf A C++ Library for Graph Matching \\
and Network Programming Problems}

\vfill
{\it by Dr.Christian Fremuth-Paeger \\ University of Augsburg, Germany}
\vfill


\vfill
\epsfxsize=5cm
\epsfbox{lgraph1.eps}
\epsfxsize=5cm
\hspace*{2cm}
\epsfbox{lgraph2.eps}

\vspace{1cm}
{\bf A Graph and its Line Graph}
\vfill

\clearpage

\vfill
\epsfxsize=11cm
\epsfbox{gsearch.eps}

\vspace{1cm}
{\bf A Shortest Path Tree}
\vfill


\vfill
\epsfxsize=11cm
\epsfbox{tjoin.eps}

\vspace{1cm}
{\bf A $T$-Join Shortest Path}
\vfill

\clearpage

\vfill
\epsfxsize=10cm
\epsfbox{mintree.eps}

\vspace{1cm}
{\bf Intermediate Step of the Prim Method}
\vfill


\vfill
\epsfxsize=8cm
\epsfbox{connect2.eps}

\vspace{1cm}
{\bf Blocks and 2-Edge Connectivity}
\vfill

\clearpage

\vfill
\epsfxsize=12cm
\epsfbox{connect3.eps}

\vspace{1cm}
{\bf Edge Connected Components of Order 3}
\vfill


\vfill
\epsfxsize=9cm
\epsfbox{maxflow2.eps}

\vspace{1cm}
{\bf Maximum Flow and Minimum Cut}
\vfill

\clearpage

\vfill
\epsfxsize=11cm
\epsfbox{maxmean.eps}

\vspace{1cm}
{\bf A Maximum Mean Cycle}
\vfill


\vfill
\epsfxsize=10cm
\epsfbox{optmatch.eps}

\vspace{1cm}
{\bf An Optimum $2$-Factor}
\vfill

\clearpage

\vfill
\epsfxsize=10cm
\epsfbox{gedecomp.eps}

\vspace{1cm}
{\bf Gallai-Edmonds Decomposition}
\vfill


\vfill
\epsfxsize=12cm
\epsfbox{steiner.eps}

\vspace{1cm}
{\bf A Steiner Tree}
\vfill

\clearpage

\vfill
\epsfxsize=4.5cm
\epsfbox{postman1.eps}
\epsfxsize=4.5cm
\hspace*{2cm}
\epsfbox{postman2.eps}

\vspace{1cm}
{\bf A Graph and a Minimum Eulerian Supergraph}
\vfill


\vfill
\epsfxsize=7cm
\epsfbox{dodeka.eps}

\vspace{1cm}
{\bf $3$-Colouring of the Dodecahedron}
\vfill

\clearpage

\vfill
\epsfxsize=9cm
\epsfbox{subgradient.eps}

\vspace{1cm}
{\bf Optimal $1$-Tree forming a Tour}
\vfill


\vfill
\epsfxsize=6.5cm
\epsfbox{queens.eps}

\vspace{1cm}
{\bf Maximum Stable Set of Queens on a Chessboard}
\vfill

\clearpage

\vfill
\epsfxsize=7.cm
\epsfbox{candidates.eps}

\vspace{1cm}
{\bf TSP Candidate Graph}
\vfill


\vfill
\epsfxsize=3.5cm
\epsfbox{split1.eps}
\epsfxsize=7cm
\hspace*{1cm}
\epsfbox{split2.eps}

\vspace{1cm}
{\bf A Digraph and its Split Graph}
\vfill

\clearpage

\vfill
\epsfxsize=11cm
\epsfbox{surface.eps}

\vspace{0.5cm}
{\bf Surface Graph for \\ Edmonds' Arborescence Algorithm}
\vfill


\vfill
\epsfxsize=11cm
\epsfbox{pr76.eps}

\vspace{1cm}
{\bf Optimal Tour and $2$-Factor}
\vfill

\clearpage

\vfill
\epsfxsize=12cm
\epsfbox{fibheap.eps}

\vspace{0.5cm}
{\bf Fibonacci Heaps}
\vfill

\end{center}
\end{document}
