1: Space/time-efficient RDF stores based on circular suffix sorting
2: On rooted $k$-connectivity problems in quasi-bipartite digraphs
3: A Faster Interior Point Method for Semidefinite Programming
4: A Low-Level Index for Distributed Logic Programming
5: Quantum control using quantum memory
6: Computing $L(p,1)$-Labeling with Combined Parameters
7: On the Mysteries of MAX NAE-SAT
8: Fast Black-Box Quantum State Preparation
9: On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
10: Comparison of Algorithms for Simple Stochastic Games
11: Timeliness-aware On-site Planning Method for Tour Navigation
12: Bounds on the Spectral Sparsification of Symmetric and Off-Diagonal Nonnegative Real Matrices
13: Sampling an Edge Uniformly in Sublinear Time
14: Convergence of Gibbs Sampling: Coordinate Hit-and-Run Mixes Fast
15: Dynamic Approximate Maximum Independent Set on Massive Graphs
16: Algorithms for a Topology-aware Massively Parallel Computation Model
17: Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
18: Dynamic Similarity Search on Integer Sketches
19: The Affiliate Matching Problem: On Labor Markets where Firms are Also Interested in the Placement of Previous Workers
20: On the Problem of Underranking in Group-Fair Ranking
21: An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs
22: A Case for Partitioned Bloom Filters
23: On the Parameterized Complexity of \textsc{Maximum Degree Contraction} Problem
24: Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
25: Online Hypergraph Matching with Delays
26: Computing the covering radius of a polytope with an application to lonely runners
27: The birth of the strong components
28: Finding a Maximum Minimal Separator: Graph Classes and Fixed-Parameter Tractability
29: On the Approximability of Robust Network Design
30: An SPQR-Tree-Like Embedding Representation for Level Planarity
31: On Two-Handed Planar Assembly Partitioning with Connectivity Constraints
32: Maximum Covering Subtrees for Phylogenetic Networks
33: Hypergraph $k$-cut for fixed $k$ in deterministic polynomial time
34: A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
35: The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes
36: Rank/Select Queries over Mutable Bitmaps
37: Improved FPT Algorithms for Deletion to Forest-like Structures
38: The Complexity of Connectivity Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
39: Digraph homomorphism problem and weak near unanimity polymorphism
40: Discrimination of attractors with noisy nodes in Boolean networks
41: Approximation algorithms for connectivity augmentation problems
42: Explorable Uncertainty in Scheduling with Non-Uniform Testing Times
43: A note on differentially private clustering with large additive error