Jean-Paul Doignon

According to our database1, Jean-Paul Doignon authored at least 28 papers between 1981 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Finding a Maximum-Weight Convex Set in a Chordal Graph.
J. Graph Algorithms Appl., 2019

2018
Any Finite Group is the Group of Some Binary, Convex Polytope.
Discret. Comput. Geom., 2018

2016
On the shelling antimatroids of split graphs.
Electron. Notes Discret. Math., 2016

The Linear Extension Polytope of a Poset.
Electron. Notes Discret. Math., 2016

A Convex Polytope and an Antimatroid for any Given, Finite Group.
Electron. Notes Discret. Math., 2016

2014
Learning Spaces, and How to Build Them.
Proceedings of the Formal Concept Analysis - 12th International Conference, 2014

Facets of order polytopes.
Proceedings of the International Conference on Control, 2014

2013
The Representation Polyhedron of a Semiorder.
Order, 2013

Learning Spaces: A Mathematical Compendium.
Proceedings of the Knowledge Spaces, Applications in Education, 2013

2009
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes.
Discret. Optim., 2009

2008
Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships.
Networks, 2008

2007
The Polytope of <i>m</i>-Subspaces of a Finite Affine Space.
RAIRO Oper. Res., 2007

2006
The Assessment of Knowledge, in Theory and in Practice.
Proceedings of the Formal Concept Analysis, 4th International Conference, 2006

2005
On a weighted generalization of alpha-critical graphs.
Electron. Notes Discret. Math., 2005

Ordinal and symbolic data analysis.
Discret. Appl. Math., 2005

2004
The Biorder Polytope.
Order, 2004

The facets and the symmetries of the approval-voting polytope.
J. Comb. Theory, Ser. B, 2004

2001
Facets of the Weak Order Polytope Derived from the Induced Partition Projection.
SIAM J. Discret. Math., 2001

Almost Connected Orders.
Order, 2001

2000
Dimension of valued relations.
Eur. J. Oper. Res., 2000

1999
Dimensions of chains of relations.
Electron. Notes Discret. Math., 1999

1998
Knowledge spaces.
Springer, ISBN: 978-3-540-64501-6, 1998

1997
Well-graded families of relations.
Discret. Math., 1997

1994
A Polynomial Time Algorithm for Unidimensional Unfolding Representations.
J. Algorithms, 1994

1988
Parametrization of knowledge structures.
Discret. Appl. Math., 1988

1985
Spaces for the Assessment of Knowledge.
Int. J. Man Mach. Stud., 1985

1981
Minimum Numbers of Circuits in Affine Sets.
Eur. J. Comb., 1981

On characterizations of binary and graphic matroids.
Discret. Math., 1981


  Loading...