Kord Eickmeyer

ORCID

Publication Activity (10 Years)

Years Active: 2008-2020
Publications (10 Years): 12

Top Venues

CoRR

ACM Trans. Comput. Log.

SAGT

LICS

Humboldt University of Berlin (PHD)

Education History

Humboldt University of Berlin

PHD

Publications

Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
Model-Checking on Ordered Structures. ACM Trans. Comput. Log. 21 (2) (2020)
Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
Gap-planar graphs. Theor. Comput. Sci. 745 (2018)
Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
Model-Checking on Ordered Structures. CoRR (2018)
Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
Gap-Planar Graphs. Graph Drawing (2017)
Sang Won Bae, Jean-François Baffier, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
Gap-planar Graphs. CoRR (2017)
Kord Eickmeyer, Michael Elberfeld, Frederik Harwath
Succinctness of Order-Invariant Logics on Depth-Bounded Structures. ACM Trans. Comput. Log. 18 (4) (2017)
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. ICALP (2017)
Kord Eickmeyer, Ken-ichi Kawarabayashi
FO Model Checking on Map Graphs. FCT (2017)
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
Neighborhood complexity and kernelization for nowhere dense classes of graphs. CoRR (2016)
Kord Eickmeyer, Ken-ichi Kawarabayashi
Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. CoRR (2016)
Kord Eickmeyer, Ken-ichi Kawarabayashi
Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. CSL (2016)
Kord Eickmeyer, Michael Elberfeld, Frederik Harwath
Succinctness of Order-Invariant Logics on Depth-Bounded Structures. CoRR (2016)
Kord Eickmeyer, Michael Elberfeld, Frederik Harwath
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. MFCS (1) (2014)
Kord Eickmeyer, Ken-ichi Kawarabayashi
Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree. SAGT (2013)
Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. LICS (2013)
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. Electron. Colloquium Comput. Complex. 19 (2012)
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)
Yijia Chen, Kord Eickmeyer, Jörg Flum
The Exponential Time Hypothesis and the Parameterized Clique Problem. IPEC (2012)
Kord Eickmeyer
Non-Definability Results for Randomised First-Order Logic. CSL (2011)
Kord Eickmeyer, Martin Grohe
Randomisation and Derandomisation in Descriptive Complexity Theory Log. Methods Comput. Sci. 7 (3) (2011)
Kord Eickmeyer, Martin Grohe
Randomisation and Derandomisation in Descriptive Complexity Theory. Electron. Colloquium Comput. Complex. 17 (2010)
Kord Eickmeyer, Martin Grohe
Randomisation and Derandomisation in Descriptive Complexity Theory. CSL (2010)
Kord Eickmeyer, Ruriko Yoshida
The Geometry of the Neighbor-Joining Algorithm for Small Trees. AB (2008)
Kord Eickmeyer, Peter Huggins, Lior Pachter, Ruriko Yoshida
On the optimality of the neighbor-joining algorithm. Algorithms Mol. Biol. 3 (2008)
Kord Eickmeyer, Martin Grohe, Magdalena Grüber
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. Computational Complexity Conference (2008)

Kord Eickmeyer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Kord Eickmeyer