Christian Komusiewicz
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Towards General and Tight Hardness Results for Graph Problems | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Shows specific reductions and constructions that give tight exponential lower bounds: a reduce from vertex cover on subcubic graphs using an alpha-sequence… | ||
| nothing matches | ||