1: On the representation of de Bruijn graphs
2: 0-1 Integer Linear Programming with a Linear Number of Constraints
3: Fast LTL Satisfiability Checking by SAT Solvers
4: Relations between automata and the simple k-path problem
5: On Randomly Projected Hierarchical Clustering with Guarantees
6: Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring using Zero-Suppressed Binary Decision Diagrams
7: A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis
8: Algorithms for Generating Ordered Solutions for Explicit AND/OR Structures
9: A Algorithm for the Hamilton Circuit Problem
10: An experimental exploration of Marsaglia’s xorshift generators, scrambled
11: On computing the $2$-vertex-connected components of directed graphs
12: Computing the inverses, their power sums, and extrema for Euler’s totient and other multiplicative functions
13: On Fence Patrolling by Mobile Agents
14: A Semi Distributed Approach for Min-Max Fair Car-Parking Slot Assignment Problem
15: Preconditioning in Expectation
16: On Combinatorial Generation of Prefix Normal Words
17: Coalition Structure Generation over Graphs
18: Bounds on Herman’s algorithm
19: An exact algorithm for the weighed mutually exclusive maximum set cover problem
20: Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost
21: Strategic aspects of the probabilistic serial rule for the allocation of goods
22: A Novel String Distance Function based on Most Frequent K Characters
23: Multivariate sparse interpolation using randomized Kronecker substitutions
24: Weakly Submodular Functions
25: A Linear-Time Algorithm for Trust Region Problems
26: An N-Body Solution to the Problem of Fock Exchange
27: Optimal Spread in Network Consensus Models
28: Scalable Online Betweenness Centrality in Evolving Graphs
29: A Fast String Matching Algorithm Based on Lowlight Characters in the Pattern