On characterizations of binary and graphic matroids. - Jean-Paul Doignon (Discret. Math., 1981)

Minimum Numbers of Circuits in Affine Sets. - Jean-Paul Doignon (Eur. J. Comb., 1981)

Spaces for the Assessment of Knowledge. - Jean-Paul Doignon; Jean-Claude Falmagne (Int. J. Man Mach. Stud., 1985)

Parametrization of knowledge structures. - Jean-Paul Doignon; Jean-Claude Falmagne (Discret. Appl. Math., 1988)

A Polynomial Time Algorithm for Unidimensional Unfolding Representations. - Jean-Paul Doignon; Jean-Claude Falmagne (J. Algorithms, 1994)

Well-graded families of relations. - Jean-Paul Doignon; Jean-Claude Falmagne (Discret. Math., 1997)

Knowledge spaces. - Jean-Paul Doignon; Jean-Claude Falmagne (Springer, 1998)

Dimensions of chains of relations. - Jean-Paul Doignon (Electron. Notes Discret. Math., 1999)

Dimension of valued relations. - Jean-Paul Doignon; Jutta Mitas (Eur. J. Oper. Res., 2000)

Almost Connected Orders. - Christopher Doble; Jean-Paul Doignon; Jean-Claude Falmagne; Peter C. Fishburn (Order, 2001)

Facets of the Weak Order Polytope Derived from the Induced Partition Projection. - Jean-Paul Doignon; Samuel Fiorini (SIAM J. Discret. Math., 2001)

The facets and the symmetries of the approval-voting polytope. - Jean-Paul Doignon; Samuel Fiorini (J. Comb. Theory B, 2004)

The Biorder Polytope. - Julie Christophe; Jean-Paul Doignon; Samuel Fiorini (Order, 2004)

Ordinal and symbolic data analysis. - Jean-Paul Doignon; Marc Pirlot (Discret. Appl. Math., 2005)

On a weighted generalization of alpha-critical graphs. - Jean-Paul Doignon; Samuel Fiorini; Gwenaël Joret (Electron. Notes Discret. Math., 2005)

The Assessment of Knowledge, in Theory and in Practice. - Jean-Claude Falmagne; Eric Cosyn; Jean-Paul Doignon; Nicolas Thiéry 001 (ICFCA, 2006)

The Polytope of m-Subspaces of a Finite Affine Space. - Julie Christophe; Jean-Paul Doignon (RAIRO Oper. Res., 2007)

Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. - Julie Christophe; Sophie Dewez; Jean-Paul Doignon; Gilles Fasbender; Philippe Grégoire; David Huygens; Martine Labbé; Sourour Elloumi; Hadrien Mélot; Hande Yaman (Networks, 2008)

Weighted graphs defining facets: A connection between stable set and linear ordering polytopes. - Jean-Paul Doignon; Samuel Fiorini; Gwenaël Joret (Discret. Optim., 2009)

Learning Spaces: A Mathematical Compendium. - Jean-Paul Doignon; Jean-Claude Falmagne; Eric Cosyn (Knowledge Spaces, Applications in Education, 2013)

The Representation Polyhedron of a Semiorder. - Barry Balof; Jean-Paul Doignon; Samuel Fiorini (Order, 2013)

Facets of order polytopes. - Jean-Paul Doignon; Samuel Fiorini; Selim Rexhep (CoDIT, 2014)

Learning Spaces, and How to Build Them. - Jean-Paul Doignon (ICFCA, 2014)

A Convex Polytope and an Antimatroid for any Given, Finite Group. - Jean-Paul Doignon (Electron. Notes Discret. Math., 2016)

The Linear Extension Polytope of a Poset. - Jean-Paul Doignon; Samuel Fiorini; Selim Rexhep (Electron. Notes Discret. Math., 2016)

On the shelling antimatroids of split graphs. - Keno Merckx; Jean Cardinal; Jean-Paul Doignon (Electron. Notes Discret. Math., 2016)

Any Finite Group is the Group of Some Binary, Convex Polytope. - Jean-Paul Doignon (Discret. Comput. Geom., 2018)

Finding a Maximum-Weight Convex Set in a Chordal Graph. - Jean Cardinal; Jean-Paul Doignon; Keno Merckx (J. Graph Algorithms Appl., 2019)

Resolutions of Convex Geometries. - Domenico Cantone; Jean-Paul Doignon; Alfio Giarlotta; Stephen Watson (Electron. J. Comb., 2021)

On the Ordinal Invariance of Power Indices on Coalitional Games. - Jean-Paul Doignon; Stefano Moretti 001; Meltem Öztürk (IJCAI, 2022)