Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Nanongkai, Danupon
159  Ergebnisse:
Personensuche X
?
1

Deterministic Near-Optimal Approximation Algorithms for Dyn..:

Bhattacharya, Sayan ; Henzinger, Monika ; Nanongkai, Danupon.
SIAM Journal on Computing.  52 (2023)  5 - p. 1132-1192 , 2023
Link: https://doi.org/10.1137/..
 
?
2

Fast Algorithms via Dynamic-Oracle Matroids:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Blikstad, Joakim ; Mukhopadhyay, Sagnik ; Nanongkai, Danupon. - p. 1229-1242 , 2023
Link: https://dl.acm.org/doi/1..
 
?
3

Equivalence classes and conditional hardness in massively p..:

Nanongkai, Danupon ; Scquizzato, Michele
Distributed Computing.  35 (2022)  2 - p. 165-183 , 2022
Link: https://doi.org/10.1007/..
 
?
4

Minimum Cuts in Directed Graphs via Partial Sparsification:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Cen, Ruoxu ; Li, Jason ; Nanongkai, Danupon... - p. 1147-1158 , 2022
Link: https://doi.org/10.1109/..
 
?
5

Cut Query Algorithms with Star Contraction:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Apers, Simon ; Efron, Yuval ; Gawrychowski, Pawel... - p. 507-518 , 2022
Link: https://doi.org/10.1109/..
 
?
6

Negative-Weight Single-Source Shortest Paths in Near-linear..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Bernstein, Aaron ; Nanongkai, Danupon ; Wulff-Nilsen, Christian - p. 600-611 , 2022
Link: https://doi.org/10.1109/..
 
?
7

Faster Connectivity in Low-Rank Hypergraphs via Expander De..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Beideman, Calvin ; Chandrasekaran, Karthekeyan ; Mukhopadhyay, Sagnik. - p. 70-83 , 2022
Link: https://doi.org/10.1007/..
 
?
8

Nearly Optimal Communication and Query Complexity of Bipart..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Blikstad, Joakim ; Van Den Brand, Jan ; Efron, Yuval.. - p. 1174-1185 , 2022
Link: https://doi.org/10.1109/..
 
?
9

Distributed Exact Weighted All-Pairs Shortest Paths in Rand..:

Bernstein, Aaron ; Nanongkai, Danupon
SIAM Journal on Computing.  52 (2021)  2 - p. STOC19-112-STOC19-127 , 2021
Link: https://doi.org/10.1137/..
 
?
10

Dynamic Set Cover: Improved Amortized and Worst-Case Update..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Bhattacharya, Sayan ; Henzinger, Monika ; Nanongkai, Danupon. - p. 2537-2549 , 2021
Link: https://doi.org/10.1137/..
 
?
11

Dynamic set cover : improved amortized and worst-case up..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Bhattacharya, Sayan ; Henzinger, Monika ; Nanongkai, Danupon. - p. 2537-2549 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

Breaking the quadratic barrier for matroid intersection:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Blikstad, Joakim ; van den Brand, Jan ; Mukhopadhyay, Sagnik. - p. 421-432 , 2021
Link: https://dl.acm.org/doi/1..
 
?
13

Work-Optimal Parallel Minimum Cuts for Non-Sparse Graphs:

, In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures,
López-Martínez, Andrés ; Mukhopadhyay, Sagnik ; Nanongkai, Danupon - p. 351-361 , 2021
Link: https://dl.acm.org/doi/1..
 
?
14

Distributed weighted min-cut in nearly-optimal time:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Dory, Michal ; Efron, Yuval ; Mukhopadhyay, Sagnik. - p. 1144-1153 , 2021
Link: https://dl.acm.org/doi/1..
 
?
15

Vertex connectivity in poly-logarithmic max-flows:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Li, Jason ; Nanongkai, Danupon ; Panigrahi, Debmalya.. - p. 317-329 , 2021
Link: https://dl.acm.org/doi/1..
 
1-15