Since 2012, SoCG has given an award for the best presentation(s) by a student. The winner of the award is selected according to scores given by the audience based on their appreciation of the presentation, including its contents, the quality of the slides, and the presentation skills of the presenter. In case of a tie, several winners can be selected.
Ivor Hoog V.D. "Dynamic Smooth Compressed Quadtrees"
Aurélien Ooms "Subquadratic Encodings for Point Configurations"
|About the 2018 award|
|2017||Zuzana Masárová "A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations"|
|2016||Hsien-Chih Chang "Untangling Planar Curves"|
|2015||Luis Barba "A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon"|
|2014||Quirijn Bouts "A Framework for Computing the Greedy Spanner"|
Luis Barba "Bichromatic Compatible Matchings"
João Paixão "Parameterized Complexity of Discrete Morse Theory"
|2012||Adam Sheffer "Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique"|