papers

Publications (17)

cs.DS2026

Improved space-time tradeoff for TSP via extremal set systems

Justin Dallant, László Kozma

cs.DS2026

Quantum Space-Time Tradeoffs for TSP via Extremal Set Systems

Justin Dallant

The paper presents a quantum algorithm for the Traveling Salesman Problem that leverages extremal set systems and quantum minimum finding to achieve improved space–time tradeoffs c…

#quantum computing#traveling salesman problem#space-time tradeoffs#extremal set systems
cs.DS2026

A General Technique for Searching in Implicit Sets via Function Inversion

Boris Aronov, Jean Cardinal, Justin Dallant +1

cs.CG2023

An Instance-optimal Algorithm for Bichromatic Rectangular Visibility

Jean Cardinal, Justin Dallant, John Iacono

cs.DS2026

An optimal deterministic algorithm for finding a strict saddlepoint

Justin Dallant

cs.CG2025

Improved Bound on the Number of Pseudoline Arrangements via the Zone Theorem

Justin Dallant

math.CO2024

An Improved Lower Bound on the Number of Pseudoline Arrangements

Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner +1

cs.DS2023

Finding the saddlepoint faster than sorting

Justin Dallant, Frederik Haagensen, Riko Jacob +2

cs.CC2024

An Optimal Randomized Algorithm for Finding the Saddlepoint

Justin Dallant, Frederik Haagensen, Riko Jacob +2

math.CO2026

Hamilton paths and cycles in flip graphs of (almost-)perfect matchings

Sofia Brenner, Justin Dallant, Linda Kleist +3

cs.CG2022

Conditional Lower Bounds for Dynamic Geometric Measure Problems

Justin Dallant, John Iacono

cs.CG2021

Approximability of (Simultaneous) Class Cover for Boxes

Jean Cardinal, Justin Dallant, John Iacono

cs.CG2024

Improved Lower Bound on the Number of Pseudoline Arrangements

Justin Dallant

cs.CG2025

The Price of Connectivity Augmentation on Planar Graphs

Hugo A. Akitaya, Justin Dallant, Erik D. Demaine +5

cs.CG2022

How Fast Can We Play Tetris Greedily With Rectangular Pieces?

Justin Dallant, John Iacono

cs.CG2021

Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner -theorem

Justin Dallant, Patrick Schnider

cs.DS2026

Optimal chain density, entropy, and space-time tradeoffs for the TSP

Alexandr Andoni, Justin Dallant, László Kozma +1

The paper determines the optimal trade‑off between the size of a set system and its full‑chain density, yielding a near‑optimal constant γ≈3.1819 that governs the space‑time produc…

#traveling salesman problem#extremal combinatorics#set systems#space‑time tradeoff