( en | de | ru )

 

Disambiguation of "Huang, Chien-Chung"

Author of the publication

copydeleteadd this publication to your clipboard
Distributed Exact Weighted All-Pairs Shortest Paths in Õ(n5/4) Rounds.

, , and . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Chien-Chung Huang

Chien-Chung Fu

Jung-Chien Huang

Yu-chung Huang

Chung-cheng Huang

 

Other publications of authors with the same name

Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint., , and . Algorithmica, 82 (4): 1006-1032 (2020)AEP-DLA: Adverse Event Prediction in Hospitalized Adult Patients Using Deep Learning Algorithms., , , , , , , , and . IEEE Access, (2021)Robust Sparsification for Matroid Intersection with Applications., and . CoRR, (2023)Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver., , , , , and . ICALP, volume 229 of LIPIcs, page 37:1-37:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Robust Sparsification for Matroid Intersection with Applications., and . SODA, page 2916-2940. SIAM, (2024)Matroid-Constrained Maximum Vertex Cover: Approximate Kernels and Streaming Algorithms., and . SWAT, volume 227 of LIPIcs, page 27:1-27:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Approximating maximum integral multiflows on bounded genus graphs., , , and . CoRR, (2020)Approximating Maximum Integral Multiflows on Bounded Genus Graphs., , , and . ICALP, volume 198 of LIPIcs, page 80:1-80:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint., , and . APPROX-RANDOM, volume 81 of LIPIcs, page 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints., , and . APPROX-RANDOM, volume 176 of LIPIcs, page 62:1-62:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)