From: Martin Mares <mj@ucw.cz>
Date: Wed, 1 Oct 2008 13:29:04 +0000 (+0200)
Subject: Mention grant and thesis.
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=cb3f85e3ff2fcd8165ecbe4ab4b6947cb86ffb2c;p=saga.git

Mention grant and thesis.
---

diff --git a/biblio.bib b/biblio.bib
index a21c1c0..5b86570 100644
--- a/biblio.bib
+++ b/biblio.bib
@@ -1598,3 +1598,10 @@
   pages={724--742},
   year={1976},
 }
+
+@phdthesis{ mm:thesis,
+  author={Mare\v{s}, M.},
+  title={{Graph Algorithms}},
+  school={{Charles University in Prague, Faculty of Math and Physics}},
+  year={2008},
+}
diff --git a/mst.tex b/mst.tex
index 97dad84..6d97dc1 100644
--- a/mst.tex
+++ b/mst.tex
@@ -57,7 +57,8 @@ mosaic.
 When compared with the earlier surveys on the minimum spanning trees, most
 notably Graham and Hell \cite{graham:msthistory} and Eisner \cite{eisner:tutorial},
 this work adds many of the recent advances, the dynamic algorithms and
-also the relationship with computational models.
+also the relationship with computational models. It is based on the author's
+PhD thesis \cite{mm:thesis}.
 
 \nota
 We have tried to stick to the usual notation except where it was too inconvenient.
diff --git a/saga.tex b/saga.tex
index 329e3ca..c977ecb 100644
--- a/saga.tex
+++ b/saga.tex
@@ -10,7 +10,8 @@
 \medskip
 \centerline{Department of Applied Mathematics}
 \centerline{and}
-\centerline{Institute of Theoretical Computer Science}
+\centerline{Institute of Theoretical Computer Science\foot{%
+Partially supported by grant 1M0021620808 of the Czech Ministry of Education.}}
 \centerline{Charles University}
 \centerline{Malostransk\' e n\' am. 25, 118~00 Praha, Czech Republic}