Jean Cardinal

Jean Cardinal is a full professor of computer science at the Free University of Brussels (ULB), where he co-directs the Algorithms Research Group. His work bridges theoretical computer science and discrete mathematics.

Education

• PhD in Computer Science, Université libre de Bruxelles (ULB), 2001
• FNRS Fellowship during PhD studies
• Visiting professorships at ETH Zurich and Université Sorbonne Paris Nord

His research focuses on computational geometry, combinatorial algorithms, and geometric combinatorics, with applications to data compression and information theory. Recent work explores algorithm design for geometric data, polytopes, and graph associahedra.

The 15 most recent articles span topics in computational geometry, algorithmic complexity, and discrete structures, including publications in Combinatorial Theory, SODA, European Journal of Combinatorics, and Mathematical Programming. Key themes: polytopes, rectangulations, degeneracy testing, and dynamic graph algorithms.

Jean actively participates in collaborative research and organizes workshops like the Annual workshop on geometry and graphs and Gremo's workshop on open problems. His publications are accessible via DBLP, ArXiv, and the ULB repository DI-fusion.