Kord Eickmeyer

According to our database, Kord Eickmeyer authored at least 18 papers between 2008 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

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, Sebastian Siebertz

ACM Trans. Comput. Log., 2020

2018

Gap-planar graphs.

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

Theor. Comput. Sci., 2018

2017

Succinctness of Order-Invariant Logics on Depth-Bounded Structures.

Kord Eickmeyer, Michael Elberfeld, Frederik Harwath

ACM Trans. Comput. Log., 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, Sebastian Siebertz

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

FO Model Checking on Map Graphs.

Kord Eickmeyer, Ken-ichi Kawarabayashi

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016

Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs.

Kord Eickmeyer, Ken-ichi Kawarabayashi

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2014

Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures.

Kord Eickmeyer, Michael Elberfeld, Frederik Harwath

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree.

Kord Eickmeyer, Ken-ichi Kawarabayashi

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes.

Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

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

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

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

The Exponential Time Hypothesis and the Parameterized Clique Problem.

Yijia Chen, Kord Eickmeyer, Jörg Flum

Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012

2011

Randomness in complexity theory and logics.

Kord Eickmeyer

PhD thesis, 2011

Non-Definability Results for Randomised First-Order Logic.

Kord Eickmeyer

Proceedings of the Computer Science Logic, 2011

2010

Randomisation and Derandomisation in Descriptive Complexity Theory.

Kord Eickmeyer, Martin Grohe

Electron. Colloquium Comput. Complex., 2010

2008

On the optimality of the neighbor-joining algorithm.

Kord Eickmeyer, Peter Huggins, Lior Pachter, Ruriko Yoshida

Algorithms Mol. Biol., 2008

Approximation of Natural W[P]-Complete Minimisation Problems Is Hard.

Kord Eickmeyer, Martin Grohe, Magdalena Grüber

Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

The Geometry of the Neighbor-Joining Algorithm for Small Trees.

Kord Eickmeyer, Ruriko Yoshida

Proceedings of the Algebraic Biology, Third International Conference, 2008