This paper is primarily about NP-completeness of $(k,i)$-coloring of graph and giving a parameterized algorithm for this problem using feedback vertex set as the parameter.
To celebrate the first 25 years of the International Conference on Principles and Practice of Constraint Programming (CP) the editors invited the authors of the most cited paper of each year to write a commentary on their paper. This report describes …
This paper presents a couple of incomplete Weighted MaxSAT solving techniques that allowed _Open-WBO-Inc_ to win accolades in MaxSAT evaluations 2018 and MaxSAT evaluations 2019.