Marcin 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 |
|---|---|---|
| Subexponential Parameterized Complexity of Completion Problems: Survey of the Upper Bounds | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Survey states that many graph completion problems (split, chordal, proper-interval, several others) admit subexponential FPT algorithms by enumerating a… | ||
| nothing matches | ||