1: Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
2: Graph classes through the lens of logic
3: Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
4: Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
5: ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines
6: Sampling Unlabeled Chordal Graphs in Expected Polynomial Time
7: Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
8: Distributed Graph Algorithms with Predictions
9: A partition cover approach to tokenization
10: A Survey on Algorithmic Developments in Optimal Transport Problem with Applications
11: Bernstein-Vazirani Algorithm with A CCNOT-Based Oracle
12: Private Selection with Heterogeneous Sensitivities
13: Entangled Mean Estimation in High-Dimensions
14: Faster Edge Coloring by Partition Sieving
15: Mim-Width is paraNP-complete
16: Colorful Vertex Recoloring of Bipartite Graphs
17: DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory
18: Faster parameterized algorithm for 3-Hitting Set
19: A Tight VC-Dimension Analysis of Clustering Coresets with Applications
20: TUCKET: A Tensor Time Series Data Structure for Efficient and Accurate Factor Analysis over Time Ranges
21: On Optimizing Locality of Graph Transposition on Modern Architectures
22: Algorithmical Aspects of Some Bio Inspired Operations
23: Big Atomics
24: DynHAC: Fully Dynamic Approximate Hierarchical Agglomerative Clustering
25: Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound