Jean-Paul Doignon - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2022

On the Ordinal Invariance of Power Indices on Coalitional GamesJean-Paul Doignon, Stefano Moretti, Meltem Öztürk. IJCAI 2022: 258-264 [doi]

2021

Resolutions of Convex GeometriesDomenico Cantone, Jean-Paul Doignon, Alfio Giarlotta, Stephen Watson. combinatorics, 28(4), 2021. [doi]

2019

Finding a Maximum-Weight Convex Set in a Chordal GraphJean Cardinal, Jean-Paul Doignon, Keno Merckx. jgaa, 23(2):167-190, 2019. [doi]

2018

Any Finite Group is the Group of Some Binary, Convex PolytopeJean-Paul Doignon. dcg, 59(2):451-460, 2018. [doi]

2017

On the shelling antimatroids of split graphsJean Cardinal, Jean-Paul Doignon, Keno Merckx. dmtcs, 19(1), 2017. [doi]

2016

A Convex Polytope and an Antimatroid for any Given, Finite GroupJean-Paul Doignon. endm, 54:21-25, 2016. [doi]

The Linear Extension Polytope of a PosetJean-Paul Doignon, Samuel Fiorini, Selim Rexhep. endm, 55:81-84, 2016. [doi]

On the shelling antimatroids of split graphsKeno Merckx, Jean Cardinal, Jean-Paul Doignon. endm, 55:199-202, 2016. [doi]

2014

Learning Spaces, and How to Build ThemJean-Paul Doignon. icfca 2014: 1-14 [doi]

Facets of order polytopesJean-Paul Doignon, Samuel Fiorini, Selim Rexhep. codit 2014: 93-97 [doi]

2013

The Representation Polyhedron of a SemiorderBarry Balof, Jean-Paul Doignon, Samuel Fiorini. order, 30(1):103-135, 2013. [doi]

Learning Spaces: A Mathematical CompendiumJean-Paul Doignon, Jean-Claude Falmagne, Eric Cosyn. In Jean-Claude Falmagne, Dietrich Albert, Christopher Doble, David Eppstein, Xiangen Hu, editors, Knowledge Spaces, Applications in Education. pages 131-145, Springer, 2013. [doi]

2009

Weighted graphs defining facets: A connection between stable set and linear ordering polytopesJean-Paul Doignon, Samuel Fiorini, Gwenaël Joret. disopt, 6(1):1-9, 2009. [doi]

2008

Linear inequalities among graph invariants: Using ::::GraPHedron:::: to uncover optimal relationshipsJulie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé, Sourour Elloumi, Hadrien Mélot, Hande Yaman. networks, 52(4):287-298, 2008. [doi]

2007

m-Subspaces of a Finite Affine SpaceJulie Christophe, Jean-Paul Doignon. rairo, 41(3):317-344, 2007. [doi]

2006

The Assessment of Knowledge, in Theory and in PracticeJean-Claude Falmagne, Eric Cosyn, Jean-Paul Doignon, Nicolas Thiéry. icfca 2006: 61-79 [doi]

2005

Ordinal and symbolic data analysisJean-Paul Doignon, Marc Pirlot. DAM, 147(1):1-2, 2005. [doi]

On a weighted generalization of alpha-critical graphsJean-Paul Doignon, Samuel Fiorini, Gwenaël Joret. endm, 22:401-404, 2005. [doi]

2004

The Biorder PolytopeJulie Christophe, Jean-Paul Doignon, Samuel Fiorini. order, 21(1):61-82, 2004. [doi]

The facets and the symmetries of the approval-voting polytopeJean-Paul Doignon, Samuel Fiorini. JCT, 92(1):1-12, 2004. [doi]

2001

Almost Connected OrdersChristopher Doble, Jean-Paul Doignon, Jean-Claude Falmagne, Peter C. Fishburn. order, 18(4):295-311, 2001. [doi]

Facets of the Weak Order Polytope Derived from the Induced Partition ProjectionJean-Paul Doignon, Samuel Fiorini. siamdm, 15(1):112-121, 2001. [doi]

2000

Dimension of valued relationsJean-Paul Doignon, Jutta Mitas. eor, 125(3):571-587, 2000. [doi]

1999

Dimensions of chains of relationsJean-Paul Doignon. endm, 2:149, 1999. [doi]

1998

Knowledge spacesJean-Paul Doignon, Jean-Claude Falmagne. Springer, 1998.

1997

Well-graded families of relationsJean-Paul Doignon, Jean-Claude Falmagne. DM, 173(1-3):35-44, 1997. [doi]

1994

A Polynomial Time Algorithm for Unidimensional Unfolding RepresentationsJean-Paul Doignon, Jean-Claude Falmagne. jal, 16(2):218-233, 1994.

1988

Parametrization of knowledge structuresJean-Paul Doignon, Jean-Claude Falmagne. DAM, 21(2):87-100, 1988. [doi]

1985

Spaces for the Assessment of KnowledgeJean-Paul Doignon, Jean-Claude Falmagne. ijmms, 23(2):175-196, 1985.

1981

On characterizations of binary and graphic matroidsJean-Paul Doignon. DM, 37(2-3):299-301, 1981. [doi]

Minimum Numbers of Circuits in Affine SetsJean-Paul Doignon. ejc, 2(4):335-338, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL