1: Assembling Omnitigs using Hidden-Order de Bruijn Graphs
2: Transforming graph states using single-qubit operations
3: How to transform graph states using single-qubit operations: computational complexity and algorithms
4: Maximum Entropy Interval Aggregations
5: On the approximability of the stable marriage problem with one-sided ties
6: Congested Clique Algorithms for Graph Spanners
7: Online interval scheduling to maximize total satisfaction
8: Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data
9: On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model
10: Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry
11: Parallel Working-Set Search Structures
12: Short Schedules for Fast Flow Rerouting
13: Seek and Push: Detecting Large Traffic Aggregates in the Dataplane
14: Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest
15: On Computing Average Common Substring Over Run Length Encoded Sequences
16: On Fair Division of Indivisible Items
17: Integrated Bounds for Disintegrated Storage
18: Max-Product for Maximum Weight Matching - Revisited
19: Wireless coverage prediction via parametric shortest paths
20: Dual parameterization of Weighted Coloring
21: Fast approximation of centrality and distances in hyperbolic graphs
22: External memory BWT and LCP computation for sequence collections with applications
23: Deleting edges to restrict the size of an epidemic in temporal networks
24: Revisiting the tree edit distance and its backtracing: A tutorial
25: Coding for Interactive Communication with Small Memory and Applications to Robust Circuits
26: Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice
27: Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth
28: Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size
29: Deterministic Distributed Ruling Sets of Line Graphs
30: Subspace Selection via DR-Submodular Maximization on Lattices
31: Projection-Free Bandit Convex Optimization
32: A Compositional Approach to Network Algorithms
33: An optimal approximation of discrete random variables with respect to the Kolmogorov distance
34: Orthogonal Point Location and Rectangle Stabbing Queries in 3-d
35: On testing substitutability
36: Do You Like What I Like? Similarity Estimation in Proximity-based Mobile Social Networks
37: A PTAS for a Class of Stochastic Dynamic Programs
38: Distributed Approximation of Minimum $k$-edge-connected Spanning Subgraphs
39: Improved Learning of One-hidden-layer Convolutional Neural Networks with Overlaps
40: Randomized Strategies for Robust Combinatorial Optimization
41: A $\frac{5}{2}$-Approximation Algorithm for Coloring Rooted Subtrees of a Degree $3$ Tree
42: The Adaptive Sampling Revisited