◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Ekkehard Köhler

5 papers hereh-index 201.6k citations84 works total

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

author position
  • middle author4
  • last author1

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

fields
  • cs.DM2
  • math.CO2
  • cs.DS1
same name
  • Ekkehard Köhler — 9 papers, h 0

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20182026
most citedLinear Time LexDFS on Chordal Graphs

2 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2026

Breadth-First Search Trees with Many or Few Leaves

Jesse Beisegel, Ekkehard Köhler, Robert Scheffler +1

The Maximum (Minimum) Leaf Spanning Tree problem asks for a spanning tree with the largest (smallest) number of leaves. As spanning trees are often computed using graph search algo…

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