NP-hard Approximation Problems in Overlapping Clustering. - Jean-Pierre Barthélemy; François Brucker (J. Classif., 2001)

Combinatorial optimization and hierarchical classifications. - Jean-Pierre Barthélemy; François Brucker; Christophe Osswald (4OR, 2004)

From hypertrees to arboreal quasi-ultrametrics. - François Brucker (Discret. Appl. Math., 2005)

Sub-dominant theory in numerical taxonomy. - François Brucker (Discret. Appl. Math., 2006)

Combinatorial optimisation and hierarchical classifications. - Jean-Pierre Barthélemy; François Brucker; Christophe Osswald (Ann. Oper. Res., 2007)

Binary clustering. - Jean-Pierre Barthélemy; François Brucker (Discret. Appl. Math., 2008)

Parsimonious cluster systems. - François Brucker; Alain Gély (Adv. Data Anal. Classif., 2009)

Crown-free Lattices and Their Related Graphs. - François Brucker; Alain Gély (Order, 2011)

Totally Balanced Formal Context Representation. - François Brucker; Pascal Préa (ICFCA, 2015)

Approximate Seriation Problem in Formal Context Analysis. - François Brucker; Pascal Préa (CLA, 2016)

An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension. - Pascal Préa; Mathieu Rouault; François Brucker (Electron. Notes Discret. Math., 2017)

Binary Lattices. - Célia Châtel; François Brucker; Pascal Préa (FCA4AI@IJCAI, 2018)

Totally Balanced Dissimilarities. - François Brucker; Pascal Préa; Célia Châtel (J. Classif., 2020)

Binary set systems and totally balanced hypergraphs. - Célia Châtel; François Brucker; Pascal Préa (Discret. Appl. Math., 2021)

Extending Robinson Spaces: Complexity and Algorithmic Solutions for Non-Symmetric Dissimilarity Spaces. - François Brucker; Pascal Préa; Christopher Thraves Caro (CoRR, 2024)