diff --git a/Kinetic_data_structures/include/CGAL/Kinetic/Instantaneous_kernel.h b/Kinetic_data_structures/include/CGAL/Kinetic/Instantaneous_kernel.h
index 39cbd17f0f8..0c77a8b7ddd 100644
--- a/Kinetic_data_structures/include/CGAL/Kinetic/Instantaneous_kernel.h
+++ b/Kinetic_data_structures/include/CGAL/Kinetic/Instantaneous_kernel.h
@@ -87,7 +87,7 @@ public:
       time_nt_=t;
       time_= Time(t);
     } else {
-      if (time_is_nt_ && time_nt_ != t || !time_is_nt_) {
+      if ((time_is_nt_ && time_nt_ != t) || !time_is_nt_) {
 	time_is_nt_=true;
 	time_= Time(t);
 	time_nt_=t;
diff --git a/Kinetic_data_structures/src/CGAL/Turkowski_numeric_solver.cpp b/Kinetic_data_structures/src/CGAL/Turkowski_numeric_solver.cpp
index 61e6f0821e9..97767d5e810 100644
--- a/Kinetic_data_structures/src/CGAL/Turkowski_numeric_solver.cpp
+++ b/Kinetic_data_structures/src/CGAL/Turkowski_numeric_solver.cpp
@@ -409,7 +409,7 @@ void Turkowski_polynomial_compute_roots(const double *begin, const double *end,
       double rd[3];
       int numr= FindCubicRoots(begin, rd);
       for (int i=numr-1; i>=0; --i) {
-	if (rd[i] > lb && rd[i] < ub) roots.push_back(rd[i]);
+	if (rd[i] >= lb && rd[i] < ub) roots.push_back(rd[i]);
       }
       std::sort(roots.begin(), roots.end(), std::greater<double>());
       break;
@@ -442,7 +442,7 @@ void Turkowski_polynomial_compute_cleaned_roots(const double *begin, const doubl
       int numr= FindCubicRoots(begin, rd);
       double last=-std::numeric_limits<double>::infinity();
       for (int i=numr-1; i>=0; --i) {
-	if (rd[i]< ub && rd[i] > lb) roots.push_back(rd[i]);
+	if (rd[i]< ub && rd[i] >= lb) roots.push_back(rd[i]);
 	if (rd[i] < lb && rd[i] > last){
 	  last=rd[i];
 	}