Klaus Jansen
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Integer Programming and Convolution, with Applications | Lattices: Geometry, Algorithms and Hardness 2020 | 2020-02-18 |
Provides an algorithm for integer programs Ax=b, x≥0 with m constraints and coefficients ≤Δ that replaces the dependence on the right-hand side B by log B, and… | ||
| Lower Bounds on the Running Time for Scheduling and Packing Problems | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
ETH-based reductions give concrete running-time barriers: a linear reduction from 3-SAT to Subset Sum produces 8m items and rules out 2^{o(n)} algorithms under… | ||
| nothing matches | ||