default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKord Eickmeyer
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j5]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): 11:1-11:28 (2020)
2010 – 2019
- 2018
- [j4]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: 36-52 (2018) - [i7]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 abs/1812.08003 (2018) - 2017
- [j3]Kord Eickmeyer, Michael Elberfeld, Frederik Harwath:
Succinctness of Order-Invariant Logics on Depth-Bounded Structures. ACM Trans. Comput. Log. 18(4): 33:1-33:25 (2017) - [c13]Kord Eickmeyer, Ken-ichi Kawarabayashi:
FO Model Checking on Map Graphs. FCT 2017: 204-216 - [c12]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. GD 2017: 531-545 - [c11]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: 63:1-63:14 - [i6]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 abs/1708.07653 (2017) - 2016
- [c10]Kord Eickmeyer, Ken-ichi Kawarabayashi:
Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. CSL 2016: 18:1-18:15 - [i5]Kord Eickmeyer, Michael Elberfeld, Frederik Harwath:
Succinctness of Order-Invariant Logics on Depth-Bounded Structures. CoRR abs/1603.09055 (2016) - [i4]Kord Eickmeyer, Ken-ichi Kawarabayashi:
Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. CoRR abs/1605.01198 (2016) - [i3]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 abs/1612.08197 (2016) - 2014
- [c9]Kord Eickmeyer, Michael Elberfeld, Frederik Harwath:
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. MFCS (1) 2014: 256-266 - 2013
- [c8]Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes. LICS 2013: 134-142 - [c7]Kord Eickmeyer, Ken-ichi Kawarabayashi:
Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree. SAGT 2013: 134-145 - 2012
- [c6]Yijia Chen, Kord Eickmeyer, Jörg Flum:
The Exponential Time Hypothesis and the Parameterized Clique Problem. IPEC 2012: 13-24 - [c5]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: 96-107 - [i2]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. TR12 (2012) - 2011
- [b1]Kord Eickmeyer:
Randomness in complexity theory and logics. Humboldt University of Berlin, 2011 - [j2]Kord Eickmeyer, Martin Grohe:
Randomisation and Derandomisation in Descriptive Complexity Theory. Log. Methods Comput. Sci. 7(3) (2011) - [c4]Kord Eickmeyer:
Non-Definability Results for Randomised First-Order Logic. CSL 2011: 218-232 - 2010
- [c3]Kord Eickmeyer, Martin Grohe:
Randomisation and Derandomisation in Descriptive Complexity Theory. CSL 2010: 275-289 - [i1]Kord Eickmeyer, Martin Grohe:
Randomisation and Derandomisation in Descriptive Complexity Theory. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2008
- [j1]Kord Eickmeyer, Peter Huggins, Lior Pachter, Ruriko Yoshida:
On the optimality of the neighbor-joining algorithm. Algorithms Mol. Biol. 3 (2008) - [c2]Kord Eickmeyer, Ruriko Yoshida:
The Geometry of the Neighbor-Joining Algorithm for Small Trees. AB 2008: 81-95 - [c1]Kord Eickmeyer, Martin Grohe, Magdalena Grüber:
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. CCC 2008: 8-18
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
