The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account https://my.siam.org.
  • Description

CHAPTERS

CHAPTERS

For selected items:
Full Access

Front Matter

pp. i–xx
Abstract
Full Access

Prior-Independent Auctions for Heterogeneous Bidders

pp. 1–18
Abstract
Full Access

Impossibilities for Obviously Strategy-Proof Mechanisms

pp. 19–40
Abstract
Full Access

Revenue Maximization for Buyers with Costly Participation

pp. 41–73
Abstract
Full Access

Breaking the 3/4 Barrier for Approximate Maximin Share

pp. 74–91
Abstract
Full Access

Combinatorial Contracts Beyond Gross Substitutes

pp. 92–108
Abstract
Full Access

On Supermodular Contracts and Dense Subgraphs

pp. 109–132
Abstract
Full Access

Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns

pp. 133–149
Abstract
Full Access

Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D

pp. 150–170
Abstract
Full Access

Dynamic Dictionary with Subconstant Wasted Bits per Key

pp. 171–207
Abstract
Full Access

Dynamic Dynamic Time Warping

pp. 208–242
Abstract
Full Access

Dynamically Maintaining the Persistent Homology of Time Series

pp. 243–295
Abstract
Full Access

Fully dynamic approximation schemes on planar and apex-minor-free graphs

pp. 296–313
Abstract
Full Access

Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations

pp. 314–345
Abstract
Full Access

Shortest Disjoint Paths on a Grid

pp. 346–365
Abstract
Full Access

Tree Containment Above Minimum Degree is FPT

pp. 366–376
Abstract
Full Access

Determinantal Sieving

pp. 377–423
Abstract
Full Access

Minimization is Harder in the Prophet World

pp. 424–461
Abstract
Full Access

Bandit Algorithms for Prophet Inequality and Pandora's Box

pp. 462–500
Abstract
Full Access

Rationality-Robust Information Design: Bayesian Persuasion under Quantal Response

pp. 501–546
Abstract
Full Access

Equilibrium Dynamics in Market Games with Exchangeable and Divisible Resources

pp. 547–568
Abstract
Full Access

Simple Delegated Choice

pp. 569–590
Abstract
Full Access

Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues

pp. 591–624
Abstract
Full Access

A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph

pp. 625–638
Abstract
Full Access

Single-Source Unsplittable Flows in Planar Graphs

pp. 639–668
Abstract
Full Access

2-Approximation for Prize-Collecting Steiner Forest

pp. 669–693
Abstract
Full Access

An
cover
Lower Bound for Steiner Point Removal

pp. 694–698
Abstract
Full Access

Euclidean Bottleneck Steiner Tree is Fixed-Parameter Tractable

pp. 699–711
Abstract
Full Access

Meta-theorems for Parameterized Streaming Algorithms‡

pp. 712–739
Abstract
Full Access

Parameterized algorithms for block-structured integer programs with large entries

pp. 740–751
Abstract
Full Access

Factoring Pattern-Free Permutations into Separable ones

pp. 752–779
Abstract
Full Access

Representative set statements for delta-matroids and the Mader delta-matroid

pp. 780–810
Abstract
Full Access

On the Unreasonable Effectiveness of Single Vector Krylov Methods for Low-Rank Approximation

pp. 811–845
Abstract
Full Access

Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral Algorithms

pp. 846–879
Abstract
Full Access

Matrix Perturbation: Davis-Kahan in the Infinity Norm

pp. 880–934
Abstract
Full Access

A PTAS for 0-Low Rank Approximation: Solving Dense CSPs over Reals

pp. 935–961
Abstract
Full Access

Strongly Polynomial Frame Scaling to High Precision

pp. 962–981
Abstract
Full Access

Positivity Certificates for Linear Recurrences

pp. 982–994
Abstract
Full Access

A Unifying Framework for Differentially Private Sums under Continual Observation

pp. 995–1018
Abstract
Full Access

Optimal Bounds on Private Graph Approximation

pp. 1019–1049
Abstract
Full Access

Shannon meets Gray: Noise-robust, Low-sensitivity Codes with Applications in Differential Privacy

pp. 1050–1066
Abstract
Full Access

Adjacency Sketches in Adversarial Environments

pp. 1067–1098
Abstract
Full Access

Sorting and Selection in Rounds with Adversarial Comparisons

pp. 1099–1119
Abstract
Full Access

Deterministic Byzantine Agreement with Adaptive O(n · f) Communication

pp. 1120–1146
Abstract
Full Access

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes

pp. 1147–1165
Abstract
Full Access

On the Extremal Functions of Acyclic Forbidden 0-1 Matrices

pp. 1166–1176
Abstract
Full Access

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic

pp. 1177–1193
Abstract
Full Access

Triangulations Admit Dominating Sets of Size 2n/7.

pp. 1194–1240
Abstract
Full Access

The Grid-Minor Theorem Revisited

pp. 1241–1245
Abstract
Full Access

Partial Coloring Complex, Vertex Decomposability and Tverberg's Theorem with Constraints

pp. 1246–1259
Abstract
Full Access

Approximating Subset Sum Ratio faster than Subset Sum

pp. 1260–1277
Abstract
Full Access

A Parameterized Family of Meta-Submodular Functions

pp. 1278–1306
Abstract
Full Access

Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs

pp. 1307–1327
Abstract
Full Access

Tight approximability of MAX 2-SAT and relatives, under UGC

pp. 1328–1344
Abstract
Full Access

Gap Amplification for Reconfiguration Problems

pp. 1345–1366
Abstract
Full Access

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets

pp. 1367–1378
Abstract
Full Access

Conflict Checkable and Decodable Codes and Their Applications

pp. 1379–1424
Abstract
Full Access

Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings

pp. 1425–1436
Abstract
Full Access

Cliquewidth and Dimension

pp. 1437–1446
Abstract
Full Access

The Hierarchy of Hereditary Sorting Operators

pp. 1447–1464
Abstract
Full Access

Cactus Representations in Polylogarithmic Max-flow via Maximal Isolating Mincuts

pp. 1465–1502
Abstract
Full Access

Cactus Representation of Minimum Cuts: Derandomize and Speed up

pp. 1503–1541
Abstract
Full Access

Beyond the Quadratic Time Barrier for Network Unreliability

pp. 1542–1567
Abstract
Full Access

On (1 + ɛ)-Approximate Flow Sparsifiers

pp. 1568–1605
Abstract
Full Access

Max s, t-Flow Oracles and Negative Cycle Detection in Planar Digraphs

pp. 1606–1620
Abstract
Full Access

Breaking the Metric Voting Distortion Barrier

pp. 1621–1640
Abstract
Full Access

Composition of nested embeddings with an application to outlier removal

pp. 1641–1668
Abstract
Full Access

On Approximability of Steiner Tree in p-metrics

pp. 1669–1703
Abstract
Full Access

Improved Approximations for Ultrametric Violation Distance

pp. 1704–1737
Abstract
Full Access

A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds

pp. 1738–1765
Abstract
Full Access

On Deterministically Approximating Total Variation Distance

pp. 1766–1791
Abstract
Full Access

The Sharp Power Law of Local Search on Expanders

pp. 1792–1809
Abstract
Full Access

Randomized Communication and Implicit Representations for Matrices and Graphs of Small Sign-Rank

pp. 1810–1833
Abstract
Full Access

Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds

pp. 1834–1853
Abstract
Full Access

Count on CFI graphs for #P-hardness

pp. 1854–1871
Abstract
Full Access

On the Hardness of PosSLP

pp. 1872–1886
Abstract
Full Access

Computing the 5-Edge-Connected Components in Linear Time

pp. 1887–2119
Abstract
Full Access

Edge-Coloring Algorithms for Bounded Degree Multigraphs

pp. 2120–2157
Abstract
Full Access

Exact Community Recovery in the Geometric SBM

pp. 2158–2184
Abstract
Full Access

A Faster Combinatorial Algorithm for Maximum Bipartite Matching

pp. 2185–2235
Abstract
Full Access

Higher-Order Cheeger Inequality for Partitioning with Buffers

pp. 2236–2274
Abstract
Full Access

Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time

pp. 2275–2304
Abstract
Full Access

Faster exact and approximation algorithms for packing and covering matroids via push-relabel

pp. 2305–2336
Abstract
Full Access

New SDP Roundings and Certifiable Approximation for Cubic Optimization

pp. 2337–2362
Abstract
Full Access

New Approximation Bounds for Small-Set Vertex Expansion

pp. 2363–2375
Abstract
Full Access

On the hardness of finding balanced independent sets in random bipartite graphs

pp. 2376–2397
Abstract
Full Access

An Improved Classical Singular Value Transformation for Quantum Machine Learning

pp. 2398–2453
Abstract
Full Access

Recovering the original simplicity: succinct and deterministic quantum algorithm for the welded tree problem

pp. 2454–2480
Abstract
Full Access

Viderman's algorithm for quantum LDPC codes

pp. 2481–2507
Abstract
Full Access

Efficient Quantum State Synthesis with One Query

pp. 2508–2534
Abstract
Full Access

Quantum Worst-Case to Average-Case Reductions for All Linear Problems

pp. 2535–2567
Abstract
Full Access

Nearly Optimal Approximate Dual-Failure Replacement Paths

pp. 2568–2596
Abstract
Full Access

Exact Shortest Paths with Rational Weights on the Word RAM

pp. 2597–2608
Abstract
Full Access

Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free

pp. 2609–2642
Abstract
Full Access

Simpler and Higher Lower Bounds for Shortcut Sets

pp. 2643–2656
Abstract
Full Access

Distances and shortest paths on graphs of bounded highway dimension: simple, fast, dynamic

pp. 2657–2678
Abstract
Full Access

Fair Price Discrimination

pp. 2679–2703
Abstract
Full Access

School Redistricting: Wiping Unfairness Off the Map

pp. 2704–2724
Abstract
Full Access

Oracle Efficient Online Multicalibration and Omniprediction

pp. 2725–2792
Abstract
Full Access

Improved Approximation Algorithms for the Joint Replenishment Problem with Outliers, and with Fairness Constraints

pp. 2793–2828
Abstract
Full Access

Santa Claus meets Makespan and Matroids: Algorithms and Reductions

pp. 2829–2860
Abstract
Full Access

A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams

pp. 2861–2880
Abstract
Full Access

An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation

pp. 2881–2899
Abstract
Full Access

Time-Space Lower Bounds for Bounded-Error Computation in the Random-Query Model

pp. 2900–2915
Abstract
Full Access

Robust Sparsification for Matroid Intersection with Applications

pp. 2916–2940
Abstract
Full Access

Robust 1-bit Compressed Sensing with Iterative Hard Thresholding

pp. 2941–2979
Abstract
Full Access

Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time

pp. 2980–2998
Abstract
Full Access

Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time

pp. 2999–3026
Abstract
Full Access

Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary

pp. 3027–3039
Abstract
Full Access

Fully Dynamic Matching:
cover
-Approximation in Polylog Update Time

pp. 3040–3061
Abstract
Full Access

Adaptive Out-Orientations with Applications

pp. 3062–3088
Abstract
Full Access

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs

pp. 3089–3139
Abstract
Full Access

The Cost of Parallelizing Boosting

pp. 3140–3155
Abstract
Full Access

How Many Neurons Does it Take to Approximate the Maximum?

pp. 3156–3183
Abstract
Full Access

Learning Hard-Constrained Models with One Sample

pp. 3184–3196
Abstract
Full Access

Online Robust Mean Estimation

pp. 3197–3235
Abstract
Full Access

Optimal rates for ranking a permuted isotonic matrix in polynomial time

pp. 3236–3273
Abstract
Full Access

Faster Sublinear-Time Edit Distance

pp. 3274–3301
Abstract
Full Access

Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization

pp. 3302–3332
Abstract
Full Access

Deterministic Sparse Pattern Matching via the Baur-Strassen Theorem

pp. 3333–3353
Abstract
Full Access

Sparse Regular Expression Matching

pp. 3354–3375
Abstract
Full Access

Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data

pp. 3376–3392
Abstract
Full Access

Nibbling at Long Cycles: Dynamic (and Static) Edge Coloring in Optimal Time

pp. 3393–3440
Abstract
Full Access

Dynamic algorithms for k-center on graphs

pp. 3441–3462
Abstract
Full Access

Fully Dynamic Consistent k-Center Clustering

pp. 3463–3484
Abstract
Full Access

Dynamic Algorithms for Matroid Submodular Maximization

pp. 3485–3533
Abstract
Full Access

On Dynamic Graph Algorithms with Predictions

pp. 3534–3557
Abstract
Full Access

Fast Algorithms for Separable Linear Programs

pp. 3558–3604
Abstract
Full Access

Integer Programming with GCD Constraints

pp. 3605–3658
Abstract
Full Access

Convex Minimization with Integer Minima in Õ(n4) Time

pp. 3659–3684
Abstract
Full Access

A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions

pp. 3685–3723
Abstract
Full Access

Arborescences, Colorful Forests, and Popularity

pp. 3724–3746
Abstract
Full Access

Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation

pp. 3747–3764
Abstract
Full Access

Faster Rectangular Matrix Multiplication by Combination Loss Analysis

pp. 3765–3791
Abstract
Full Access

New Bounds for Matrix Multiplication: from Alpha to Omega

pp. 3792–3835
Abstract
Full Access

Fast Fourier transform via automorphism groups of rational function fields

pp. 3836–3859
Abstract
Full Access

Nearly Optimal Black Box Polynomial Root-finders

pp. 3860–3900
Abstract
Full Access

Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits

pp. 3901–3918
Abstract
Full Access

The Identity Problem in nilpotent groups of bounded class

pp. 3919–3959
Abstract
Full Access

Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree

pp. 3960–3996
Abstract
Full Access

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth

pp. 3997–4061
Abstract
Full Access

A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching

pp. 4062–4082
Abstract
Full Access

A Distributed Palette Sparsification Theorem

pp. 4083–4123
Abstract
Full Access

Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds

pp. 4124–4154
Abstract
Full Access

The Minority Dynamics and the Power of Synchronicity

pp. 4155–4176
Abstract
Full Access

Bin Packing under Random-Order: Breaking the Barrier of 3/2

pp. 4177–4219
Abstract
Full Access

Poly-logarithmic Competitiveness for the k-Taxi Problem

pp. 4220–4246
Abstract
Full Access

Controlling Tail Risk in Online Ski-Rental

pp. 4247–4263
Abstract
Full Access

Breaking the k/ log k Barrier in Collective Tree Exploration via Tree-Mining

pp. 4264–4282
Abstract
Full Access

Maintaining Matroid Intersections Online

pp. 4283–4304
Abstract
Full Access

A Tight Bound for Testing Partition Properties

pp. 4305–4320
Abstract
Full Access

Mildly Exponential Lower Bounds on Tolerant Testers for Monotonicity, Unateness, and Juntas

pp. 4321–4337
Abstract
Full Access

Uniformity Testing over Hypergrids with Subcube Conditioning

pp. 4338–4370
Abstract
Full Access

Tight Lower Bound on Equivalence Testing in Conditional Sampling Model

pp. 4371–4394
Abstract
Full Access

Adversarial Low Degree Testing

pp. 4395–4409
Abstract
Full Access

Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs

pp. 4410–4450
Abstract
Full Access

An Optimal Algorithm for Higher-Order Voronoi Diagrams in the Plane: The Usefulness of Nondeterminism

pp. 4451–4463
Abstract
Full Access

Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions

pp. 4464–4501
Abstract
Full Access

Solving Fréchet Distance Problems by Algebraic Geometric Methods

pp. 4502–4513
Abstract
Full Access

Fast and Accurate Approximations of the Optimal Transport in Semi-Discrete and Discrete Settings

pp. 4514–4529
Abstract
Full Access

Set Covering with Our Eyes Wide Shut

pp. 4530–4553
Abstract
Full Access

Edge-disjoint paths in expanders: online with removals

pp. 4554–4563
Abstract
Full Access

Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings

pp. 4564–4579
Abstract
Full Access

Power of Posted-price Mechanisms for Prophet Inequalities

pp. 4580–4604
Abstract
Full Access

Combinatorial Stationary Prophet Inequalities

pp. 4605–4630
Abstract
Full Access

Edge-weighted Online Stochastic Matching: Beating
cover

pp. 4631–4640
Abstract
Full Access

Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation

pp. 4641–4669
Abstract
Full Access

The Time Complexity of Fully Sparse Matrix Multiplication

pp. 4670–4703
Abstract
Full Access

The Effect of Sparsity on k-Dominating Set and Related First-Order Graph Properties

pp. 4704–4727
Abstract
Full Access

Fast 2-Approximate All-Pairs Shortest Paths

pp. 4728–4757
Abstract
Full Access

Faster Approximate All Pairs Shortest Paths

pp. 4758–4827
Abstract
Full Access

Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results

pp. 4828–4848
Abstract
Full Access

Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles

pp. 4849–4871
Abstract
Full Access

Delaunay Bifiltrations of Functions on Point Clouds

pp. 4872–4891
Abstract
Full Access

Fast Approximation Algorithms for Piercing Boxes by Points

pp. 4892–4908
Abstract
Full Access

Untangling Graphs on Surfaces

pp. 4909–4941
Abstract
Full Access

Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment

pp. 4942–4962
Abstract
Full Access

New Explicit Constant-Degree Lossless Expanders

pp. 4963–4971
Abstract
Full Access

Fast Sampling of b-Matchings and b-Edge Covers

pp. 4972–4987
Abstract
Full Access

Combinatorial Approach for Factorization of Variance and Entropy in Spin Systems

pp. 4988–5012
Abstract
Full Access

Optimality of Glauber dynamics for general-purpose Ising model sampling and free energy approximation

pp. 5013–5028
Abstract
Full Access

Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses

pp. 5029–5056
Abstract
Full Access

Smoothed Complexity of SWAP in Local Graph Partitioning

pp. 5057–5083
Abstract
Full Access

Sublinear Time Low-Rank Approximation of Toeplitz Matrices

pp. 5084–5117
Abstract
Full Access

A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations

pp. 5118–5144
Abstract
Full Access

Code Sparsification and its Applications

pp. 5145–5168
Abstract
Full Access

Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory

pp. 5169–5208
Abstract
Full Access

Quotient sparsification for submodular functions

pp. 5209–5248
Abstract
Full Access

Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition

pp. 5249–5275
Abstract
Full Access

Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time

pp. 5276–5290
Abstract
Full Access

Sparse induced subgraphs in P6-free graphs

pp. 5291–5299
Abstract
Full Access

Shortcut Partitions in Minor-Free Graphs: Steiner Point Removal, Distance Oracles, Tree Covers, and More

pp. 5300–5331
Abstract
Full Access

VC Set Systems in Minor-free (Di)Graphs and Applications

pp. 5332–5360
Abstract
cover image Proceedings

Recommended Content

40 off sale logo