معرفی
Jean Cardinal is a Professor of Computer Science at the Free University of Brussels (ULB) and co-director of the Algorithms Research Group. His research focuses on theoretical computer science, discrete mathematics, computational geometry, and combinatorial algorithms, with historical contributions to data compression and information theory.
- Education: PhD from ULB (2001) with FNRS fellowship; time spent at the University of Washington.
- Visiting Positions: ETH Zurich, Université Sorbonne Paris Nord.
Research Interests: Computational geometry (algorithms for geometric data), combinatorial algorithms, geometric combinatorics, and algorithmic complexity. His work often bridges theoretical mathematics and practical algorithm design, with applications in optimization and graph theory.
Collaborative Work: Active in organizing workshops like the Annual workshop on geometry and graphs and the Order and geometry workshop. Coauthor of numerous papers with researchers like Raphael Steiner, Boris Aronov, and Stefan Langerman.
Scientific Contributions: Recent papers address polytope shortest paths, rectangulations, Hamiltionian properties in facets, and implicit set search techniques. Key trends include computational complexity analysis, geometric combinatorics, and algorithmic optimization.
- Honors: FNRS fellowship during PhD.
Publications: Available via DBLP, MathSciNet, zbMATH, ArXiv, Google Scholar, and DI-fusion. Notable venues include Combinatorial Theory, SODA, SoCG, and Discrete & Computational Geometry.
