Up a level |
Chandran, S and Issac, D and Karrenbauer, A (2017) On the parameterized complexity of BicliqueCover and partition. In: 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, 24 - 26 August 2016, Aarhus.
Sunil Chandran, L and Issac, D and Lauri, J and van Leeuwen, EJ (2022) Upper bounding rainbow connection number by forest number. In: Discrete Mathematics, 345 (7).