About NII

Kord Eickmeyer

I am a postdoctoral researcher at Technische Universität Darmstadt in the group of Martin Otto. Before that I spent 18 months as a PostDoc with Ken-ichi Kawarabayashi at the National Institute of Informatics in Tokyo. I obtained my Ph.D. from Humboldt-Universität zu Berlin in 2011, supervised by Martin Grohe.

You can reach my by eMail via: eickmeyer[at]mathematik.tu-darmstadt.de

Research Interests

  • Computational Complexity, in particular descriptive complexity and parameterised complexity
  • Randomisation and Derandomisation


  • Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree, with Ken-ichi Kawarabayashi, SAGT 2013.
  • Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes, with Ken-ichi Kawarabayashi and Stephan Kreutzer, LICS 2013 (pdf).
  • Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques,with Kristoffer Arnsfelt Hansen and Elad Verbin, ECCCTR12-025, SAGT 2012.
  • The Exponential Time Hypothesis and the Parameterized Clique Problem, with Yijia Chen and Jörg Flum, IPEC 2012 (pdf).
  • Randomisation and Derandomisation in Descriptive Complexity Theory, with Martin Grohe, in: Logical Methods in Computer Science, Special IssueSelected Papers of the Conference CSL 2010(availablehere).
  • Non-Definability Results for Randomised First-Order Logic, in: Computer Science Logic, 25th International Workshop, CSL 2011, Leibniz International Proceedings in Informatics (LIPIcs), vol. 12. (availablehere).
  • Randomisation and Derandomisation in Descriptive Complexity Theory, with Martin Grohe, in: Computer Science Logic, 24th International Workshop, CSL 2010, Springer LNCS 6247 (also as reportTR10-056at ECCC.).
  • Approximation of Natural W[P]-complete Minimisation Problems is Hard, with Martin Grohe and Magdalena Grüber, in: Proc. 23rd Annual IEEE Conference on Computational Complexity, June 23-26 2008, College Park, MD (availablehere).
  • The Geometry of the Neighbor-Joining Algorithm for Small Trees, with Ruriko Yoshida, in: Proc. 3rd Int. Conference on Algebraic Biology, 2008, Castle of Hagenberg, Austria. Springer LNCS5147 (available onarXiv)
  • On the optimality of the neighbor-joining algorithm, with Peter Huggins, Lior Pachter and Ruriko Yoshida, in: Algorithms in Molecular Biology 3 (2008). (available onarXiv)
  • A limit theorem for recursively defined processes in L^p, with Ludger Rüschendorf, in: Statistics & Decisions 25, 217-235(2007)

Short CV

(A detailed CV is available upon request)

  • Since April 13: PostDoc at Technische Universität Darmstadt, Germany
  • Oct 11 - Mar 13: PostDoc at the National Institute of Informatics, Tokyo, Japan
  • Mar 07 - Sep 11: PhD-student at Humboldt Universität zu Berlin
  • Jun 06 - Feb 07: Intern at Fujitsu Research, Kawasaki; Computer Algebra Devision
  • Oct 05 - May 06: Japanese language studies at the Tokyo School of the Japanese Language, Tokyo
  • Sep 05: Diplom-Mathematiker (M.Sc. in mathematics-equivalent) from Freiburg University
  • Oct 02 - Jun 03: mathematical tripos part III at University of Cambridge, UK; finished with "Certificate of Advanced Studies in Mathematics"
  • Oct 01 - Sep 05: student of mathematics at Albert Ludwigs-University, Freiburg, Germany
  • Oct 99 - Sep 01: student of computer science at University of Lübeck, Germany