1: Query Minimization under Stochastic Uncertainty
2: Efficient Temporal Pattern Mining in Big Time Series Using Mutual Information – Full Version
3: A Matroid Generalization of the Super-Stable Matching Problem
4: An Improved Exact Algorithm for the Exact Satisfiability Problem
5: An Experimental Analysis of Indoor Spatial Queries: Modeling, Indexing, and Processing
6: Online Allocation of Reusable Resources via Algorithms Guided by Fluid Approximations
7: Succinct Permutation Graphs
8: Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination
9: Sensitivity Analysis of Submodular Function Maximization
10: Succinct Navigational Oracles for Families of Intersection Graphs on a Circle
11: Stand Up Indulgent Rendezvous
12: Fair and Representative Subset Selection from Data Streams
13: Constant-time connectivity tests
14: Equitable Scheduling on a Single Machine
15: A Tale of Two Trees: New Analysis for AVL Tree and Binary Heap
16: The Complexity of Mixed-Connectivity
17: Lattice (List) Decoding Near Minkowski’s Inequality
18: Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings
19: Noise in Classification
20: Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization
21: On Structural Parameterizations of Load Coloring
22: Group Testing for Efficiently Sampling Hypergraphs When Tests Have Variable Costs
23: Combining the Mersenne Twister and the Xorgens Designs
24: An exponent one-fifth algorithm for deterministic integer factorisation
25: Growth of Random Trees by Leaf Attachment
26: Incomplete Directed Perfect Phylogeny in Linear Time
27: Interval Query Problem on Cube-free Median Graphs
28: Almost Linear Time Algorithms for Minsum $k$-Sink Problems on Dynamic Flow Path Networks
29: Graph Square Roots of Small Distance from Degree One Graphs
30: Sparse universal graphs for planarity
31: New Sublinear Algorithms and Lower Bounds for LIS Estimation
32: A Refined Laser Method and Faster Matrix Multiplication
33: An Extension of the Birkhoff-von Neumann Theorem to Non-Bipartite Graphs
34: Counting Subgraphs in Degenerate Graphs
35: Streaming enumeration on nested documents
36: TextHide: Tackling Data Privacy in Language Understanding Tasks
37: Unified lower bounds for interactive high-dimensional estimation under information constraints
38: Optimal Low-Degree Hardness of Maximum Independent Set
39: LCM from FCA Point of View: A CbO-style Algorithm with Speed-up Features
40: Contextual Pattern Matching
41: More on ordered open end bin packing
42: It’s the Best Only When It Fits You Most: Finding Related Models for Serving Based on Dynamic Locality Sensitive Hashing