◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Nichterlein

19 papers hereh-index 201.2k citations87 works total

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

author position
  • middle author13
  • last author6

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

fields
  • cs.DS15
  • cs.CC3
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20122026
most citedDetecting and Enumerating Small Induced Subgraphs in c-Closed Graphs

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

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.CC2017

When can Graph Hyperbolicity be computed in Linear Time?

Till Fluschnik, Christian Komusiewicz, George B. Mertzios +3

Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen int…

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