1: nCk sequences and their difference sequences
2: Split-by-edges trees
3: A Semidefinite Programming Method for Integer Convex Quadratic Minimization
4: Polynomial Factorization over Finite Fields By Computing Euler-Poincare Characteristics of Drinfeld Modules
5: Weighted graph algorithms with Python
6: On k-Submodular Relaxation
7: A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions
8: Incorporating Road Networks into Territory Design
9: Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation
10: Using the WOWA operator in robust discrete optimization problems
11: Algorithms for Non-Linear and Stochastic Resource Constrained Shortest Paths
12: Efficient Lipschitz Extensions for High-Dimensional Graph Statistics and Node Private Degree Distributions
13: Sublinear-Time Decremental Algorithms for Single-Source Reachability and Shortest Paths on Directed Graphs
14: On Temporal Graph Exploration
15: A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection
16: A Comparison of Approaches for Solving Hard Graph-Theoretic Problems
17: Streaming Algorithms for Submodular Function Maximization
18: Parameterized Algorithms for Deletion to (r,l)-graphs
19: A shortcut to (sun)flowers: Kernels in logarithmic space or linear time
20: Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm
21: Rule based lexicographical permutation sequences