Michał Pilipczuk
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 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 |
|---|---|---|
| Lower Bounds for Subexponential Parameterized Complexity of Minimum Fill-in and Related Problems | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Shows concrete conditional lower bounds for graph completion problems by tracing reductions from Gap 3SAT through Gap Max Cut and Optimum Linear Arrangement… | ||
| nothing matches | ||