◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

A. Nagao

4 papers hereh-index 7173 citations20 works total

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

author position
  • first author1
  • middle author2
  • last author1

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

fields
  • cs.CC2
  • cs.DS1
  • cs.GT1

identity via Semantic Scholar / OpenAlex

activity
20202026
most citedFeedback game on Eulerian graphs

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

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2024

On the complexity of finding a spanning even tree in a graph

Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita +4

A tree is said to be even if for every pair of distinct leaves, the length of the unique path between them is even. In this paper we discuss the problem of determining whether an i…

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