| 2026 | MFCS | Lower Bounds for Meta-Reconfiguration. | Kord Eickmeyer, Tatsuya Gima, Michael Lampis, Valia Mitsou, Edouard Nemery, Yota Otachi, Manolis Vasilakis, Daniel Vaz |
| 2025 | DLT | Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words. | Kord Eickmeyer, Georg Schindling |
| 2017 | FCT | FO Model Checking on Map Graphs. | Kord Eickmeyer, Ken-ichi Kawarabayashi |
| 2017 | GD | Gap-Planar Graphs. | Sang Won Bae, Jean-Franois Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tth |
| 2017 | ICALP | Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. | Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz |
| 2016 | CSL | Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. | Kord Eickmeyer, Ken-ichi Kawarabayashi |
| 2014 | MFCS | Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. | Kord Eickmeyer, Michael Elberfeld, Frederik Harwath |
| 2013 | LICS | Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. | Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer |
| 2013 | SAGT | Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree. | Kord Eickmeyer, Ken-ichi Kawarabayashi |
| 2012 | SAGT | 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 |
| 2011 | CSL | Non-Definability Results for Randomised First-Order Logic. | Kord Eickmeyer |
| 2010 | CSL | Randomisation and Derandomisation in Descriptive Complexity Theory. | Kord Eickmeyer, Martin Grohe |