Dániel Marx
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
- Ramamohan Paturionce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| The Square Root Phenomenon in Planar Graphs -- Survey and New Results | Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms | 2015-11-06 |
Dániel Marx, Hungarian Academy of Sciences
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time… | ||
| Recent Advances in FPT and Exact Algorithms for NP-Complete Problems | Fine-Grained Complexity and Algorithm Design Boot Camp 2015 | 2015-08-31 |
Dániel Marx, Hungarian Academy of Sciences
Fine-Grained Complexity and Algorithm Design Boot Camp
http://simons.berkeley.edu/talks/daniel-marx-2015-09-01 | ||
| Parameterized Reductions | Fine-Grained Complexity and Algorithm Design Boot Camp 2015 | 2015-08-31 |
Dániel Marx, Hungarian Academy of Sciences
Fine-Grained Complexity and Algorithm Design Boot Camp
http://simons.berkeley.edu/talks/daniel-marx-2015-09-02 | ||
| Consequences of ETH: Tight Bounds for Various Problems | Fine-Grained Complexity and Algorithm Design Boot Camp 2015 | 2015-08-31 |
Dániel Marx, Hungarian Academy of Sciences
Fine-Grained Complexity and Algorithm Design Boot Camp
http://simons.berkeley.edu/talks/daniel-marx-2015-09-03 | ||
| Consequences of SETH: Tight Bounds for Some More Problems | Fine-Grained Complexity and Algorithm Design Boot Camp 2015 | 2015-08-31 |
Dániel Marx, Hungarian Academy of Sciences
Fine-Grained Complexity and Algorithm Design Boot Camp
http://simons.berkeley.edu/talks/daniel-marx-2015-09-04 | ||
| nothing matches | ||