Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Danupon Nanongkai
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Coarse-Grained Complexity for Dynamic Algorithms
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme
