default search action
Bernard Monjardet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j24]Bruno Leclerc, Bernard Monjardet:
Aggregation and Residuation. Order 30(1): 261-268 (2013) - 2010
- [j23]Karell Bertet, Bernard Monjardet:
The multiple facets of the canonical direct unit implicational basis. Theor. Comput. Sci. 411(22-24): 2155-2166 (2010)
2000 – 2009
- 2009
- [p2]Bernard Monjardet:
Acyclic Domains of Linear Orders: A Survey. The Mathematics of Preference, Choice and Order 2009: 139-160 - [p1]Olivier Hudry, Bruno Leclerc, Bernard Monjardet, Jean-Pierre Barthélemy:
Metric and Latticial Medians. Decision-making Process 2009: 811-856 - 2008
- [j22]Bernard Monjardet:
Statement of precedence and a comment on IIA terminology. Games Econ. Behav. 62(2): 736-738 (2008) - 2007
- [j21]Bernard Monjardet:
Some Order dualities in Logic, Games and Choices. IGTR 9(1): 1-12 (2007) - [c1]Bernard Monjardet:
Closure Operators and Choice Operators: a Survey (Abstract). CLA 2007 - 2005
- [j20]Nathalie Caspard, Bernard Monjardet:
Erratum to: The lattice of closure systems, closure operators and implicational systems on a finite set: a survey: [Discrete Applied Mathematics 127(2) (2003) 241-269]. Discret. Appl. Math. 145(3): 333 (2005) - [j19]Bernard Monjardet:
Social choice theory and the "Centre de Mathématique Sociale": some historical notes. Soc. Choice Welf. 25(2-3): 433-456 (2005) - 2004
- [j18]Nathalie Caspard, Bernard Monjardet:
Some lattices of closure systems on a finite set. Discret. Math. Theor. Comput. Sci. 6(2): 163-190 (2004) - [j17]Bernard Monjardet, Vololonirina Raderanirina:
Lattices of choice functions and consensus problems. Soc. Choice Welf. 23(3): 349-382 (2004) - 2003
- [j16]Nathalie Caspard, Bernard Monjardet:
The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey. Discret. Appl. Math. 127(2): 241-269 (2003) - [j15]Bernard Monjardet:
The presence of lattice theory in discrete problems of mathematical social sciences. Why. Math. Soc. Sci. 46(2): 103-144 (2003) - 2001
- [j14]Bernard Monjardet, Vololonirina Raderanirina:
The duality between the anti-exchange closure operators and the path independent choice operators on a finite set. Math. Soc. Sci. 41(2): 131-150 (2001) - 2000
- [j13]Peter C. Fishburn, Bernard Monjardet:
Concordance Graphs. Eur. J. Comb. 21(4): 461-471 (2000) - [j12]Gabriela Hauser Bordalo, Bernard Monjardet:
The lattice of strict completions of a poset. Electron. Notes Discret. Math. 5: 38-41 (2000)
1990 – 1999
- 1999
- [j11]Nathalie Caspard, Bernard Monjardet:
The lattices of Moore families and closure operators on a finite set: A survey. Electron. Notes Discret. Math. 2: 25-50 (1999) - 1998
- [j10]Bernard Monjardet:
On the comparison of the Spearman and Kendall metrics between linear orders. Discret. Math. 192(1-3): 281-292 (1998) - 1997
- [j9]Bernard Monjardet, Nathalie Caspard:
On a dependence relation in finite lattices. Discret. Math. 165-166: 497-505 (1997) - 1993
- [j8]C. Chameni Nembua, Bernard Monjardet:
Finite pseudocomplemented lattices and 'permutoedre'. Discret. Math. 111(1-3): 105-112 (1993) - 1992
- [j7]C. Chameni Nembua, Bernard Monjardet:
Les treillis pseudocomple'mente's finis. Eur. J. Comb. 13(2): 89-107 (1992)
1980 – 1989
- 1989
- [j6]Bernard Monjardet, Rudolf Wille:
On finite lattices generated by their doubly irreducible elements. Discret. Math. 73(1-2): 163-164 (1989) - 1981
- [j5]Bernard Monjardet:
Metrics on partially ordered sets - A survey. Discret. Math. 35(1-3): 173-184 (1981) - [j4]Jean-Pierre Barthélemy, Bernard Monjardet:
The median procedure in cluster analysis and social choice theory. Math. Soc. Sci. 1(3): 235-267 (1981)
1970 – 1979
- 1978
- [j3]Bernard Monjardet:
An Axiomatic Theory of Tournament Aggregation. Math. Oper. Res. 3(4): 334-351 (1978) - 1975
- [j2]Bernard Monjardet:
Éléments ipsoduaux du treillis distributif libre et familles de Sperner ipsotransversales. J. Comb. Theory A 19(2): 160-176 (1975) - 1973
- [j1]Bernard Monjardet:
Hypergraphs and Sperner's theorem. Discret. Math. 5(3): 287-289 (1973)
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:23 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: