Homepage of Kord Eickmeyer

I am a lecturer at Technische Universität Darmstadt in the mathematical logic group.

You can reach me by eMail via: eickmeyer ät mathematik.tu-darmstadt.de. Please consider using encryption. My public pgp key can be found here.

Research Interests

finite model theory
graph structure theory
computational complexity, in particular descriptive complexity and parameterised complexity
randomisation and derandomisation

Publications

with Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michał Pilipczuk, Daniel A. Quiroz, Roman Rabinovich and Sebastian Siebertz: Model-Checking on Ordered Structures, in: ACM Transactions on Computational Logic, 21 (2), March 2020.
with Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Luca Grilli, Seok-Hee Hong, Matias Korman, Frabrizio Montecchiani, Ignaz Rutter, and Csaba Tóth: Gap-planar Graphs, in: Theoretical Computer Science, 2018.
with Michael Elberfeld and Frederik Harwath: Succinctness of Order-Invariant Logics on Depth-Bounded Structures, in ACM Transactions on Computational Logic, 18 (4), 2017.
with Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Luca Grilli, Seok-Hee Hong, Matias Korman, Frabrizio Montecchiani, Ignaz Rutter, and Csaba Tóth: Gap-planar Graphs, GD 2017.
with Ken-ichi Kawarabayashi: FO Model Checking on Map Graphs, FCT 2017 (pdf).
with Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michał Pilipczuk, Roman Rabinovich, and Sebastian Siebertz: Neighborhood complexity and kernelization for nowhere dense classes of graphs, ICALP 2017 (arxiv)
with Ken-ichi Kawarabayashi: Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs, CSL 2016 (pdf).
with Michael Elberfeld and Frederik Harwath: Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures, MFCS 2014 (pdf).
with Ken-ichi Kawarabayashi: Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree, SAGT 2013 (pdf).
with Ken-ichi Kawarabayashi and Stephan Kreutzer: Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes, LICS 2013 (pdf).
with Kristoffer Arnsfelt Hansen and Elad Verbin: Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques, ECCC TR12-025, SAGT 2012.
with Yijia Chen and Jörg Flum: The Exponential Time Hypothesis and the Parameterized Clique Problem, IPEC 2012 (pdf).
with Martin Grohe: Randomisation and Derandomisation in Descriptive Complexity Theory, in: Logical Methods in Computer Science, Special Issue Selected Papers of the Conference CSL 2010. (available here).
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. (available here).
with Martin Grohe: Randomisation and Derandomisation in Descriptive Complexity Theory, in: Computer Science Logic, 24th International Workshop, CSL 2010, Springer LNCS 6247. (also ECCC TR10-056).
with Martin Grohe and Magdalena Grüber: Approximation of Natural W[P]-complete Minimisation Problems is Hard, in: Proc. 23rd Annual IEEE Conference on Computational Complexity, June 23-26 2008, College Park, MD (pdf).
with Ruriko Yoshida: The Geometry of the Neighbor-Joining Algorithm for Small Trees, in: Proc. 3rd Int. Conference on Algebraic Biology, 2008, Castle of Hagenberg, Austria. Springer LNCS5147. (available on arXiv)
with Peter Huggins, Lior Pachter and Ruriko Yoshida: On the optimality of the neighbor-joining algorithm, in: Algorithms in Molecular Biology 3 (2008). (available on arXiv)
with Ludger Rüschendorf: A limit theorem for recursively defined processes in L^p, in: Statistics & Decisions 25, 217-235(2007)

Short CV

(A detailed cv is available upon request)

since Oct 2017: lecturer at TU Darmstadt
Apr 13 - Sep 17: 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, supervised by Martin Grohe
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