1: Survivable Network Design Revisited: Group-Connectivity
2: A First Runtime Analysis of the NSGA-II on a Multimodal Problem
3: HashNWalk: Hash and Random Walk Based Anomaly Detection in Hyperedge Streams
4: Efficient Algorithms for Monotone Non-Submodular Maximization with Partition Matroid Constraint
5: Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution
6: Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates
7: Improved Sublinear-Time Edit Distance for Preprocessed Strings
8: DePa: Simple, Provably Efficient, and Practical Order Maintenance for Task Parallelism
9: Breaking the Linear Error Barrier in Differentially Private Graph Distance Release
10: Enumerating Connected Dominating Sets
11: A Scalable 5,6-Qubit Grover’s Quantum Search Algorithm
12: Quantum Telecloning on NISQ Computers
13: Improved Approximation to First-Best Gains-from-Trade