Justin Dallant

PhD Student in Computer Science

Algorithms Research Group, Université libre de Bruxelles

About me

I’m currently a PhD student in computer science at ULB under the supervision of Jean Cardinal and John Iacono (funded by the F.N.R.S. with a FRIA grant). I work on questions around fine-grained complexity and optimality for geometric algorithms and data structures.

Interests

Discrete and Computational Geometry
Algorithms
Data Structures
Fine-grained Complexity

Education

PhD in Computer Science, 2024 (ongoing)

Université libre de Bruxelles (ULB)
MSc in Computer Science, 2020

ETH Zürich
MSc in Engineering, 2020

Télecom Paristech

Recent Publications

Jean Cardinal, Justin Dallant, John Iacono (2021). Approximability of (Simultaneous) Class Cover for Boxes. CCCG 2021.

PDF Cite

Justin Dallant, Patrick Schnider (2021). Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem. CCCG 2021.

PDF Cite

Jean Cardinal, Justin Dallant, John Iacono (2021). An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. ESA 2021.

Cite DOI

Recent & Upcoming Talks

ESA 2021: An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility

Afshani, Barbay and Chan (2017) introduced the notion of instance-optimal algorithm in the order-oblivious setting. An algorithm A is …

Sep 8, 2021 Online

CCCG 2021: Approximability of (Simultaneous) Class Cover for Boxes

Bereg et al. (2012) introduced the Boxes Class Cover problem, which has its roots in classification and clustering applications: Given …

Aug 11, 2021 Online

CCCG 2021: Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem

Hadwiger and Debrunner showed that for families of convex sets in R^d with the property that among any p of them some q have a common …

Aug 11, 2021 Online

Teaching

I’m currently a teaching assistant for Programming Languages 2 (INFO-F202) at ULB. Previously I was a teaching assistant for Software Engineering and Project Management (INFO-F307) at ULB and for Algorithms and Data Structures at ETHZ.