research
∙
03/06/2023
Odd Chromatic Number of Graph Classes
A graph is called odd (respectively, even) if every vertex has odd (resp...
share
research
∙
09/23/2021
Filling Crosswords is Very Hard
We revisit a classical crossword filling puzzle which already appeared i...
research
∙
10/13/2020
Digraph Coloring and Distance to Acyclicity
In k-Digraph Coloring we are given a digraph and are asked to partition ...
research
∙
02/05/2019
Average-case complexity of a branch-and-bound algorithm for min dominating set
The average-case complexity of a branch-and-bound algorithms for Minimum...
research
∙
10/25/2018
