1: On the Parameterized Complexity of $k$-Edge Colouring
2: An in-place, subquadratic algorithm for permutation inversion
3: A Compact Representation of Raster Time Series
4: K-Core Minimization: A Game Theoretic Approach
5: Subset Feedback Vertex Set in Chordal and Split Graphs
6: Fair Algorithms for Clustering
7: Faster parameterized algorithm for pumpkin vertex deletion set
8: New approach for a stable multi-criteria ridesharing system
9: Fast generalized DFTs for all finite groups
10: Coercion-Resistant Voting in Linear Time via Fully Homomorphic Encryption: Towards a Quantum-Safe Scheme
11: Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Window
12: Fragile Complexity of Comparison-Based Algorithms
13: The Lingering of Gradients: Theory and Applications
14: Entropy Bounds for Grammar-Based Tree Compressors
15: Quantum-inspired sublinear algorithm for solving low-rank semidefinite programming
16: Scheduling in distributed systems: A cloud computing perspective
17: On Kernelization for Edge Dominating Set under Structural Parameters
18: Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time
19: Destroying Bicolored $P_3$s by Deleting Few Edges
20: Depth First Search in the Semi-streaming Model
21: Exponentially Faster Massively Parallel Maximal Matching
22: On Huang and Wong’s Algorithm for Generalized Binary Split Trees
23: Joint Placement and Allocation of VNF Nodes with Budget and Capacity Constraints
24: Fast Deterministic Algorithms for Highly-Dynamic Networks
25: Longest Common Subsequence on Weighted Sequences
26: Tight Analysis of the Smartstart Algorithm for Online Dial-a-Ride on the Line