One of the most critical problems in the field of string algorithms is t...
We consider the problem of minimizing the total processing time of tardy...
Motivated by baterryless IoT devices, we consider the following scheduli...
A solution of the k shortest paths problem may output paths that are
ide...
We study a variant of the generalized assignment problem ( GAP)
with gro...
We study the fair variant of the classic k-median problem introduced by
...
We revisit a classical scheduling model to incorporate modern trends in ...
We consider the problem of maintaining a maximal independent set (MIS) i...
The first fully dynamic algorithm for maintaining a maximal independent ...
A maximal independent set (MIS) can be maintained in an evolving m-edge
...
In this study we introduce a new technique for symbolic regression that
...