3 papers
cs.DS2026
Faster algorithms for k-Orthogonal Vectors in low dimension
Anita Dürr, Evangelos Kipouridis, Michael Lampis +1
In the Orthogonal Vectors problem (OV), we are given two families of subsets of , each of size , and the task is to decide whether there exists a pair $a…
cs.DS2025
Beating Meet-in-the-Middle for Subset Balancing Problems
Tim Randolph, Karol WÄgrzycki
We consider exact algorithms for Subset Balancing, a family of related problems that generalizes Subset Sum, Partition, and Equal Subset Sum. Specifically, given as input an intege…
cs.CG2025
On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
Sujoy Bhore, Baris Can Esmer, Daniel Marx +1
We study the Steiner Tree problem on the intersection graph of most natural families of geometric objects, e.g., disks, squares, polygons, etc. Given a set of objects in the pl…