1: Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
2: Fully Dynamic Maximal Matching in Constant Update Time
3: Graph Decompositions Analysis and Comparison for Cohesive Subgraphs Detection
4: KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
5: Decomposing Cubic Graphs into Connected Subgraphs of Size Three
6: Recursive Modified Pattern Search on High-dimensional Simplex : A Blackbox Optimization Technique
7: On Approximating Functions of the Singular Values in a Stream
8: I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark
9: Optimal Computation of Avoided Words
10: A Linear Time Parameterized Algorithm for Node Unique Label Cover
11: Strongly Refuting Random CSPs Below the Spectral Threshold
12: Improved Algorithms for the Evacuation Route Planning Problem
13: Dynamic Graph Stream Algorithms in $o(n)$ Space
14: Automatic Parameter Derivations in k2U Framework