◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Christian Rosenke

5 papers hereh-index 12331 citations38 works total

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

author position
  • first author2
  • middle author1
  • last author2

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

fields
  • cs.CC1
  • cs.DM1
  • cs.DS1
  • cs.LO1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20172026
most citedThe Hardness of Synthesizing Elementary Net Systems from Highly Restricted Inputs

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

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2023★ 1 cited

Computing Optimal Leaf Roots of Chordal Cographs in Linear Time

Van Bang Le, Christian Rosenke

A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T with leaf set V(G) such that, for all vertices x, y in V(G), the edge xy exists in G if and only if the dis…

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