1: Level-Planar Drawings with Few Slopes
2: Binary component decomposition Part II: The asymmetric case
3: Binary Component Decomposition Part I: The Positive-Semidefinite Case
4: Multi-Point Bandit Algorithms for Nonstationary Online Nonconvex Optimization
5: A Model of Random Industrial SAT
6: “Sliced” Subwindow Search: a Sublinear-complexity Solution to the Maximum Rectangle Problem
7: An L0-Norm Constrained Non-Negative Matrix Factorization Algorithm for the Simultaneous Disaggregation of Fixed and Shiftable Loads
8: The Constrained Round Robin Algorithm for Fair and Efficient Allocation
9: GLU3.0: Fast GPU-based Parallel Sparse LU Factorization for Circuit Simulation
10: An Improved Approximation Algorithm for TSP in the Half Integral Case
11: Distributed Data Summarization in Well-Connected Networks
12: New Techniques for Graph Edit Distance Computation
13: Sparse Regression via Range Counting
14: An SPQR-Tree-Like Embedding Representation for Upward Planarity
15: Online Payment Network Design
16: On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
17: Dynamic Optimality Refuted – For Tournament Heaps
18: A Randomized Algorithm for Preconditioner Selection
19: Submodular Cost Submodular Cover with an Approximate Oracle
20: Independent Double Roman Domination on Block Graphs
21: On the Merge of k-NN Graph
22: Competitive Online Search Trees on Trees
23: An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover
24: Efficient Truncated Statistics with Unknown Truncation
25: Adaptive Shrinkage Estimation for Streaming Graphs
26: An Optimized Disk Scheduling Algorithm With Bad-Sector Management
27: The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems
28: Faster algorithms for cograph edge modification problems
29: Faster Guarantees of Evolutionary Algorithms for Maximization of Monotone Submodular Functions
30: Robust Max Entrywise Error Bounds for Tensor Estimation from Sparse Observations via Similarity Based Collaborative Filtering
31: Matching reads to many genomes with the $r$-index
32: Computing the inverse geodesic length in planar graphs and graphs of bounded treewidth
33: Graph Drawing with Morphing Partial Edges
34: Heuristic Algorithm for Generalized Function Matching
35: Learned Clause Minimization in Parallel SAT Solvers
36: On the cyclic regularities of strings
37: Optimal Joins using Compact Data Structures
38: Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
39: Engineering Negative Cycle Canceling for Wind Farm Cabling
40: Competitive Search in a Network
41: On the maximum number of minimal connected dominating sets in convex bipartite graphs
42: An Index for Sequencing Reads Based on The Colored de Bruijn Graph
43: A Universality Theorem for Nested Polytopes
44: A Constraint Model for the Tree Decomposition of a Graph
45: Fully dynamic hierarchical diameter k-clustering and k-center