1: Constructing Long Paths in Graph Streams
2: PIPQ: Strict Insert-Optimized Concurrent Priority Queue
3: On the number of MUSs crossing a position
4: Symmetry-breaking symmetry in directed spectral partitioning
5: Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
6: Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables
7: Quality control in sublinear time: a case study via random graphs
8: Polynomial Property Testing
9: 2-Layer Fan-Planarity in Polynomial Time
10: Better Indexing for Rectangular Pattern Matching
11: A Little Clairvoyance Is All You Need
12: Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
13: On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
14: Spectral Refutations of Semirandom $k$-LIN over Larger Fields
15: Exact Optimization for Minimum Dominating Sets
16: Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
17: Improving Pinwheel Density Bounds for Small Minimums
18: An 8- and 12-bit block AES cipher
19: Hypergraph Splitting-Off via Element-Connectivity Preserving Reductions
20: Graph Traversal via Connected Mobile Agents
21: Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
22: DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
23: Efficiently Coloring the Intersection of a General Matroid and Partition Matroids
24: An Optimal Sorting Algorithm for Persistent Random Comparison Faults
25: Optimizing Wiggle in Storylines
26: An algorithm for accurate and simple-looking metaphorical maps
27: Distributed Sparsest Cut via Eigenvalue Estimation
28: Internally-Convex Drawings of Outerplanar Graphs in Small Area
29: Visualizing Treewidth
30: Bipartite Matching with Pair-Dependent Bounds
31: Flow-weighted Layered Metric Euclidean Capacitated Steiner Tree Problem
32: Commitment Gap via Correlation Gap
33: Reducing Shortcut and Hopset Constructions to Shallow Graphs
34: Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
35: Improved Dominance Filtering for Unions and Minkowski Sums of Pareto Sets
36: Sharp Online Hardness for Large Balanced Independent Sets