1: Concerning Iterative Graph Normalization and Maximum Weight Independent Sets
2: Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models
3: A New Approach to Regular & Indeterminate Strings
4: Minimum Robust Multi-Submodular Cover for Fairness
5: Instance Optimal Join Size Estimation
6: An efficient model for the preemptive single machine scheduling of equal-length jobs
7: On the Integrality Gap of Binary Integer Programs with Gaussian Data
8: Efficient PTAS for the Maximum Traveling Salesman Problem in a Metric Space of Fixed Doubling Dimension
9: Objective-Based Hierarchical Clustering of Deep Embedding Vectors
10: Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
11: Sorting Lists with Equal Keys Using Mergesort in Linear Time
12: Generating from the Strauss Process using stitching
13: Reconstructing decision trees
14: Try Before You Buy: A practical data purchasing algorithm for real-world data marketplaces
15: Greedy-reduction from Shortest Linear Superstring to Shortest Circular Superstring
16: Indirect Identification of Horizontal Gene Transfer
17: Maximum 0-1 Timed Matching on Temporal Graphs
18: A Note on Optimizing the Ratio of Monotone Supermodular Functions
19: Planar Maximum Coverage Location Problem with Partial Coverage, Continuous Spatial Demand, and Adjustable Quality of Service
20: On Avoiding the Union Bound When Answering Multiple Differentially Private Queries
21: Listing Small Minimal Separators of a Graph
22: Nearly tight Trotterization of interacting electrons
23: Clustering with Semidefinite Programming and Fixed Point Iteration
24: Quantum Algorithm for Lexicographically Minimal String Rotation
25: Balancing Geometry and Density: Path Distances on High-Dimensional Data
26: Metrical Task Systems with Online Machine Learned Advice
27: Enhancing Balanced Graph Edge Partition with Effective Local Search
28: Query-Competitive Sorting with Uncertainty
29: Sampling Arborescences in Parallel
30: Induced Disjoint Paths in AT-free Graphs
31: An Improved Approach for Estimating Social POI Boundaries With Textual Attributes on Social Media
32: Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
33: The Parameterized Suffix Tray
34: Subcubic Algorithms for Gomory-Hu Tree in Unweighted Graphs
35: Results on Competitiveness of Online Shortest Remaining Processing Time(SRPT) Scheduling with Special Classes of Inputs
36: On the Power of Localized Perceptron for Label-Optimal Learning of Halfspaces with Adversarial Noise
37: Outliers Detection Is Not So Hard: Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques
38: Pattern Matching in Doubling Spaces
39: Learning Halfspaces With Membership Queries
40: Sublinear Maximum Inner Product Search using Concomitants of Extreme Order Statistics
41: Parallel Index-Based Structural Graph Clustering and Its Approximation
42: Fast Rule-Based Graph Programs