- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c6 |      | Yijia Chen, Kord Eickmeyer, Jörg Flum: The Exponential Time Hypothesis and the Parameterized Clique Problem. IPEC 2012: 13-24 |
| c5 | | Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin: Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques. SAGT 2012: 96-107 |
| i2 | | Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin: Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques. Electronic Colloquium on Computational Complexity (ECCC) 19: 25 (2012) |
| 2011 | ||
| b1 | | |
| j2 | | Kord Eickmeyer, Martin Grohe: Randomisation and Derandomisation in Descriptive Complexity Theory. Logical Methods in Computer Science 7(3) (2011) |
| c4 | | |
| 2010 | ||
| c3 | | Kord Eickmeyer, Martin Grohe: Randomisation and Derandomisation in Descriptive Complexity Theory. CSL 2010: 275-289 |
| i1 | | Kord Eickmeyer, Martin Grohe: Randomisation and Derandomisation in Descriptive Complexity Theory. Electronic Colloquium on Computational Complexity (ECCC) 17: 56 (2010) |
| 2008 | ||
| j1 | | Kord Eickmeyer, Peter Huggins, Lior Pachter, Ruriko Yoshida: On the optimality of the neighbor-joining algorithm. Algorithms for Molecular Biology 3 (2008) |
| c2 | | Kord Eickmeyer, Ruriko Yoshida: The Geometry of the Neighbor-Joining Algorithm for Small Trees. AB 2008: 81-95 |
| c1 | | Kord Eickmeyer, Martin Grohe, Magdalena Grüber: Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. IEEE Conference on Computational Complexity 2008: 8-18 |
| 1 | Yijia Chen | |
| 2 | Jörg Flum | |
| 3 | Martin Grohe | |
| 4 | Magdalena Grüber | |
| 5 | Kristoffer Arnsfelt Hansen | |
| 6 | Peter Huggins | |
| 7 | Lior Pachter | |
| 8 | Elad Verbin | |
| 9 | Ruriko Yoshida |
Colors in the list of coauthors
Last update Wed May 22 12:38:34 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page