SST/EPL Louvain School of Engineering (EPL)
2021
Dissertation
2019
Book chapter
Derval, G., Branders, V., Dupont, P., & Schaus, P. (2019). The Maximum Weighted Submatrix Coverage Problem: A CP Approach. In Louis-Martin Rousseau, Kostas Stergiou (ed.), Integration of Constraint Programming, Artificial Intelligence, and Operations Research : Lecture Notes in Computer Science (16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019, Proceedings, p. p. 258-274). Springer, Cham. https://doi.org/10.1007/978-3-030-19212-9_17
Journal article
Branders, V., Schaus, P., & Dupont, P. (2019). Identifying gene-specific subgroups: an alternative to biclustering. BMC Bioinformatics, 20(625), 13. https://doi.org/10.1186/s12859-019-3289-0 (Original work published 2019)
Conference paper
Branders, V., Derval, G., Schaus, P., & Dupont, P. (2019). Mining a Maximum Weighted Set of Disjoint Submatrices. Discovery Science : Lecture Notes in Computer Science, p. 18-28. https://doi.org/10.1007/978-3-030-33778-0_2
2018
Book chapter
Branders, V., Schaus, P., & Dupont, P. (2018). Combinatorial Optimization Algorithms to Mine a Sub-Matrix of Maximal Sum. In Annalisa Appice, Corrado Loglisci, Giuseppe Manco, Elio Masciari, Zbigniew W. Ras (ed.), New Frontiers in Mining Complex Patterns (6th International Workshop, NFMCP 2017, Held in Conjunction with ECML-PKDD 2017, Macedonia, Sept. 18-22, Revised Selected Papers, p. p. 65-79). Springer International Publishing. https://doi.org/10.1007/978-3-319-78680-3_5
2017
Conference paper
Branders, V., Schaus, P., & Dupont, P. (2017). Mining a sub-matrix of maximal sum. Proceedings of the 6th International Workshop on New Frontiers in Mining Complex Patterns in conjunction with ECML-PKDD 2017. Published. 6th International Workshop on New Frontiers in Mining Complex Patterns in conjunction with ECML-PKDD 2017, Skopje (MK). (Original work published 2017)