Justin Dallant

30 papers A* 1A 4B 1Misc 1Journal 19Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
A General Technique for Searching in Implicit Sets via Function Inversion.
Algorithmica
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
2025 J jnl
Adaptive and Scalable Data Structures (Dagstuhl Seminar 25191).
Dagstuhl Reports
Michael A. Bender, John Iacono, László Kozma, Eva Rotenberg, Justin Dallant
2025 J jnl
Conditional Lower Bounds for Dynamic Geometric Measure Problems.
ACM Trans. Algorithms
Justin Dallant, John Iacono
2025 J jnl
Improved Bound on the Number of Pseudoline Arrangements via the Zone Theorem.
CoRR
Justin Dallant
2025 A conf
The Price of Connectivity Augmentation on Planar Graphs.
GD
Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, Torsten Ueckerdt
2025 J jnl
The Price of Connectivity Augmentation on Planar Graphs.
CoRR
Hugo A. Akitaya, Justin Dallant, Erik D. Demaine, Michael Kaufmann, Linda Kleist, Frederick Stock, Csaba D. Tóth, Torsten Ueckerdt
2025 J jnl
Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles.
J. Glob. Optim.
Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara
2024 — conf
A General Technique for Searching in Implicit Sets via Function Inversion.
SOSA
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
2024 A* conf
An Improved Lower Bound on the Number of Pseudoline Arrangements.
SoCG
Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher
2024 J jnl
An Improved Lower Bound on the Number of Pseudoline Arrangements.
CoRR
Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher
2024 A conf
An Optimal Randomized Algorithm for Finding the Saddlepoint.
ESA
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2024 J jnl
An Optimal Randomized Algorithm for Finding the Saddlepoint.
CoRR
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2024 — conf
Finding the saddlepoint faster than sorting.
SOSA
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2024 J jnl
How fast can we play Tetris greedily with rectangular pieces?
Theor. Comput. Sci.
Justin Dallant, John Iacono
2024 J jnl
Improved Lower Bound on the Number of Pseudoline Arrangements.
CoRR
Justin Dallant
2023 J jnl
A General Technique for Searching in Implicit Sets via Function Inversion.
CoRR
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
2023 J jnl
Finding the saddlepoint faster than sorting.
CoRR
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
2023 J jnl
Scalable Data Structures (Dagstuhl Seminar 23211).
Dagstuhl Reports
Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant
2023 B conf
The Rectilinear Convex Hull of Line Segments.
FCT
Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara
2022 A conf
Conditional Lower Bounds for Dynamic Geometric Measure Problems.
ESA
Justin Dallant, John Iacono
2022 J jnl
Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem.
Comput. Geom. Topol.
Justin Dallant, Patrick Schnider
2022 J jnl
How Fast Can We Play Tetris Greedily With Rectangular Pieces?
CoRR
Justin Dallant, John Iacono
2022 Misc conf
How Fast Can We Play Tetris Greedily with Rectangular Pieces?
FUN
Justin Dallant, John Iacono
2021 A conf
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
ESA
Jean Cardinal, Justin Dallant, John Iacono
2021 J jnl
An Instance-optimal Algorithm for Bichromatic Rectangular Visibility.
CoRR
Jean Cardinal, Justin Dallant, John Iacono
2021 — conf
Approximability of (Simultaneous) Class Cover for Boxes.
CCCG
Jean Cardinal, Justin Dallant, John Iacono
2021 J jnl
Approximability of (Simultaneous) Class Cover for Boxes.
CoRR
Jean Cardinal, Justin Dallant, John Iacono
2021 J jnl
Conditional Lower Bounds for Dynamic Geometric Measure Problems.
CoRR
Justin Dallant, John Iacono
2021 — conf
Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem.
CCCG
Justin Dallant, Patrick Schnider
2020 J jnl
Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner (p, q)-theorem.
CoRR
Justin Dallant, Patrick Schnider