Abstract is missing.
- A Local Search-Based Approach for Set CoveringAnupam Gupta 0001, Euiwoong Lee, Jason Li 0006. 1-11 [doi]
- Minimum Cost Adaptive Submodular CoverYubing Cui, Viswanath Nagarajan. 12-27 [doi]
- A Simple Algorithm for Submodular Minimum Linear OrderingDor Katzelnick, Roy Schwartz 0002. 28-35 [doi]
- Approximate minimum cuts and their enumerationCalvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang 0002. 36-41 [doi]
- A Simple Framework for Finding Balanced Sparse Cuts via APSPLi Chen, Rasmus Kyng, Maximilian Probst Gutenberg, Sushant Sachdeva. 42-55 [doi]
- k-MST Problem in GraphsEmmett Breen, Renee Mirka, Zichen Wang, David P. Williamson. 56-68 [doi]
- An EPTAS for Budgeted Matroid Independent SetIlan Doron Arad, Ariel Kulik, Hadas Shachnai. 69-83 [doi]
- Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior InformationRichard Santiago, Ivan Sergeev, Rico Zenklusen. 84-95 [doi]
- A Simple Combinatorial Algorithm for Robust Matroid CenterGeorg Anegg, Laura Vargas Koch, Rico Zenklusen. 96-102 [doi]
- Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable MatchingGergely Csáji, Tamás Király, Yu Yokoi. 103-113 [doi]
- Capacitated Vehicle Routing in Graphic MetricsTobias Mömke, Hang Zhou 0001. 114-123 [doi]
- Voting algorithms for unique games on complete graphsAntoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman. 124-136 [doi]
- Faster Walsh-Hadamard Transform and Matrix Multiplication over Finite Fields using Lookup TablesJosh Alman. 137-144 [doi]
- k-Center in Sparse GraphsAmir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi. 145-155 [doi]
- Simpler and faster algorithms for detours in planar digraphsMeike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski. 156-165 [doi]
- A Simple Deterministic Distributed Low-Diameter ClusteringVáclav Rozhon, Bernhard Haeupler, Christoph Grunau. 166-174 [doi]
- Sinkless Orientation Made SimpleAlkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid 0001, Jan Studený, Jukka Suomela, Jara Uitto. 175-191 [doi]
- Min-Max Optimization Made Simple: Approximating the Proximal Point Method via Contraction MapsVolkan Cevher, Georgios Piliouras, Ryann Sim, Stratis Skoulakis. 192-206 [doi]
- An Optimal Algorithm for Certifying Monotone FunctionsMeghal Gupta, Naren Sarayu Manoj. 207-212 [doi]
- Tight Bounds for Vertex Connectivity in Dynamic StreamsSepehr Assadi, Vihan Shah. 213-227 [doi]
- Simple Set SketchingJakob Bæk Tejs Houen, Rasmus Pagh, Stefan Walzer. 228-241 [doi]
- Estimating the Effective Support Size in Constant Query ComplexityShyam Narayanan, Jakub Tetek. 242-252 [doi]
- Sampling an Edge in Sublinear Time Exactly and OptimallyTalya Eden, Shyam Narayanan, Jakub Tetek. 253-260 [doi]
- Fully-dynamic-to-incremental reductions with known deletion order (e.g. sliding window)Binghui Peng, Aviad Rubinstein. 261-271 [doi]
- An Optimal Lower Bound for Simplex Range ReportingPeyman Afshani, Pingan Cheng. 272-277 [doi]
- Derandomization of Cell SamplingAlexander Golovnev, Tom Gur, Igor Shinkar. 278-284 [doi]
- Optimal resizable arraysRobert E. Tarjan, Uri Zwick. 285-304 [doi]
- Splay Top TreesJacob Holm, Eva Rotenberg, Alice Ryhl. 305-331 [doi]
- Proximity Search in the Greedy TreeOliver A. Chubet, Parth Parikh, Donald R. Sheehy, Siddharth Sheth. 332-342 [doi]
- A simple polynomial-time approximation algorithm for the total variation distance between two product distributionsWeiming Feng 0001, Heng Guo 0001, Mark Jerrum, Jiaheng Wang 0002. 343-347 [doi]
- Gaussian Mean Testing Made SimpleIlias Diakonikolas, Daniel M. Kane, Ankit Pensia. 348-352 [doi]
- A Tight Analysis of Hutchinson's Diagonal EstimatorPrathamesh Dharangutte, Christopher Musco. 353-364 [doi]
- A Simple Optimal Algorithm for the 2-Arm Bandit ProblemMaxime Larcher, Robert Meier, Angelika Steger. 365-372 [doi]
- An Improved Online Reduction from PAC Learning to Mistake-Bounded LearningLucas Gretta, Eric Price 0001. 373-380 [doi]
- Simplified Prophet Inequalities for Combinatorial AuctionsAlexander Braun, Thomas Kesselheim. 381-389 [doi]