Accepted Posters

Poster             Presenter

Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching Da Wei (David) Zheng

Steiner Connectivity Augmentation Michael Zlatin

On the Estimation of the Number of Communities for Sparse Networks Neil Hwang

(1-ε)-Approximate Maximum Weighted Matching in poly(1/ε, log n) Time in the Distributed and Parallel Settings Shang-En Huang

Edge Connectivity Augmentation and Splitting off Ruoxu Cen

Maximal k-Edge-Connected Partition in Weighted Graphs via Local Random Contraction Chaitanya Nalam

Motif Cut Sparsifiers Mikhail Makarov

Efficient Construction of Directed Hopsets and Parallel Single-Source Shortest Paths Nairen Cao

Survivable Network Design Revisited: Group-Connectivity Qingyun Chen

Moments, Random Walks, and Limits for Spectrum Approximation Apoorv Vikram Singh

Lower Bounds for Exact Hopsets and Shortcut Sets Gary Hoppenworth

1+ε Approximate Dynamic Matching Size in Truly Sublinear Time Peter Kiss

Polynomial Ramsey Bounds and 𝜒-boundedness for Weakly Closed Graphs Vaishali Surianarayanan

Near-Optimal Deterministic Vertex-Failure Connectivity Oracles Yaowei Long

Approximation Algorithms for Network Design in Non-Uniform Fault Models Rhea Jain

Graph Reconstruction from Random Subgraphs Rik Sengupta

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set Shubhang Kulkarni

Finding a Small Vertex Cut on Distributed Networks Yonggang Jiang

Computing Flip Graphs of Highly Non-Convex Polygons Mattie Ji

Nearly-linear Time Hypergraph Partitioning via Cut-Matching Games Antares Chen

Low-Memory Algorithms for Online Edge Coloring Manuel Stoeckl

Streaming Edge Coloring with Asymptotically Optimal Colors Mohammad Saneian

Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation Amir Azarmehr

Cheeger Inequalities for Vertex Expansion, Directed Graphs and Hypergraphs via Reweighted Eigenvalues Kam Chuen Tung

Differentially Private Range Query on Shortest Paths Chengyuan Deng

Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance Chen Wang

Vantage Point Selection Algorithms for Bottleneck Capacity Estimation Vikrant Ashvinkumar