Kord Eickmeyer

28 papers A* 2A 2B 7C 1Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2025 C conf
Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words.
DLT
Kord Eickmeyer, Georg Schindling
2025 J jnl
Deciding Sparseness of Regular Languages of Finite Trees and Infinite Words.
CoRR
Kord Eickmeyer, Georg Schindling
2020 J jnl
Model-Checking on Ordered Structures.
ACM Trans. Comput. Log.
Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2018 J jnl
Gap-planar graphs.
Theor. Comput. Sci.
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
2018 J jnl
Model-Checking on Ordered Structures.
CoRR
Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, Patrice Ossona de Mendez, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz
2017 B conf
FO Model Checking on Map Graphs.
FCT
Kord Eickmeyer, Ken-ichi Kawarabayashi
2017 A conf
Gap-Planar Graphs.
GD
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
2017 J jnl
Gap-planar Graphs.
CoRR
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
2017 A* conf
Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs.
ICALP
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2017 J jnl
Succinctness of Order-Invariant Logics on Depth-Bounded Structures.
ACM Trans. Comput. Log.
Kord Eickmeyer, Michael Elberfeld, Frederik Harwath
2016 J jnl
Neighborhood complexity and kernelization for nowhere dense classes of graphs.
CoRR
Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz
2016 B conf
Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs.
CSL
Kord Eickmeyer, Ken-ichi Kawarabayashi
2016 J jnl
Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs.
CoRR
Kord Eickmeyer, Ken-ichi Kawarabayashi
2016 J jnl
Succinctness of Order-Invariant Logics on Depth-Bounded Structures.
CoRR
Kord Eickmeyer, Michael Elberfeld, Frederik Harwath
2014 — conf
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures.
MFCS (1)
Kord Eickmeyer, Michael Elberfeld, Frederik Harwath
2013 B conf
Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree.
SAGT
Kord Eickmeyer, Ken-ichi Kawarabayashi
2013 A* conf
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes.
LICS
Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer
2012 B conf
Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques.
SAGT
Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin
2012 J jnl
Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques.
Electron. Colloquium Comput. Complex.
Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin
2012 B conf
The Exponential Time Hypothesis and the Parameterized Clique Problem.
IPEC
Yijia Chen, Kord Eickmeyer, Jörg Flum
2011 B conf
Non-Definability Results for Randomised First-Order Logic.
CSL
Kord Eickmeyer
2011 J jnl
Randomisation and Derandomisation in Descriptive Complexity Theory
Log. Methods Comput. Sci.
Kord Eickmeyer, Martin Grohe
2011 — —
Randomness in complexity theory and logics.
Kord Eickmeyer
2010 B conf
Randomisation and Derandomisation in Descriptive Complexity Theory.
CSL
Kord Eickmeyer, Martin Grohe
2010 J jnl
Randomisation and Derandomisation in Descriptive Complexity Theory.
Electron. Colloquium Comput. Complex.
Kord Eickmeyer, Martin Grohe
2008 A conf
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard.
CCC
Kord Eickmeyer, Martin Grohe, Magdalena Grüber
2008 J jnl
On the optimality of the neighbor-joining algorithm.
Algorithms Mol. Biol.
Kord Eickmeyer, Peter Huggins, Lior Pachter, Ruriko Yoshida
2008 — conf
The Geometry of the Neighbor-Joining Algorithm for Small Trees.
AB
Kord Eickmeyer, Ruriko Yoshida