1: Fixed-point cycles and EFX allocations
2: A Note on Hardness of Multiprocessor Scheduling with Scheduling Solution Space Tree
3: Dynamic Infection Spread Model Based Group Testing
4: A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems
5: Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
6: Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing
7: Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
8: An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem
9: On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment
10: Computing Weak Dominance Drawings with Minimum Number of Fips
11: Safety and Completeness in Flow Decompositions for RNA Assembly
12: An Algorithmic Framework for Bias Bounties
13: Sketching Matrix Least Squares via Leverage Scores Estimates
14: Stochastic diagonal estimation: probabilistic bounds and an improved algorithm
15: Sampling Equilibria: Fast No-Regret Learning in Structured Games
16: Generation Matrix: An Embeddable Matrix Representation for Hierarchical Trees
17: High-order Line Graphs of Non-uniform Hypergraphs: Algorithms, Applications, and Experimental Analysis
18: Fairness Implications of Encoding Protected Categorical Attributes
19: Predecessor on the Ultra-Wide Word RAM
20: Two-Commodity Flow is Equivalent to Linear Programming under Nearly-Linear Time Reductions
21: An Algorithmic Framework for Locally Constrained Homomorphisms
22: Positive Rate Binary Interactive Error Correcting Codes Resilient to $>\frac12$ Adversarial Erasures
23: Transfer Learning In Differential Privacy’s Hybrid-Model