The Geometry of the Neighbor-Joining Algorithm for Small Trees. - Kord Eickmeyer; Ruriko Yoshida (AB, 2008)

Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. - Kord Eickmeyer; Martin Grohe; Magdalena Grüber (CCC, 2008)

On the optimality of the neighbor-joining algorithm. - Kord Eickmeyer; Peter Huggins; Lior Pachter; Ruriko Yoshida (Algorithms Mol. Biol., 2008)

Randomisation and Derandomisation in Descriptive Complexity Theory. - Kord Eickmeyer; Martin Grohe (Electron. Colloquium Comput. Complex., 2010)

Non-Definability Results for Randomised First-Order Logic. - Kord Eickmeyer (CSL, 2011)

Randomness in complexity theory and logics. - Kord Eickmeyer (2011)

The Exponential Time Hypothesis and the Parameterized Clique Problem. - Yijia Chen 001; Kord Eickmeyer; Jörg Flum (IPEC, 2012)

Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques. - Kord Eickmeyer; Kristoffer Arnsfelt Hansen; Elad Verbin (SAGT, 2012)

Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques. - Kord Eickmeyer; Kristoffer Arnsfelt Hansen; Elad Verbin (Electron. Colloquium Comput. Complex., 2012)

Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. - Kord Eickmeyer; Ken-ichi Kawarabayashi; Stephan Kreutzer (LICS, 2013)

Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree. - Kord Eickmeyer; Ken-ichi Kawarabayashi (SAGT, 2013)

Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. - Kord Eickmeyer; Michael Elberfeld; Frederik Harwath (MFCS (1), 2014)

Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. - Kord Eickmeyer; Ken-ichi Kawarabayashi (CSL, 2016)

FO Model Checking on Map Graphs. - Kord Eickmeyer; Ken-ichi Kawarabayashi (FCT, 2017)

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. - Kord Eickmeyer; Archontia C. Giannopoulou; Stephan Kreutzer; O-joung Kwon; Michal Pilipczuk; Roman Rabinovich 001; Sebastian Siebertz (ICALP, 2017)

Succinctness of Order-Invariant Logics on Depth-Bounded Structures. - Kord Eickmeyer; Michael Elberfeld; Frederik Harwath (ACM Trans. Comput. Log., 2017)

Gap-planar graphs. - Sang Won Bae 001; Jean-François Baffier; Jinhee Chun; Peter Eades; Kord Eickmeyer; Luca Grilli 001; Seok-Hee Hong 001; Matias Korman; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (Theor. Comput. Sci., 2018)

Model-Checking on Ordered Structures. - Kord Eickmeyer; Jan van den Heuvel; Ken-ichi Kawarabayashi; Stephan Kreutzer; Patrice Ossona de Mendez; Michal Pilipczuk; Daniel A. Quiroz; Roman Rabinovich 001; Sebastian Siebertz (ACM Trans. Comput. Log., 2020)

Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words. - Kord Eickmeyer; Georg Schindling (CoRR, 2025)