Minimization of Gini impurity via connections with the k-means problem. - Eduardo Sany Laber; Lucas Murtinho (CoRR, 2018)

New results on information theoretic clustering. - Ferdinando Cicalese; Eduardo Sany Laber; Lucas Murtinho (ICML, 2019)

Minimization of Gini Impurity: NP-completeness and Approximation Algorithm via Connections with the k-means Problem. - Eduardo Sany Laber; Lucas Murtinho (LAGOS, 2019)

On the price of explainability for some clustering problems. - Eduardo Sany Laber; Lucas Murtinho (ICML, 2021)

Optimization of Inter-group criteria for clustering with minimum size constraints. - Eduardo Sany Laber; Lucas Murtinho (NeurIPS, 2023)

Nearly tight bounds on the price of explainability for the k-center and the maximum-spacing clustering problems. - Eduardo Sany Laber; Lucas Murtinho (Theor. Comput. Sci., 2023)

Shallow decision trees for explainable k-means clustering. - Eduardo Sany Laber; Lucas Murtinho; Felipe Oliveira (Pattern Recognit., 2023)