1: A Linear Time Parameterized Algorithm for Directed Feedback Vertex Set
2: Time-Variant Graph Classification
3: Sort Race
4: Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection
5: Matrix Product State for Higher-Order Tensor Compression and Classification
6: From H&M to Gap for Lightweight BWT Merging
7: Compressive Computed Tomography Reconstruction through Denoising Approximate Message Passing
8: Fast Cosine Similarity Search in Binary Space with Angular Multi-index Hashing
9: Concordance and the Smallest Covering Set of Preference Orderings
10: K-Medoids For K-Means Seeding
11: RALL - Routing-Aware Of Path Length, Link Quality, And Traffic Load For Wireless Sensor Networks
12: Steiner Network Problems on Temporal Graphs
13: Finding Disjoint Paths on Edge-Colored Graphs: More Tractability Results
14: SpectroMeter: Amortized Sublinear Spectral Approximation of Distance on Graphs
15: Parameterized and Approximation Complexity of Partial VC Dimension
16: A unifying framework for fast randomization of ecological networks with fixed (node) degrees
17: Gradient Descent Learns Linear Dynamical Systems
18: Quantum Speed-ups for Semidefinite Programming
19: Optimality and Sub-optimality of PCA for Spiked Random Matrices and Synchronization
20: Kmerlight: fast and accurate k-mer abundance estimation
21: Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
22: Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order
23: Derandomized concentration bounds for polynomials, and hypergraph maximal independent set
24: Temporal Map Labeling: A New Unified Framework with Experiments
25: Linear-time string indexing and analysis in small space
26: Exact rule-based stochastic simulations for systems with unlimited number of molecular species
27: Energy-Efficient Scheduling: Classification, Bounds, and Algorithms
28: Computing Vertex-Disjoint Paths using MAOs