diff --git a/Packages/Snap_rounding_2/doc_tex/Snap_rounding_2/snap.tex b/Packages/Snap_rounding_2/doc_tex/Snap_rounding_2/snap.tex
index 66273906701..14555760e17 100644
--- a/Packages/Snap_rounding_2/doc_tex/Snap_rounding_2/snap.tex
+++ b/Packages/Snap_rounding_2/doc_tex/Snap_rounding_2/snap.tex
@@ -23,13 +23,13 @@
 \section{Introduction}
 Snap Rounding (SR, for short) is a well known method for converting
 arbitrary-precision arrangements of segments into a fixed-precision
-representation \cite{gght-srlse-97, gm-rad-98, cgal:h-psifp-99}. In
+representation \cite{gght-srlse-97, gm-rad-98, h-psifp-99}. In
 the study of robust geometric computing, it can be classified
 as a finite precision approximation technique. Iterated Snap Rounding
 (ISR, for short) is a modification of SR in which each vertex is at least
 half-the-width-of-a-pixel away from any non-incident edge
-\cite{hp-isr-02}. This package supports both methods. Algorithmic
-details and experimental results are given in \cite{hp-isr-02}.
+\cite{cgal:hp-isr-02}. This package supports both methods. Algorithmic
+details and experimental results are given in \cite{cgal:hp-isr-02}.
 
 \begin{figure}
 \begin{ccTexOnly}
@@ -78,7 +78,7 @@ the results of SR and ISR on the same input.
 \section{Terms and Software Design}
 
 Our package supports both schemes, implementing the algorithm
-described in \cite{hp-isr-02}.
+described in \cite{cgal:hp-isr-02}.
 Although the paper only describes an algorithm for ISR,
 it is easy to derive an algorithm for SR, by performing only
 the first rounding level for each segment.
diff --git a/Packages/Snap_rounding_2/doc_tex/Snap_rounding_2_ref/snap_ref.tex b/Packages/Snap_rounding_2/doc_tex/Snap_rounding_2_ref/snap_ref.tex
index 6e890cfe3ef..c9cc76883f7 100644
--- a/Packages/Snap_rounding_2/doc_tex/Snap_rounding_2_ref/snap_ref.tex
+++ b/Packages/Snap_rounding_2/doc_tex/Snap_rounding_2_ref/snap_ref.tex
@@ -22,13 +22,13 @@
 
 Snap Rounding (SR, for short) is a well known method for converting
 arbitrary-precision arrangements of segments into a fixed-precision
-representation \cite{gght-srlse-97, gm-rad-98, cgal:h-psifp-99}. In
+representation \cite{gght-srlse-97, gm-rad-98, h-psifp-99}. In
 the study of robust geometric computing, it can be classified as a
 finite precision approximation technique. Iterated Snap Rounding (ISR,
 for short) is a modification of SR in which each vertex is at least
 half-the-width-of-a-pixel away from any non-incident edge
-\cite{hp-isr-02}. This package supports both methods. Algorithmic
-details and experimental results are given in \cite{hp-isr-02}.
+\cite{cgal:hp-isr-02}. This package supports both methods. Algorithmic
+details and experimental results are given in \cite{cgal:hp-isr-02}.
 
 Given a finite collection $\S$ of segments in the plane, the
 arrangement of $\S$ denoted $\A(\S)$ is the subdivision of the plane
@@ -50,7 +50,7 @@ pixel in the grid used for rounding. ISR is a modification of SR which
 makes a vertex and a non-incident edge well separated (the distance
 between each is at least half-the-width-of-a-pixel). However, the
 guaranteed quality of the approximation in ISR degrades. For more
-details on ISR see \cite{hp-isr-02}.
+details on ISR see \cite{cgal:hp-isr-02}.
 
 The traits used here must support arbitrary-precision number type as this is a
 basic requirement of SR.