6 citations · 6 across the 4 of their papers we have counts for
4 papers · 1 filter
Near-Linear Time Maximum Clique in Circular Arc Graphs
Dario Moschetti, Adam Polak, Jonas Schmidt
We present a near-linear time algorithm to find a maximum clique in circular arc graphs, the intersection graphs of arcs on the circumference of a circle, answering a 30-year-old o…
A Simple Algorithm for Counting Solutions to Integer Programs
Daniel Dadush, Anita Dürr, Thekla Hamm +2
We consider the problem of counting solutions to integer linear programming problems of the form where $A \in \{-Δ,\ldots,Δ\}^{m \times n…
3SUM Is Really Hard: A Real-to-Integer Reduction
Nick Fischer, Adam Polak, Jonas Schmidt
We show that if the 3SUM problem on integer-valued inputs can be solved in truly subquadratic time, then it can also be solved in truly subquadratic time on real-valued inputs. Thi…
Warm-Starting All-Pairs Shortest Paths with Predictions
Adam Polak, Jonas Schmidt
One of the three key hypotheses of fine-grained complexity asserts that computing All-Pairs Shortest Paths (APSP) requires cubic time, up to subpolynomial factors, in the worst cas…