1: Recognizing and Embedding Simple Optimal 2-Planar Graphs
2: Biobjective Optimization Problems on Matroids with Binary Costs
3: Hardness and Approximation of Submodular Minimum Linear Ordering Problems
4: LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States
5: The SDP value of random 2CSPs
6: Approximate counting and sampling via local central limit theorems
7: Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set
8: Bit-efficient Numerical Aggregation and Stronger Privacy for Trust in Federated Analytics
9: Node Connectivity Augmentation via Iterative Randomized Rounding
10: Server Cloud Scheduling
11: Singularly Near Optimal Leader Election in Asynchronous Networks
12: Evacuating from ell_p Unit Disks in the Wireless Model
13: Existence and polynomial time construction of biregular, bipartite Ramanujan graphs of all degrees
14: Extending the Graph Formalism to Higher-Order Gates
15: Scheduling with Communication Delay in Near-Linear Time
16: Differentially Private n-gram Extraction
17: Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
18: Higher-order motif analysis in hypergraphs
19: An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs