1. Chalermsook, P., Heydrich, S., Holm, E., Karrenbauer, A., 2014. Nearly tight approximability results for minimum biclique cover and partition, in: Proceedings of the 2014 European Symposium on Algorithms (ESA), pp. 235–246.
2. de Caen, D., Gregory, D.A., Pullman, N.J., 1981. The Boolean rank of zero-one matrices, in: Proceedings of the 3rd Caribbean Conference on Combinatorics and Computing, pp. 169–173.
3. de Caen, D., Gregory, D.A., Pullman, N.J., 1988. The Boolean rank of zero-one matrices II, in: Proc. Fifth Caribbean Conference on Comina-torics and Computing, pp. 120–126.
4. Spanoids – an abstraction of spanning structures, and a barrier for LCCs;Dvir;SIAM Journal on Computing,2020
5. Amortized communication complexity;Feder;SIAM Journal on Computing,1995