Abstract is missing.
- Front Matter [doi]
- Unifying Matrix Data Structures: Simplifying and Speeding up Iterative AlgorithmsJan van den Brand. 1-13 [doi]
- Soft Sequence HeapsGerth Stølting Brodal. 14-24 [doi]
- New Bounds for the Vertices of the Integer HullSebastian Berndt, Klaus Jansen, Kim-Manuel Klein. 25-36 [doi]
- Dispersion for Intervals: A Geometric ApproachTherese C. Biedl, Anna Lubiw, Anurag Murty Naredla, Peter Dominik Ralbovsky, Graeme Stroud. 37-44 [doi]
- Modular Subset Sum, Dynamic Strings, and Zero-Sum SetsJean Cardinal, John Iacono. 45-56 [doi]
- Fast and Simple Modular Subset SumKyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu. 57-67 [doi]
- Recursive Random Contraction RevisitedDavid R. Karger, David P. Williamson. 68-73 [doi]
- A Note on a Recent Algorithm for Minimum CutPawel Gawrychowski, Shay Mozes, Oren Weimann. 74-79 [doi]
- A Simple Deterministic Algorithm for Edge ConnectivityThatchaphol Saranurak. 80-85 [doi]
- Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum MatchingManoj Gupta 0002, Shahbaz Khan 0004. 86-91 [doi]
- Recognizing (Unit) Interval Graphs by Zigzag Graph SearchesYixin Cao 0001. 92-106 [doi]
- An Economics-Based Analysis of RANKING for Online Bipartite MatchingAlon Eden, Michal Feldman, Amos Fiat, Kineret Segal. 107-110 [doi]
- Generalized Sorting with PredictionsPinyan Lu, Xuandi Ren, Enze Sun, Yubo Zhang. 111-117 [doi]
- N-th Term of a Linearly Recurrent SequenceAlin Bostan, Ryuhei Mori. 118-132 [doi]
- Floors and Ceilings in Divide-and-Conquer RecurrencesWilliam Kuszmaul, Charles E. Leiserson. 133-141 [doi]
- Hutch++: Optimal Stochastic Trace EstimationRaphael A. Meyer, Cameron Musco, Christopher Musco, David P. Woodruff. 142-155 [doi]
- Communication Efficient Coresets for Maximum MatchingMichael Kapralov, Gilbert Maystre, Jakab Tardos. 156-164 [doi]
- An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation ModelsSepehr Assadi, S. Cliff Liu, Robert E. Tarjan. 165-171 [doi]
- A Simple Semi-Streaming Algorithm for Global Minimum CutsSepehr Assadi, Aditi Dudeja. 172-180 [doi]
- Improved Algorithms for Edge Colouring in the W-Streaming ModelMoses Charikar, Paul Liu. 181-183 [doi]
- A Breezing Proof of the KMW BoundCorinna Coupette, Christoph Lenzen. 184-195 [doi]
- Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour ConjectureGeorg Anegg, Haris Angelidakis, Rico Zenklusen. 196-203 [doi]
- t-free graphs via shrinking the space of induced pathsMarcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski. 204-209 [doi]
- On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting CodesKarthik C. S., Inbal Livni Navon. 210-223 [doi]
- Further Unifying the Landscape of Cell Probe Lower BoundsKasper Green Larsen, Jonathan Lindegaard Starup, Jesper Steensgaard. 224-231 [doi]
- Simple Reductions from Formula-SAT to Pattern Matching on Labeled Graphs and Subtree IsomorphismDaniel Gibney, Gary Hoppenworth, Sharma V. Thankachan. 232-242 [doi]