default search action
Jean-Paul Doignon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c4]Jean-Paul Doignon, Stefano Moretti, Meltem Öztürk:
On the Ordinal Invariance of Power Indices on Coalitional Games. IJCAI 2022: 258-264 - 2021
- [j25]Domenico Cantone, Jean-Paul Doignon, Alfio Giarlotta, Stephen Watson:
Resolutions of Convex Geometries. Electron. J. Comb. 28(4) (2021)
2010 – 2019
- 2019
- [j24]Jean Cardinal, Jean-Paul Doignon, Keno Merckx:
Finding a Maximum-Weight Convex Set in a Chordal Graph. J. Graph Algorithms Appl. 23(2): 167-190 (2019) - 2018
- [j23]Jean-Paul Doignon
:
Any Finite Group is the Group of Some Binary, Convex Polytope. Discret. Comput. Geom. 59(2): 451-460 (2018) - [i2]Jean Cardinal, Jean-Paul Doignon, Keno Merckx:
Finding a Maximum-Weight Convex Set in a Chordal Graph. CoRR abs/1806.09992 (2018) - 2017
- [j22]Jean Cardinal, Jean-Paul Doignon, Keno Merckx:
On the shelling antimatroids of split graphs. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - 2016
- [j21]Jean-Paul Doignon:
A Convex Polytope and an Antimatroid for any Given, Finite Group. Electron. Notes Discret. Math. 54: 21-25 (2016) - [j20]Jean-Paul Doignon, Samuel Fiorini, Selim Rexhep:
The Linear Extension Polytope of a Poset. Electron. Notes Discret. Math. 55: 81-84 (2016) - [j19]Keno Merckx, Jean Cardinal, Jean-Paul Doignon:
On the shelling antimatroids of split graphs. Electron. Notes Discret. Math. 55: 199-202 (2016) - 2015
- [i1]Jean Cardinal, Jean-Paul Doignon, Keno Merckx:
On the shelling antimatroids of split graphs. CoRR abs/1512.06073 (2015) - 2014
- [c3]Jean-Paul Doignon, Samuel Fiorini, Selim Rexhep:
Facets of order polytopes. CoDIT 2014: 93-97 - [c2]Jean-Paul Doignon:
Learning Spaces, and How to Build Them. ICFCA 2014: 1-14 - 2013
- [j18]Barry Balof, Jean-Paul Doignon, Samuel Fiorini:
The Representation Polyhedron of a Semiorder. Order 30(1): 103-135 (2013) - [p1]Jean-Paul Doignon, Jean-Claude Falmagne, Eric Cosyn:
Learning Spaces: A Mathematical Compendium. Knowledge Spaces, Applications in Education 2013: 131-145
2000 – 2009
- 2009
- [j17]Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret:
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes. Discret. Optim. 6(1): 1-9 (2009) - 2008
- [j16]Julie Christophe, Sophie Dewez, Jean-Paul Doignon, Gilles Fasbender, Philippe Grégoire, David Huygens, Martine Labbé
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships. Networks 52(4): 287-298 (2008) - 2007
- [j15]Julie Christophe, Jean-Paul Doignon:
The Polytope of m-Subspaces of a Finite Affine Space. RAIRO Oper. Res. 41(3): 317-344 (2007) - 2006
- [c1]Jean-Claude Falmagne, Eric Cosyn, Jean-Paul Doignon, Nicolas Thiéry:
The Assessment of Knowledge, in Theory and in Practice. ICFCA 2006: 61-79 - 2005
- [j14]Jean-Paul Doignon, Marc Pirlot
Ordinal and symbolic data analysis. Discret. Appl. Math. 147(1): 1-2 (2005) - [j13]Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret:
On a weighted generalization of alpha-critical graphs. Electron. Notes Discret. Math. 22: 401-404 (2005) - 2004
- [j12]Jean-Paul Doignon, Samuel Fiorini:
The facets and the symmetries of the approval-voting polytope. J. Comb. Theory B 92(1): 1-12 (2004) - [j11]Julie Christophe, Jean-Paul Doignon, Samuel Fiorini:
The Biorder Polytope. Order 21(1): 61-82 (2004) - 2001
- [j10]Christopher Doble, Jean-Paul Doignon, Jean-Claude Falmagne, Peter C. Fishburn:
Almost Connected Orders. Order 18(4): 295-311 (2001) - [j9]Jean-Paul Doignon, Samuel Fiorini:
Facets of the Weak Order Polytope Derived from the Induced Partition Projection. SIAM J. Discret. Math. 15(1): 112-121 (2001) - 2000
- [j8]Jean-Paul Doignon, Jutta Mitas:
Dimension of valued relations. Eur. J. Oper. Res. 125(3): 571-587 (2000)
1990 – 1999
- 1999
- [j7]Jean-Paul Doignon:
Dimensions of chains of relations. Electron. Notes Discret. Math. 2: 149 (1999) - 1998
- [b1]Jean-Paul Doignon, Jean-Claude Falmagne:
Knowledge spaces. Springer 1998, ISBN 978-3-540-64501-6, pp. I-XV, 1-333 - 1997
- [j6]Jean-Paul Doignon, Jean-Claude Falmagne:
Well-graded families of relations. Discret. Math. 173(1-3): 35-44 (1997) - 1994
- [j5]Jean-Paul Doignon, Jean-Claude Falmagne:
A Polynomial Time Algorithm for Unidimensional Unfolding Representations. J. Algorithms 16(2): 218-233 (1994)
1980 – 1989
- 1988
- [j4]Jean-Paul Doignon, Jean-Claude Falmagne:
Parametrization of knowledge structures. Discret. Appl. Math. 21(2): 87-100 (1988) - 1985
- [j3]Jean-Paul Doignon, Jean-Claude Falmagne:
Spaces for the Assessment of Knowledge. Int. J. Man Mach. Stud. 23(2): 175-196 (1985) - 1981
- [j2]Jean-Paul Doignon:
On characterizations of binary and graphic matroids. Discret. Math. 37(2-3): 299-301 (1981) - [j1]Jean-Paul Doignon:
Minimum Numbers of Circuits in Affine Sets. Eur. J. Comb. 2(4): 335-338 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: