2 papers
cs.DS2026
Exact algorithms for optimal discretization
László Kozma, Junqi Tan
The optimal discretization problem asks, given two disjoint sets of points and in the plane, for a minimal family of horizontal and vertical lines that separate the two set…
cs.DS2025
Faster exponential algorithms for cut problems via geometric data structures
László Kozma, Junqi Tan
For many hard computational problems, simple algorithms that run in time arise, say, from enumerating all subsets of a size- set. Finding (exponentially) fa…