Radu-Cristian Curticapean
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 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Dichotomies for Counting Subgraphs | The Classification Program of Counting Complexity | 2016-03-28 |
Classifies when counting copies of H in G is fixed-parameter tractable: if the class C has bounded matching size (equivalently bounded vertex-cover) the… | ||
| The Simple, Little and Slow Things Count: On Parameterized Counting Complexity | Counting Complexity and Phase Transitions Boot Camp | 2016-01-26 |
Shows concrete limits: uses the Holant framework with nonplanar matchgates and a new combined signatures trick to reduce #3SAT and parameterized #CSPs to… | ||
| Fine-Grained Counting Complexity II | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Classifies subgraph counting by the pattern class: if maximum matching size is bounded the problem is polynomial, otherwise counting is #W[1]-hard; proves… | ||
| nothing matches | ||