Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs. - Ivona Bezáková; Zachary Langley (COCOON, 2012)

Minimum Planar Multi-sink Cuts with Connectivity Priors. - Ivona Bezáková; Zachary Langley (MFCS (2), 2014)

Improved Bounds for Distributed Load Balancing. - Sepehr Assadi; Aaron Bernstein; Zachary Langley (DISC, 2020)

A framework for dynamic matching in weighted graphs. - Aaron Bernstein; Aditi Dudeja; Zachary Langley (STOC, 2021)

All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method. - Sepehr Assadi; Aaron Bernstein; Zachary Langley (ITCS, 2023)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors. - Sepehr Assadi; Aaron Bernstein; Zachary Langley; Lap Chi Lau; Robert Wang 004 (SODA, 2025)

Matching Composition and Efficient Weight Reduction in Dynamic Matching. - Aaron Bernstein; Jiale Chen 003; Aditi Dudeja; Zachary Langley; Aaron Sidford; Ta-Wei Tu (SODA, 2025)