Nathalie Caspard

According to our database, Nathalie Caspard authored at least 11 papers between 1997 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2005

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].

Nathalie Caspard, Bernard Monjardet

Discret. Appl. Math., 2005

2004

Some lattices of closure systems on a finite set.

Nathalie Caspard, Bernard Monjardet

Discret. Math. Theor. Comput. Sci., 2004

Cayley lattices of finite Coxeter groups are bounded.

Nathalie Caspard, Claude Le Conte de Poly-Barbut, Michel Morvan

Adv. Appl. Math., 2004

2003

The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey.

Nathalie Caspard, Bernard Monjardet

Discret. Appl. Math., 2003

2002

Doubling Convex Sets in Lattices: Characterizations and Recognition Algorithms.

Karell Bertet, Nathalie Caspard

Order, 2002

2000

The Lattice of Permutations is Bounded.

Nathalie Caspard

Int. J. Algebra Comput., 2000

Cayley lattices of finite Coxeter groups are bounded.

Nathalie Caspard, Claude Le Conte de Poly-Barbut, Roberto Mantaci, Michel Morvan

Electron. Notes Discret. Math., 2000

1999

A Characterization Theorem for the Canonical Basis of a Closure Operator.

Nathalie Caspard

Order, 1999

The lattices of Moore families and closure operators on a finite set: A survey.

Nathalie Caspard, Bernard Monjardet

Electron. Notes Discret. Math., 1999

A characterization for all interval doubling schemes of the lattice of permutations.

Nathalie Caspard

Discret. Math. Theor. Comput. Sci., 1999

1997

On a dependence relation in finite lattices.

Bernard Monjardet, Nathalie Caspard

Discret. Math., 1997