diff --git a/Polynomial/include/CGAL/Polynomial/Polynomial_type.h b/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
index e486952b72c..92570dfb16e 100644
--- a/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
+++ b/Polynomial/include/CGAL/Polynomial/Polynomial_type.h
@@ -477,7 +477,7 @@ public:
 private:
     // NTX not decomposable
     template <class NTX, class TAG >
-    CGAL::Sign sign_at_(const NTX& x, TAG tag) const{
+    CGAL::Sign sign_at_(const NTX& x, TAG) const{
         CGAL_precondition(degree()>=0);
         return CGAL::sign(evaluate(x));
     }
diff --git a/Polynomial/include/CGAL/Polynomial/polynomial_gcd.h b/Polynomial/include/CGAL/Polynomial/polynomial_gcd.h
index f5f067f530a..e74d6d316d6 100644
--- a/Polynomial/include/CGAL/Polynomial/polynomial_gcd.h
+++ b/Polynomial/include/CGAL/Polynomial/polynomial_gcd.h
@@ -211,9 +211,10 @@ Polynomial<NT> gcd_(
     // see [Cohen, 1993], algorithm 3.3.1
 
     // handle trivial cases
-    if (p1.is_zero())
+    if (p1.is_zero()){
         if (p2.is_zero()) return Polynomial<NT>(NT(1));
         else return p2 / p2.unit_part();
+    }
     if (p2.is_zero())
         return p1 / p1.unit_part();
     if (p2.degree() > p1.degree()) {
@@ -291,9 +292,10 @@ Polynomial<NT> gcd_(
     Polynomial<NT> p1, Polynomial<NT> p2, Field_tag
 ) {
     // handle trivial cases
-    if (p1.is_zero())
+    if (p1.is_zero()){
         if (p2.is_zero()) return Polynomial<NT>(NT(1));
         else return p2 / p2.unit_part();
+    }
     if (p2.is_zero())
         return p1 / p1.unit_part();
     if (p2.degree() > p1.degree()) {
@@ -350,7 +352,7 @@ Polynomial<NT> gcd(const Polynomial<NT>& p1, const Polynomial<NT>& p2)
 namespace POLYNOMIAL {
 
 template <class NT> inline
-NT gcd_utcf_(const NT& a, const NT& b)
+NT gcd_utcf_(const NT&, const NT&)
 { return NT(1); }
 
 template <class NT> inline
@@ -427,7 +429,7 @@ Polynomial<NT> gcd_utcf_(
 ) {
     
     // handle trivial cases
-    if (p1.is_zero())
+    if (p1.is_zero()){
         if (p2.is_zero()){
             return Polynomial<NT>(NT(1));
         }else{
@@ -437,6 +439,7 @@ Polynomial<NT> gcd_utcf_(
             return canonicalize_polynomial(p2);
 #endif
         }
+    }
     if (p2.is_zero()){
 #if NiX_POLYNOMIAL_GCD_AVOID_CANONICALIZE
         return p1;
diff --git a/Polynomial/include/CGAL/Polynomial/polynomial_utils.h b/Polynomial/include/CGAL/Polynomial/polynomial_utils.h
index 4877682887f..6a74dedf23b 100644
--- a/Polynomial/include/CGAL/Polynomial/polynomial_utils.h
+++ b/Polynomial/include/CGAL/Polynomial/polynomial_utils.h
@@ -162,7 +162,7 @@ namespace POLYNOMIAL {
     // Polynomial<NT> / NT  -  NT is already the coefficient type and is extended
     template <class NT>
     Polynomial<NT> div_utcf_NT_is_IC(
-        Polynomial<NT> f, const NT& g, CGAL::Tag_false)
+        Polynomial<NT> f, const NT&, CGAL::Tag_false)
     {
         return canonicalize_polynomial(f);
     }
diff --git a/Polynomial/include/CGAL/Polynomial_traits_d.h b/Polynomial/include/CGAL/Polynomial_traits_d.h
index 2313d232066..77c7fe59966 100644
--- a/Polynomial/include/CGAL/Polynomial_traits_d.h
+++ b/Polynomial/include/CGAL/Polynomial_traits_d.h
@@ -260,11 +260,11 @@ class Polynomial_traits_d_base {
     
     struct Degree 
         : public Unary_function< ICoeff , int > {
-        int operator()(const ICoeff& c) const { return 0; }
+        int operator()(const ICoeff&) const { return 0; }
     };
     struct Total_degree 
         : public Unary_function< ICoeff , int > {
-        int operator()(const ICoeff& c) const { return 0; }
+        int operator()(const ICoeff&) const { return 0; }
     };
     
     typedef Null_functor  Construct_polynomial;
@@ -331,7 +331,7 @@ class Polynomial_traits_d_base {
         typedef Coefficient             argument_type;
         
         // returns the exponent vector of inner_most_lcoeff. 
-        result_type operator()(const Coefficient& constant){
+        result_type operator()(const Coefficient&){
             return Exponent_vector();
         }
     };
@@ -1093,9 +1093,9 @@ public:
         // rsqff_utcf computes the sqff recursively for Coeff  
         // end of recursion: ICoeff
         template < class OutputIterator1, class OutputIterator2 >
-        int rsqff_utcf  (ICoeff c, 
-                OutputIterator1 factors, 
-                OutputIterator2 mults) const{
+        int rsqff_utcf  (ICoeff , 
+                OutputIterator1 , 
+                OutputIterator2 ) const{
             return 0;
         }        
         template < class OutputIterator1, class OutputIterator2 >