The following pages link to Danupon Nanongkai (Q487010):
Displaying 50 items.
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Best-order streaming model (Q534570) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- Simple FPTAS for the subset-sums ratio problem (Q2445243) (← links)
- Faster Algorithms for Semi-Matching Problems (Q2799478) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- An Approximate Restatement of the Four-Color Theorem (Q2856478) (← links)
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture (Q2941485) (← links)
- Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (Q2941505) (← links)
- A tight unconditional lower bound on distributed randomwalk computation (Q2943404) (← links)
- Can quantum communication speed up distributed computation? (Q2943619) (← links)
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (Q3448830) (← links)
- Faster Algorithms for Semi-matching Problems (Extended Abstract) (Q3587378) (← links)
- Best-Order Streaming Model (Q3630203) (← links)
- Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks (Q4554941) (← links)
- Fully Dynamic Approximate Maximum Matching and Minimum Vertex Cover in <i>O</i>(log<sup>3</sup> <i>n</i>) Worst Case Update Time (Q4575767) (← links)
- (Q4607872) (← links)
- Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time (Q4625657) (← links)
- Distributed Verification and Hardness of Distributed Approximation (Q4907581) (← links)
- Dense Subgraphs on Dynamic Networks (Q4909408) (← links)
- Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n<sup>1/2 - ε</sup>)-time (Q4978052) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
- Weighted min-cut: sequential, cut-query, and streaming algorithms (Q5144937) (← links)
- Coarse-Grained Complexity for Dynamic Algorithms (Q5146795) (← links)
- Fast distributed random walks (Q5170313) (← links)
- Efficient distributed random walks with applications (Q5176199) (← links)
- Breaking quadratic time for small vertex connectivity and an approximation scheme (Q5212766) (← links)
- Distributed exact weighted all-pairs shortest paths in near-linear time (Q5212774) (← links)
- Distributed edge connectivity in sublinear time (Q5212776) (← links)
- Distributed approximation algorithms for weighted shortest paths (Q5259592) (← links)
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (Q5259603) (← links)
- New deterministic approximation algorithms for fully dynamic matching (Q5361847) (← links)
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths (Q5361854) (← links)
- Distributed Computation of Large-scale Graph Problems (Q5362982) (← links)
- A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths (Q5384041) (← links)
- Distributed Random Walks (Q5395702) (← links)
- Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation (Q5405060) (← links)
- (Q5414632) (← links)
- Distributed verification and hardness of distributed approximation (Q5419106) (← links)
- Almost-Tight Distributed Minimum Cut Algorithms (Q5498702) (← links)
- (Q5501344) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q5874268) (← links)
- Brief announcement (Q5891981) (← links)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover (Q6081760) (← links)
- Fully dynamic exact edge connectivity in sublinear time (Q6538528) (← links)
- Near-linear time approximations for cut problems via fair cuts (Q6538536) (← links)
