Kord Eickmeyer

Available identifiers

Publication	Date of Publication	Type
Model-checking on ordered structures	2020-09-11	Paper
Neighborhood complexity and kernelization for nowhere dense classes of graphs	2020-05-27	Paper
Gap-Planar Graphs	2019-02-20	Paper
Gap-planar graphs	2018-09-24	Paper
Succinctness of Order-Invariant Logics on Depth-Bounded Structures	2018-03-22	Paper
FO model checking on map graphs	2017-11-22	Paper
Successor-invariant first-order logic on graphs with excluded topological subgraphs	2017-07-19	Paper
Model checking for successor-invariant first-order logic on minor-closed graph classes	2017-07-03	Paper
Expressivity and succinctness of order-invariant logics on depth-bounded structures	2014-10-14	Paper
Approximating multi commodity network design on graphs of bounded pathwidth and bounded degree	2013-10-23	Paper
Approximating the minmax value of three-player games within a constant is as hard as detecting planted cliques	2013-03-13	Paper
The exponential time hypothesis and the parameterized clique problem	2013-01-07	Paper
Non-definability results for randomised first-order logic	2012-09-18	Paper
Randomisation and derandomisation in descriptive complexity theory	2012-04-02	Paper
Randomisation and derandomisation in descriptive complexity theory	2010-09-03	Paper
The Geometry of the Neighbor-Joining Algorithm for Small Trees	2009-02-03	Paper
A limit theorem for recursively defined processes in Lp	2008-05-05	Paper
Partitioning the Sample Space on Five Taxa for the Neighbor Joining Algorithm	2007-03-02	Paper

This page was built for person: Kord Eickmeyer