◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Kord Eickmeyer

11 papers hereh-index 8211 citations19 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author9

Across the 9 of 11 papers where every author was matched, so the position is known.

fields
  • cs.LO4
  • cs.CG2
  • math.CO2
  • cs.DM1
  • cs.FL1
  • q-bio.QM1

identity via Semantic Scholar / OpenAlex

activity
20072025
most citedNeighborhood complexity and kernelization for nowhere dense classes of graphs

6 citations · 8 across the 7 of their papers we have counts for

collaborators
Showing 2009Show all

1 paper · 1 filter

math.CO2009

The Geometry of the Neighbor-Joining Algorithm for Small Trees

Kord Eickmeyer, Ruriko Yoshida

In 2007, Eickmeyer et al. showed that the tree topologies outputted by the Neighbor-Joining (NJ) algorithm and the balanced minimum evolution (BME) method for phylogenetic reconstr…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.