Justin Dallant
Scholar

Justin Dallant

Google Scholar ID: 2GvlcXkAAAAJ
Université libre de Bruxelles
AlgorithmsComputational geometrydata structuresfine-grained complexity
Citations & Impact
All-time
Citations
33
 
H-index
4
 
i10-index
0
 
Publications
18
 
Co-authors
0
 
Contact
No contact links provided.
Resume (English only)
Academic Achievements
  • (Preprint) Improved Bound on the Number of Pseudoline Arrangements via the Zone Theorem, 2025.
  • The Price of Connectivity Augmentation on Planar Graphs, GD 2025.
  • An Optimal Randomized Algorithm for Finding the Saddlepoint, ESA 2024.
  • An Improved Lower Bound on the Number of Pseudoline Arrangements, SOCG 2024.
  • A General Technique for Searching in Implicit Sets via Function Inversion, SOSA 2024.
  • Finding the saddlepoint faster than sorting, SOSA 2024.
  • The Rectilinear Convex Hull of Line Segments, FCT 2023.
  • Conditional Lower Bounds for Dynamic Geometric Measure Problems, ESA 2022.
  • How Fast Can We Play Tetris Greedily with Rectangular Pieces?, FUN 2022.
  • Approximability of (Simultaneous) Class Cover for Boxes, CCCG 2021.
  • Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem, CCCG 2021.
  • An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility, ESA 2021.
Co-authors
0 total
Co-authors: 0 (list not available)