diff --git a/Miscellany/doc/Miscellany/CGAL/Union_find.h b/Miscellany/doc/Miscellany/CGAL/Union_find.h
index c970f277442..6356961db95 100644
--- a/Miscellany/doc/Miscellany/CGAL/Union_find.h
+++ b/Miscellany/doc/Miscellany/CGAL/Union_find.h
@@ -99,13 +99,13 @@ containing `x` and returns a handle to it.
 handle make_set(const T& x); 
 
 /*! 
-same as `make_set(x)`. 
+same as `make_set()`. 
 */ 
 handle push_back(const T& x) ; 
 
 /*! 
 inserts the range of values referenced by `[first,beyond)`. 
-\cgalRequires value type of `Forward_iterator` is `T`. 
+\tparam Forward_iterator must be a forward iterator with value type `T`. 
 */ 
 template <class Forward_iterator> void 
 insert(Forward_iterator first, Forward_iterator beyond) ; 
diff --git a/Miscellany/doc/Miscellany/CGAL/Unique_hash_map.h b/Miscellany/doc/Miscellany/CGAL/Unique_hash_map.h
index 4cb72d625c2..807bdd4c683 100644
--- a/Miscellany/doc/Miscellany/CGAL/Unique_hash_map.h
+++ b/Miscellany/doc/Miscellany/CGAL/Unique_hash_map.h
@@ -30,7 +30,7 @@ rehashing when set to the number of expected elements in the map.
 The design is derived from the \stl `hash_map` and the \leda type 
 `map`. Its specialization on insertion only and unique hash values 
 allow for a more time- and space-efficient implementation, see also 
-[\cite mn-lpcgc-00 Chapter 5. This implementation makes also use 
+\cite mn-lpcgc-00, Chapter 5. This implementation makes also use 
 of sentinels that lead to defined keys that have not been inserted. 
 
 */