Jean Cardinal
Scholar

Jean Cardinal

Google Scholar ID: RGGbPQEAAAAJ
Université libre de Bruxelles (ULB)
AlgorithmsComputational geometry
Citations & Impact
All-time
Citations
956
 
H-index
16
 
i10-index
35
 
Publications
20
 
Co-authors
94
list available
Contact
Resume (English only)
Academic Achievements
  • Papers can be found on DBLP, MathSciNet, zbMATH, ArXiv, Google Scholar, and the local repository DI-fusion. Recent contributions include:
  • - Shortest paths on polymatroids and hypergraphic polytopes
  • - The expansion of half-integral polytopes
  • - Combinatorics of rectangulations: Old and new bijections
  • - Facet-Hamiltonicity
  • - Rectangulotopes
  • - A general technique for searching in implicit sets via function inversion
  • - The rotation distance of brooms
  • - Inapproximability of shortest paths on perfect matching polytopes
  • - Improved Algebraic degeneracy testing
  • - Combinatorial generation via permutation languages. V. Acyclic orientations.
  • - Combinatorial generation via permutation languages. IV. Elimination trees
  • - Competitive online search trees on trees
Research Experience
  • Held visiting professorships at various institutions since 2001, most recently at ETH Zurich and Université Sorbonne Paris Nord. Enjoys collaborative research and met many coauthors at research workshops around the world.
Education
  • Obtained PhD from Université libre de Bruxelles (ULB) in 2001, with a fellowship from FNRS, after spending some time at the University of Washington.
Background
  • Professor of computer science, with research interests in theoretical computer science and discrete mathematics. Particularly interested in computational geometry, combinatorial algorithms, and geometric combinatorics. Earlier works dealt with data compression and problems in information theory.
Miscellany
  • Enjoys participating in research workshops and has given several online talks at various institutions globally.