1: $2$-edge-twinless blocks
2: Proximity Search For Maximal Subgraph Enumeration
3: Nested Column Generation decomposition for solving the Routing and Spectrum Allocation problem in Elastic Optical Networks
4: Near-Optimal Schedules for Simultaneous Multicasts
5: Scalable Hierarchical Clustering with Tree Grafting
6: Partitioning algorithms for weighted trees and cactus graphs
7: Approximating Text-to-Pattern Hamming Distances
8: Lossless Compression of Deep Neural Networks
9: Multi-transversals for Triangles and the Tuza’s Conjecture
10: Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
11: Coarse-Grained Complexity for Dynamic Algorithms
12: Analysis and Evaluation of Non-Blocking Interpolation Search Trees
13: Optimal Entropy Compression and Purification in Quantum Bits
14: A cutting-plane algorithm for the Steiner team orienteering problem
15: Moser-Tardos resampling algorithm, entropy compression method and the subset gas
16: Submodular Matroid Secretary Problem with Shortlists
17: On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs
18: Computing Euclidean k-Center over Sliding Windows
19: Discovering and Certifying Lower Bounds for the Online Bin Stretching Problem
20: New lower bounds for Massively Parallel Computation from query complexity
21: Cutoff for exact recovery of Gaussian mixture models
22: Learning fine-grained search space pruning and heuristics for combinatorial optimization
23: All non-trivial variants of 3-LDT are equivalent
24: Tight Localizations of Feedback Sets
25: On Efficient Distance Approximation for Graph Properties
26: An Optimal Algorithm for 1-D Cutting Stock Problem
27: A Hybrid Approach to Temporal Pattern Matching
28: An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
29: A new approach on estimating the fluid temperature in a multiphase flow system using particle filter method
30: Understanding the QuickXPlain Algorithm: Simple Explanation and Formal Proof
31: Quantum Algorithms for the Most Frequently String Search, Intersection of Two String Sequences and Sorting of Strings Problems
32: Complexity Issues of String to Graph Approximate Matching