1: A new upper bound for the clique cover number with applications
2: Nearly optimal classification for semimetrics
3: Derivation of a low multiplicative complexity algorithm for multiplying hyperbolic octonions
4: A framework for space-efficient string kernels
5: Greedy Minimization of Weakly Supermodular Set Functions
6: Polynomial Interpolation and Identity Testing from High Powers over Finite Fields
7: A deterministic sublinear-time nonadaptive algorithm for metric $1$-median selection
8: Optimization Problems in Correlated Networks
9: Computing the Degenerate Ground Space of Gapped Spin Chains in Polynomial Time
10: Variability in data streams
11: Which phylogenetic networks are merely trees with additional arcs?
12: An approximation algorithm for the longest cycle problem in solid grid graphs
13: Local Linearizability
14: Linear complexity SimRank computation based on the iterative diagonal estimation
15: Incremental DFS Trees on Arbitrary Directed Graphs
16: Automata and Graph Compression
17: Improved Approximation Algorithms for k-Submodular Function Maximization
18: Reachability is in DynFO
19: Comparison Issues in Large Graphs: State of the Art and Future Directions
20: On the complexity of computing the $k$-restricted edge-connectivity of a graph
21: Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Search
22: The $k$-Leaf Spanning Tree Problem Admits a Klam Value of 39
23: Inferring an Indeterminate String from a Prefix Graph
24: Is Nearly-linear the same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver
25: Combinatorial approximation of maximum $k$-vertex cover in bipartite graphs within ratio~0.7
26: Algorithms for Longest Common Abelian Factors
27: O(1) Time Generation of Adjacent Multiset Combinations