◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Danupon Nanongkai

73 papers hereh-index 414.5k citations118 works total

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

author position
  • sole author2
  • first author7
  • middle author33
  • last author29

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

fields
  • cs.DS51
  • cs.DC14
  • cs.CC4
  • cs.GT3
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20092026
most citedUnifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture

215 citations · 689 across the 60 of their papers we have counts for

collaborators
Showing 2010Show all

2 papers · 1 filter

cs.DC2010★ 1 cited

Distributed Verification and Hardness of Distributed Approximation

Atish Das Sarma, Stephan Holzer, Liah Kor +5

We study the {\em verification} problem in distributed networks, stated as follows. Let H be a subgraph of a network G where each vertex of G knows which edges incident on it…

cs.DS2010★ 16 cited

Faster Algorithms for Semi-Matching Problems

Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai

We consider the problem of finding \textit{semi-matching} in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster alg…

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