Luca Castelli Aleardi is an Assistant Professor at the Laboratoire d'Informatique (LIX) of École Polytechnique, France, since September 2008. His research focuses on theoretical computer science, computational geometry, and discrete mathematics, particularly on Schnyder woods , graph drawing , and compact data structures for planar and surface-embedded graphs. PhD in Computer Science from École Polytechnique (2006) DEA in Algorithmique from Université Paris 6 (2003) Laurea in Applied Mathematics from University of Milan (2002) Erasmus exchange at Université de Versailles-St. Quentin (1999) His work spans graph encoding , mesh compression , and higher genus triangulations , with applications to data visualization, geometric algorithms, and network analysis. Recent publications in SoCG and GD emphasize practical implementations of theoretical constructs, such as toroidal Schnyder woods and SCARST data structures . He has supervised 15+ research internships (2008–2024) on topics including planar graph drawing and dynamic Laplacian systems . Software tools developed by his team include Jcg (Java library for computational geometry) and SCARST implementations.









