Autour de la Conjecture de Dyson. - Laurent Habsieger (Eur. J. Comb., 1989)

Good and Bad Radii of Convex Polygons. - Peter Gritzmann; Laurent Habsieger; Victor Klee (SIAM J. Comput., 1991)

Inégalités entre fonctions symétriques élémentaires: applications à des problèmes de log-concavité. - Laurent Habsieger (Discret. Math., 1993)

More zeros of krawtchouk polynomials. - Laurent Habsieger; Dennis Stanton (Graphs Comb., 1993)

Lower Bounds for q-ary Coverings by Spheres of Radius One. - Laurent Habsieger (J. Comb. Theory A, 1994)

Sur les matrices à signes alternants. - Mireille Bousquet-Mélou; Laurent Habsieger (Discret. Math., 1995)

On-Line Evaluation of Powers Using Euclid's Algorithm. - Srecko Brlek; Pierre Castéran; Laurent Habsieger; Richard Mallette (RAIRO Theor. Informatics Appl., 1995)

Some new lower bounds for ternary covering codes. - Laurent Habsieger (Electron. J. Comb., 1996)

Binary codes with covering radius one: Some new lower bounds. - Laurent Habsieger (Discret. Math., 1997)

On integer Chebyshev polynomials. - Laurent Habsieger; Bruno Salvy (Math. Comput., 1997)

Integral zeroes of Krawtchouk polynomials. - Laurent Habsieger (Codes and Association Schemes, 1999)

New lower bounds for covering codes. - Laurent Habsieger; Alain Plagne (Discret. Math., 2000)

Integer Zeros ofq-Krawtchouk Polynomials in Classical Combinatorics. - Laurent Habsieger (Adv. Appl. Math., 2001)

A Tree-Based Approach for Computing Double-Base Chains. - Christophe Doche; Laurent Habsieger (ACISP, 2008)

A Numerical Note on Upper Bounds for B2[g] Sets. - Laurent Habsieger; Alain Plagne (Exp. Math., 2018)