1: Streaming Lower Bounds for Approximating MAX-CUT
2: Online Bipartite Matching with Decomposable Weights
3: The Large Margin Mechanism for Differentially Private Maximization
4: A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks
5: Sketching Cuts in Graphs and Hypergraphs
6: A Parameterized Study of Maximum Generalized Pattern Matching Problems
7: Approximating solution structure of the Weighted Sentence Alignment problem
8: Linear-time Algorithms for Proportional Apportionment
9: Scattered packings of cycles
10: Efficient Algorithms for Discrepancy Minimization in Convex Sets
11: Path algebra algorithm for finding longest increasing subsequence
12: Graph Orientation and Flows Over Time
13: On Shor’s Factoring Algorithm with More Registers and the Problem to Certify Quantum Computers
14: Two-Phase Bicriterion Search for Finding Fast and Efficient Electric Vehicle Routes
15: Strategies for Utility Maximization in Social Groups with Preferential Exploration
16: Selection Algorithms with Small Groups
17: A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices
18: Data Reductions and Combinatorial Bounds for Improved Approximation Algorithms
19: Hafnians, perfect matchings and Gaussian matrices
20: A Fast Quartet Tree Heuristic for Hierarchical Clustering