diff --git a/mt-kahypar/datastructures/static_hypergraph.cpp b/mt-kahypar/datastructures/static_hypergraph.cpp
index 3c7e8491d..92d87d190 100644
--- a/mt-kahypar/datastructures/static_hypergraph.cpp
+++ b/mt-kahypar/datastructures/static_hypergraph.cpp
@@ -375,7 +375,7 @@ namespace mt_kahypar::ds {
     // Compute number of hyperedges in coarse graph (those flagged as valid)
     parallel::TBBPrefixSum<size_t, Array> he_mapping(valid_hyperedges);
     tbb::parallel_invoke([&] {
-      tbb::parallel_scan(tbb::blocked_range<size_t>(0UL, UI64(_num_hyperedges)), he_mapping);
+      tbb::parallel_scan(tbb::blocked_range<size_t>(size_t(0), size_t(_num_hyperedges)), he_mapping);
     }, [&] {
       hypergraph._hypernodes.resize(num_hypernodes);
     });
@@ -395,7 +395,7 @@ namespace mt_kahypar::ds {
       // Compute start position of each hyperedge in incidence array
       parallel::TBBPrefixSum<size_t, Array> num_pins_prefix_sum(he_sizes);
       tbb::parallel_invoke([&] {
-        tbb::parallel_for(ID(0), _num_hyperedges, [&](const HyperedgeID& id) {
+        tbb::parallel_for(size_t(0), size_t(_num_hyperedges), [&](const HyperedgeID& id) {
           if ( he_mapping.value(id) ) {
             he_sizes[id] = tmp_hyperedges[id].size();
           } else {
diff --git a/mt-kahypar/partition/refinement/deterministic/deterministic_label_propagation.cpp b/mt-kahypar/partition/refinement/deterministic/deterministic_label_propagation.cpp
index 408d888b7..5dd73763f 100644
--- a/mt-kahypar/partition/refinement/deterministic/deterministic_label_propagation.cpp
+++ b/mt-kahypar/partition/refinement/deterministic/deterministic_label_propagation.cpp
@@ -325,7 +325,7 @@ namespace mt_kahypar {
 
     // swap_prefix[index(p1,p2)] stores the first position of moves to revert out of the sequence of moves from p1 to p2
     vec<size_t> swap_prefix(max_key, 0);
-    tbb::parallel_for(0UL, relevant_block_pairs.size(), [&](size_t bp_index) {
+    tbb::parallel_for(size_t(0), relevant_block_pairs.size(), [&](size_t bp_index) {
       // sort both directions by gain (alternative: gain / weight?)
       auto sort_by_gain_and_prefix_sum_node_weights = [&](PartitionID p1, PartitionID p2) {
         size_t begin = positions[index(p1, p2)], end = positions[index(p1, p2) + 1];
@@ -405,9 +405,9 @@ namespace mt_kahypar {
   {
     auto balance = [&](size_t p1_ind, size_t p2_ind) {
       assert(p1_ind == p1_invalid || p1_ind < p1_end);
-      assert(p1_ind >= p1_invalid || p1_invalid == (0UL - 1));
+      assert(p1_ind >= p1_invalid || p1_invalid == (size_t(0) - 1));
       assert(p2_ind == p2_invalid || p2_ind < p2_end);
-      assert(p2_ind >= p2_invalid || p2_invalid == (0UL - 1));
+      assert(p2_ind >= p2_invalid || p2_invalid == (size_t(0) - 1));
       assert(p1_ind == p1_invalid || p1_ind < cumulative_node_weights.size());
       assert(p2_ind == p2_invalid || p2_ind < cumulative_node_weights.size());
       const auto a = (p1_ind == p1_invalid) ? 0 : cumulative_node_weights[p1_ind];
@@ -596,7 +596,7 @@ namespace mt_kahypar {
 #endif
 
     // remove markers again
-    tbb::parallel_for(0UL, num_moves, [&](size_t pos) { move_pos_of_node[moves[pos].node] = invalid_move_id; });
+    tbb::parallel_for(size_t(0), num_moves, [&](size_t pos) { move_pos_of_node[moves[pos].node] = invalid_move_id; });
 
     // calculate number of overloaded blocks
     size_t num_overloaded_blocks_before_pass = 0, num_overloaded_blocks = 0;