\begin{thebibliography}{1}

\bibitem{gia2}
George Giakkoupis.
\newblock {Tight bounds for rumor spreading in graphs of a given conductance}.
\newblock In Thomas Schwentick and Christoph D{\"u}rr, editors, {\em 28th
  International Symposium on Theoretical Aspects of Computer Science (STACS
  2011)}, volume~9 of {\em Leibniz International Proceedings in Informatics
  (LIPIcs)}, pages 57--68, Dagstuhl, Germany, 2011. Schloss
  Dagstuhl--Leibniz-Zentrum fuer Informatik.

\end{thebibliography}
