Here are my machine-readable articles. If you want a reprint of any of my other articles, you can contact me at the e-mail address given on my home page. Include your snail-mail address.
INDISCRETE MATHEMATICS, PART 1
(discrete mathematics with humourous illustrations)
INDISCRETE MATHEMATICS, PART 2
INDISCRETE MATHEMATICS, PART 3
INDISCRETE MATHEMATICS, PART 4
Space-efficient generation of nonisomorphic maps and hypermaps
Counting maps on doughnuts
(invited talk)
Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices
(joint with Alain Giorgetti and Alexander Mednykh)
Efficient enumeration of rooted maps of a given orientable genus by number of vertices and faces
(joint with Alain Giorgetti)
Structure and enumeration of two-connected graphs with prescribed three-connected components
(joint with Andrei Gagarin, Gilbert Labelle and Pierre Leroux)
A loopless two-close Gray-code algorithm for listing k-ary Dyck words
(joint with Vincent Vajnovszki)
Counting unrooted maps on the plane
(joint with Valery Liskovets)
A biased survey of map enumeration results
(invited talk)
Efficient enumeration of sensed planar maps
Enumeration of Unrooted Loopless Maps
(joint with Valery Liskovets)
Enumeration of Eulerian and unicursal planar maps
(joint with Valery Liskovets)
Generating Gray codes in O(1) worst-case time per word
(invited talk)
Gray codes for involutions
Loop-free sequencing of bounded integer compositions
Total vertex enumeration in rooted planar maps
(joint with Leonid Koganov and Valery Liskovets)
Trier vite pour chercher vite
(popularization of merge sort in French)
Generation of well-formed parenthesis strings in constant worst-case time
The generalized Towers of Hanoi for space-deficient computers and forgetful humans
Worst-case analysis of Read's chromatic polynomial algorithm
A simple sequencing and ranking method that works on almost all Gray codes
(unpublished research report)