  A vertex in a graph dominates itself and each of its adjacent vertices. The
\emph{$k$-tuple domination problem}, for a fixed positive integer $k$, is to
find a minimum sized vertex subset in a given graph such that every vertex is
dominated by at least $k$ vertices of this set. From the computational point of
view, this problem is NP-hard. It follows from previous works by Bui-Xuan et
al.~(2013) and by Belmonte et al.~(2013) -- in the context of locally checkable
vertex subset problems in graph classes with quickly computable and bounded
min-width -- that the $k$-tuple domination problem is solvable in time
$\mathcal{O}(|V(G)|^{6k+4})$ in the class of circular-arc graphs. In this work,
we develop faster algorithms for $k$-tuple domination in co-biconvex graphs and
in web graphs, which are incomparable subclasses of concave-round graphs and
thus of circular-arc graphs. On the one hand, we present an
$\mathcal{O}(n^2)$-time algorithm for solving it for each $2\leq k\leq |U|+3$,
where $U$ is the set of universal vertices and $n$ the total number of vertices
of the input co-biconvex graph. On the other hand, the study of this problem on
web graphs was already started by Argiroffo et al. (2010) from a polyhedral
point of view only for the cases $k=2$ and $k=d(G)$, where $d(G)$ equals the
degree of each vertex of the input web graph $G$. We complete this study for
web graphs from an algorithmic point of view, by designing a linear-time
algorithm based on the modular arithmetic for integer numbers. The algorithms
presented in this work are mutually independent but both exploit the circular
properties of the augmented adjacency matrices of each studied graph class.
