diff -r eb2f9d453070 -r 1c978b5bcc65 lemon/hartmann_orlin_mmc.h
--- a/lemon/hartmann_orlin_mmc.h	Sat Mar 16 14:11:32 2013 +0100
+++ b/lemon/hartmann_orlin_mmc.h	Mon Mar 18 17:41:19 2013 +0100
@@ -98,7 +98,7 @@
   ///
   /// This class implements the Hartmann-Orlin algorithm for finding
   /// a directed cycle of minimum mean cost in a digraph
-  /// \ref hartmann93finding, \ref dasdan98minmeancycle.
+  /// \cite hartmann93finding, \cite dasdan98minmeancycle.
   /// This method is based on \ref KarpMmc "Karp"'s original algorithm, but
   /// applies an early termination scheme. It makes the algorithm
   /// significantly faster for some problem instances, but slower for others.