1: Ranked Enumeration of Join Queries with Projections
2: The Parameterized Complexity of s-Club with Triangle and Seed Constraints
3: Cut query algorithms with star contraction
4: Lower bounds on the performance of online algorithms for relaxed packing problems
5: Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual
6: Hypergraph Cuts with Edge-Dependent Vertex Weights
7: A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem
8: Linear Time Construction of Indexable Elastic Founder Graphs
9: Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature
10: Paired compressed cover trees guarantee a near linear parametrized complexity for all $k$-nearest neighbors search in an arbitrary metric space
11: Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
12: Improved Approximation and Scalability for Fair Max-Min Diversification
13: Computing Longest (Common) Lyndon Subsequences
14: The Parameterized Complexity of Welfare Guarantees in Schelling Segregation
15: Simplified Algorithms for Order-Based Core Maintenance
16: Finding Strong Components Using Depth-First Search
17: Dynamical Dorfman Testing with Quarantine
18: Sparsification of Decomposable Submodular Functions
19: Bamboo Trimming Revisited: Simple Algorithms Can Do Well Too
20: Ordinal Maximin Share Approximation for Chores
21: The Query Complexity of Certification
22: FreSCo: Mining Frequent Patterns in Simplicial Complexes
23: Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions
24: Invasion Dynamics in the Biased Voter Process
25: Scalable $k$-d trees for distributed data
26: Dealing with elementary paths in the Kidney Exchange Problem
27: Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling
28: An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints