An exact (k,d)-coloring of a graph G is a coloring of its vertices with
...
We study a family of reachability problems under waiting-time restrictio...
Increasingly, critical decisions in public policy, governance, and busin...
Combinatorial optimization problems arise in a wide range of application...
We propose a multi-stage learning approach for pruning the search space ...
A perfect Italian dominating function of a graph G=(V,E) is a function f...
We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009),
...
We propose a simple, powerful, and flexible machine learning framework f...