1: Linking and Cutting Spanning Trees
2: Efficient Learning of Optimal Markov Network Topology with k-Tree Modeling
3: Sequence Covering Similarity for Symbolic Sequence Comparison
4: Deterministic Scheduling of Periodic Messages for Low Latency in Cloud RAN
5: A Novel Weighted Distance Measure for Multi-Attributed Graph
6: Secure $k$-ish Nearest Neighbors Classifier
7: Perfect simulation of the Hard Disks Model by Partial Rejection Sampling
8: The Importance of Communities for Learning to Influence
9: Learning Networks from Random Walk-Based Node Similarities
10: Onion Curve: A Space Filling Curve with Near-Optimal Clustering
11: Sliding Suffix Tree using LCA
12: Heuristic algorithms for the Maximum Colorful Subtree problem
13: Improved Pseudo-Polynomial-Time Approximation for Strip Packing
14: An Efficient Primal-Dual Algorithm for Fair Combinatorial Optimization Problems
15: Stable gonality is computable
16: Byzantine Gathering in Polynomial Time
17: A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism
18: Finding induced subgraphs in scale-free inhomogeneous random graphs
19: Rollercoasters and Caterpillars
20: A New Algorithm for Double Scalar Multiplication over Koblitz Curves
21: Reducing Binary Quadratic Forms for More Scalable Quantum Annealing
22: Adaptive Lower Bound for Testing Monotonicity on the Line
23: On bounded pitch inequalities for the min-knapsack polytope
24: On Scheduling Two-Stage Jobs on Multiple Two-Stage Flowshops
25: Faster Approximate(d) Text-to-Pattern L1 Distance