-\vfill\eject
-
-\appendices
-
-\rawchapter{Publications of Martin Mare\v{s}}
-\medskip
-
-{
-
-\def\bibitem[#1]#2#3\par{\:\eatspaces #3}
-\def\em{\it}
-\frenchspacing
-\newcount\citecount
-\def\newblock{\hskip .11em plus .33em minus .07em }%
-\def\citelist{\numlist\singlecit\rightskip=0pt}
-\def\singlecit{\global\advance\citecount by 1[\the\citecount]}
-\hfuzz=4pt
-
-\citelist
-
-\bibitem[Mar04]{mm:mst}
-M.~Mare\v{s}.
-\newblock {Two linear time algorithms for MST on minor closed graph classes}.
-\newblock {\em {Archivum Mathematicum}}, 40:315--320. Masaryk University, Brno,
- Czech Republic, 2004.
-
-\bibitem[MS07]{mm:rank}
-M.~Mare\v{s} and M.~Straka.
-\newblock Linear-time ranking of permutations.
-\newblock In {\em Algorithms --- ESA 2007: 15th Annual European Symposium},
- volume 4698 of {\em {Lecture Notes in Computer Science}}, pages 187--193.
- Springer Verlag, 2007.
-
-\bibitem[Mar07]{mm:ga}
-M.~Mare\v{s}.
-\newblock {Krajinou grafov\'ych algoritm\accent23u (Through the Landscape of
- Graph Algorithms)}.
-\newblock ITI series 2007--330, Institut Teoretick\'e Informatiky, Praha, Czech
- Republic, 2007.
-\newblock In Czech.
-
-\bibitem[Mar00]{mares:dga}
-M.~Mare\v{s}.
-\newblock {Dynamick\'e grafov\'e algoritmy (Dynamic Graph Algorithms)}.
-\newblock Master's thesis, Charles University in Prague, Faculty of Math and
- Physics, 2000.
-\newblock In Czech.
-
-\bibitem[Mar07b]{mm:grading}
-{M. Mare\v{s}}.
-\newblock {Perspectives on Grading Systems}.
-\newblock {\em Olympiads in Informatics}, 1:124--130. Institute of
- Mathematics and Informatics, Vilnius, Lithuania, 2007.
-
-\endlist
-
-\rawsection{Citations}
-
-\citelist
-
-%S. Tazari and M. Müller-Hannemann
-%Shortest Paths in Linear Time on Minor-Closed Graph Classes with an Application to Steiner Tree Approximation (abstract)
-%submitted for publication, 2007.
-
-\bibitem[HW07]{hochstein:maxflow}
-J.~M. Hochstein and K.~Weihe.
-\newblock {Maximum $s$-$t$-flow with $k$ crossings in $\O(k^3n \log n)$ time}.
-\newblock In {\em SODA 2007: Proceedings of the 18th annual ACM-SIAM symposium
- on Discrete algorithms}, pages 843--847, 2007.
-\newblock Cites~[1].
-
-\bibitem[MHT07]{tazari:mcgc}
-M.~M\"uller-Hannemann and S.~Tazari.
-\newblock {Handling Proper Minor-Closed Graph Classes in Linear Time: Shortest
- Paths and 2-Approximate Steiner Trees}.
-\newblock Tech Report 2007/5, University of Halle-Wittenberg, Institute of
- Computer Science, 2007.
-\newblock Cites~[1].
-
-\endlist
-
-}
-