Justin Dallant

According to our database, Justin Dallant authored at least 13 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Improved Lower Bound on the Number of Pseudoline Arrangements.

Justin Dallant

CoRR, 2024

An Improved Lower Bound on the Number of Pseudoline Arrangements.

Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher

CoRR, 2024

An Optimal Randomized Algorithm for Finding the Saddlepoint.

Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild

CoRR, 2024

Finding the saddlepoint faster than sorting.

Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

A General Technique for Searching in Implicit Sets via Function Inversion.

Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023

Scalable Data Structures (Dagstuhl Seminar 23211).

Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant

Dagstuhl Reports, 2023

The Rectilinear Convex Hull of Line Segments.

Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem.

Justin Dallant, Patrick Schnider

Comput. Geom. Topol., 2022

How Fast Can We Play Tetris Greedily with Rectangular Pieces?

Justin Dallant, John Iacono

Proceedings of the 11th International Conference on Fun with Algorithms, 2022

Conditional Lower Bounds for Dynamic Geometric Measure Problems.

Justin Dallant, John Iacono

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.

Jean Cardinal, Justin Dallant, John Iacono

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

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

Justin Dallant, Patrick Schnider

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

Approximability of (Simultaneous) Class Cover for Boxes.

Jean Cardinal, Justin Dallant, John Iacono

Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021