1: The Efficiency of the ANS Entropy Encoding
2: Weighted Random Sampling over Joins
3: Automatically layout and visualize the biological pathway map with spectral graph theory
4: New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS
5: A Knapsack Intersection Hierarchy Applied to All-or-Nothing Flow in Trees
6: Quantum Distributed Algorithms for Detection of Cliques
7: Locality-Preserving Hashing for Shifts with Connections to Cryptography
8: Voronoi diagrams for the distributed sensor network system data processing
9: Deletion to Scattered Graph Classes II – Improved FPT Algorithms for Deletion to Pairs of Graph Classes
10: An Exact Algorithm for finding Maximum Induced Matching in Subcubic Graphs
11: Detours in Directed Graphs
12: Bounded Space Differentially Private Quantiles
13: Asymptotic Optimality of the Greedy Patching Heuristic for Max TSP in Doubling Metrics
14: Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs
15: Partial Vertex Cover on Graphs of Bounded Degeneracy
16: EP-PQM: Efficient Parametric Probabilistic Quantum Memory with Fewer Qubits and Gates
17: The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs
18: Approximating Subset Sum Ratio via Partition Computations
19: A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
20: On the Statistical Complexity of Sample Amplification
21: Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint
22: A Characterization of Approximability for Biased CSPs
23: Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width
24: Planning in Observable POMDPs in Quasipolynomial Time
25: Approximate the individually fair k-center with outliers
26: Faster Counting and Sampling Algorithms using Colorful Decision Oracle
27: Benchmarking Problems for Robust Discrete Optimization
28: Temporal Connectivity: Coping with Foreseen and Unforeseen Delays
29: Cardinality Constrained Scheduling in Online Models
30: Multiple Genome Analytics Framework: The Case of All SARS-CoV-2 Complete Variants
31: The Ideal Membership Problem and Abelian Groups
32: Delay-Robust Routes in Temporal Graphs
33: Covering Many (or Few) Edges with k Vertices in Sparse Graphs