A graph is called odd (respectively, even) if every vertex has odd
(resp...
We revisit a classical crossword filling puzzle which already appeared i...
In k-Digraph Coloring we are given a digraph and are asked to partition ...
The average-case complexity of a branch-and-bound algorithms for Minimum...
The maximum independent set problem is known to be NP-hard in the class ...
share