1: KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
2: Approximations for the Steiner Multicycle Problem
3: Dependent rounding with strong negative-correlation, and scheduling on unrelated machines to minimize completion time
4: Improved Lower Bound for Estimating the Number of Defective Items
5: A Tight Competitive Ratio for Online Submodular Welfare Maximization
6: Another virtue of wavelet forests?
7: Quantifying the Cost of Learning in Queueing Systems
8: A Nearly Quadratic-Time FPTAS for Knapsack
9: Tightest Admissible Shortest Path
10: A Floating-Point Secure Implementation of the Report Noisy Max with Gap Mechanism
11: A Quantum Approximation Scheme for k-Means
12: Approximation Algorithms for Norm Multiway Cut
13: Matching Patterns with Variables Under Simon’s Congruence
14: Non-monotone Sequential Submodular Maximization
15: Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
16: Approximating Min-Diameter: Standard and Bichromatic
17: Improved Approximation Algorithms for Steiner Connectivity Augmentation Problems
18: Real-Time Construction Algorithm of Co-Occurrence Network Based on Inverted Index
19: A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem
20: Mitigating Misinformation Spreading in Social Networks Via Edge Blocking
21: Computing complexity measures of degenerate graphs
22: Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius Form
23: Minimum Path Cover: The Power of Parameterization
24: Simpler Analyses of Union-Find
25: Algorithms and Computational Study on a Transportation System Integrating Public Transit and Ridesharing of Personal Vehicles
26: Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation
27: Greedy-Based Online Fair Allocation with Adversarial Input: Enabling Best-of-Many-Worlds Guarantees
28: ShockHash: Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
29: A scalable clustering algorithm to approximate graph cuts
30: On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPs
31: Near-linear time samplers for matroid independent sets with applications
32: Do you know what q-means?
33: Counting and Sampling Labeled Chordal Graphs in Polynomial Time
34: When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
35: Wheeler maps
36: Minimizing Carbon Footprint for Timely E-Truck Transportation: Hardness and Approximation Algorithm
37: Laminar Matroid Secretary: Greedy Strikes Back
38: Graph4J – A computationally efficient Java library for graph algorithms
39: Computing the Vapnik Chervonenkis Dimension for Non-Discrete Settings
40: Higher-Order Cheeger Inequality for Partitioning with Buffers
41: Improved Algorithms for Integer Complexity
42: Almost Tight Bounds for Differentially Private Densest Subgraph
43: Fair Rank Aggregation
44: Demand-Aware Network Design with Steiner Nodes and a Connection to Virtual Network Embedding
45: Fixed-Parameter Algorithms for Computing RAC Drawings of Graphs
46: Practical Parallel Algorithms for Non-Monotone Submodular Maximization
47: Parameterized Complexity of Fair Bisection: FPT-Approximation meets Unbreakability