◍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 q-bio.QMShow all

1 paper · 1 filter

q-bio.QM2007★ 1 cited

On the optimality of the neighbor-joining algorithm

Kord Eickmeyer, Peter Huggins, Lior Pachter +1

The popular neighbor-joining (NJ) algorithm used in phylogenetics is a greedy algorithm for finding the balanced minimum evolution (BME) tree associated to a dissimilarity map. Fro…

◍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.