1. Mutual exclusion scheduling;B S Baker;Theoretical Computer Science,1996
2. Structural parameterizations of budgeted graph coloring;S Bandopadhyay;WALCOM: Algorithms and Computation,2022
3. Kernelization lower bounds by crosscomposition;H L Bodlaender;SIAM Journal on Discrete Mathematics,2014
4. On the complexity of scheduling incompatible jobs with unit-times;H L Bodlaender;International Symposium on Mathematical Foundations of Computer Science,1993
5. A fast branching algorithm for cluster vertex deletion;A Boral;Theory of Computing Systems,2016