1: An Algorithm for Context-Free Path Queries over Graph Databases
2: Exact Single-Source SimRank Computation on Large Graphs
3: Graph Matching with Partially-Correct Seeds
4: Earned Benefit Maximization in Social Networks Under Budget Constraint
5: Continuous Credit Networks and Layer 2 Blockchains: Monotonicity and Sampling
6: An Improved Cutting Plane Method for Convex Optimization, Convex-Concave Games and its Applications
7: Revisiting 2-3 Red-Black Trees with a Pedagogically Sound yet Efficient Deletion Algorithm: The Parity-Seeking Delete Algorithm
8: Near-Optimal Decremental SSSP in Dense Weighted Digraphs
9: Storing Set Families More Compactly with Top ZDDs
10: Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits
11: Composable Sketches for Functions of Frequencies: Beyond the Worst Case
12: Pattern Discovery in Colored Strings
13: A Simplified Run Time Analysis of the Univariate Marginal Distribution Algorithm on LeadingOnes
14: Bounding the Mim-Width of Hereditary Graph Classes
15: Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective
16: First Stretch then Shrink and Bulk: A Two Phase Approach for Enumeration of Maximal $(\Delta, \gamma)$\mbox{-}Cliques of a Temporal Network
17: Two halves of a meaningful text are statistically different
18: Grammar-compressed Self-index with Lyndon Words
19: Locality-Sensitive Hashing Scheme based on Longest Circular Co-Substring
20: Construction and Random Generation of Hypergraphs with Prescribed Degree and Dimension Sequences
21: Multiparty Selection
22: Linear-time Algorithms for Eliminating Claws in Graphs
23: A Fast Algorithm for Source-wise Round-trip Spanners
24: Lower Bound for Succinct Range Minimum Query
25: Learning Mixtures of Spherical Gaussians via Fourier Analysis
26: Optimizing Reachability Sets in Temporal Graphs by Delaying
27: A General Framework for Approximating Min Sum Ordering Problems
28: Non-clairvoyant Scheduling of Coflows
29: Adversarially Robust Streaming Algorithms via Differential Privacy
30: Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
31: Coresets for Clustering in Euclidean Spaces: Importance Sampling is Nearly Optimal
32: Squares: A Fast Counter-Based RNG
33: Hierarchical and Modularly-Minimal Vertex Colorings
34: Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies
35: Broadcast CONGEST Algorithms against Adversarial Edges
36: Quantum speedups of some general-purpose numerical optimisation algorithms