◍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 cs.GTShow all

3 papers · 1 filter

cs.GT2012★ 3 cited

Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs

Parinya Chalermsook, Shiva Kintali, Richard Lipton +1

Consider the following problem. A seller has infinite copies of n products represented by nodes in a graph. There are m consumers, each has a budget and wants to buy two produc…

cs.GT2012

Geometric Pricing: How Low Dimensionality Helps in Approximability

Parinya Chalermsook, Khaled Elbassioni, Danupon Nanongkai +1

Consider the following toy problem. There are m rectangles and n points on the plane. Each rectangle R is a consumer with budget BR​, who is interested in purchasing the ch…

cs.GT2009

Stackelberg Pricing is Hard to Approximate within 2−ε

Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai

Stackelberg Pricing Games is a two-level combinatorial pricing problem studied in the Economics, Operation Research, and Computer Science communities. In this paper, we consider th…

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