Sam Chiu-wai Wong

According to our database1, Sam Chiu-wai Wong authored at least 16 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Network Design for <i>s</i>-<i>t</i> Effective Resistance.
ACM Trans. Algorithms, 2022

Truthful Online Scheduling of Cloud Workloads under Uncertainty.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

2020
Computing Walrasian equilibria: fast algorithms and structural properties.
Math. Program., 2020

An improved cutting plane method for convex optimization, convex-concave games, and its applications.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
Network design for s-t effective resistance.
CoRR, 2019

Faster Matroid Intersection.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017
Subquadratic submodular function minimization.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Tight Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Tight Bounds for Approximate Carathéodory and Beyond.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Matroid Online Bipartite Matching and Vertex Cover.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015
Computing Walrasian Equilibria: Fast Algorithms and Economic Insights.
CoRR, 2015

Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

A Faster Cutting Plane Method and its Implications for Combinatorial and Convex Optimization.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Multiplicative bidding in online advertising.
Proceedings of the ACM Conference on Economics and Computation, 2014

2013
Online Vertex Cover and Matching: Beating the Greedy Algorithm
CoRR, 2013


  Loading...