StringologyTimes

Data Structures and Algorithms: 2024/1/29-31

1: The Discrepancy of Shortest Paths
2: Pushing the Limits: Concurrency Detection in Acyclic Sound Free-Choice Workflow Nets in $O(P^2 + T^2)$
3: A Speed-up for Helsgaun’s TSP Heuristic by Relaxing the Positive Gain Criterion
4: A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation
5: Elementary first-order model checking for sparse graphs
6: On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
7: Towards Optimal Grammars for RNA Structures
8: The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems
9: Data organization limits the predictability of binary classification
10: Dependency-Aware Online Caching
11: Explicit Good Codes Approaching Distance 1 in Ulam Metric
12: Estimating Diffusion Degree on Graph Streams
13: Convergence analysis of t-SNE as a gradient flow for point cloud on a manifold
14: Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures
15: Enhancing Grover’s Search Algorithm: A Modified Approach to Increase the Probability of Good States