Learning Optimal Decision Trees Using Caching Branch-and-Bound Search. - Gaël Aglin; Siegfried Nijssen; Pierre Schaus (AAAI, 2020)

PyDL8.5: a Library for Learning Optimal Decision Trees. - Gaël Aglin; Siegfried Nijssen; Pierre Schaus (IJCAI, 2020)

Assessing Optimal Forests of Decision Trees. - Gaël Aglin; Siegfried Nijssen; Pierre Schaus (ICTAI, 2021)

Learning Optimal Decision Trees Under Memory Constraints. - Gaël Aglin; Siegfried Nijssen; Pierre Schaus (ECML/PKDD (5), 2022)

Optimal decision trees under constraints. - Gaël Aglin (2022)

An Efficient Structured Perceptron for NP-Hard Combinatorial Optimization Problems. - Bastián Véjar; Gaël Aglin; Ali Irfan Mahmutogullari; Siegfried Nijssen; Pierre Schaus; Tias Guns (CPAIOR (2), 2024)

Efficient Lookahead Decision Trees. - Harold Silvère Kiossou; Pierre Schaus; Siegfried Nijssen; Gaël Aglin (IDA (2), 2024)

Interpretable Quantile Regression by Optimal Decision Trees. - Valentin Lemaire; Gaël Aglin; Siegfried Nijssen (IDA (2), 2024)