1: The Search and Rescue Game on a Cycle
2: Online Decentralized Frank-Wolfe: From theoretical bound to applications in smart-building
3: Learning to generate Reliable Broadcast Algorithms
4: A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
5: An Approximate Generalization of the Okamura-Seymour Theorem
6: Revisiting Information Cascades in Online Social Networks
7: Reduction Rules and ILP Are All You Need: Minimal Directed Feedback Vertex Set
8: Bias Reduction for Sum Estimation
9: Lattice Linear Predicate Algorithms for the Constrained Stable Marriage Problem with Ties
10: Unimodal Mono-Partite Matching in a Bandit Setting
11: UniRank: Unimodal Bandit Algorithm for Online Ranking
12: A Tighter Analysis of Spectral Clustering, and Beyond
13: An Algorithm for Ennola’s Second Theorem and Counting Smooth Numbers in Practice
14: Maximum Minimal Feedback Vertex Set: A Parameterized Perspective
15: OrderedCuts: A new approach for computing Gomory-Hu tree
16: A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals
17: Core Challenge 2022: Solver and Graph Descriptions
18: Exploring Computational Complexity Of Ride-Pooling Problems
19: Parameterized Complexity of Upper Edge Domination
20: Nearly Optimal Communication and Query Complexity of Bipartite Matching
21: Efficiently Computing Directed Minimum Spanning Trees
22: Makespan Scheduling of Unit Jobs with Precedence Constraints in $O(1.995^n)$ time
23: Agnostic Learning of General ReLU Activation Using Gradient Descent
24: Almost Consistent Systems of Linear Equations
25: An online joint replenishment problem combined with single machine scheduling
26: More Effort Towards Multiagent Knapsack
27: Domination and Cut Problems on Chordal Graphs with Bounded Leafage
28: Improved Bounds for Rectangular Monotone Min-Plus Product and Applications
29: Towards Fast Theta-join: A Prefiltering and Amalgamated Partitioning Approach
30: Offensive Alliances in Graphs
31: Jumping Evaluation of Nested Regular Path Queries
32: A PTAS for Minimizing Weighted Flow Time on a Single Machine
33: A Tight Analysis of Hutchinson’s Diagonal Estimator
34: Approximation algorithms for covering vertices by long paths
35: Active Learning for Non-Parametric Choice Models
36: Sublinear Time Algorithm for Online Weighted Bipartite Matching
37: Fast detection of specific fragments against a set of sequences
38: Parameterized Algorithms for Locally Minimal Defensive Alliance
39: Implementing Window Functions in a Column-Store with Late Materialization (Extended Version)
40: Fast O_{expected}(N) Algorithm for Finding Exact Maximum Distance in E^2 Instead of O(N^2) or O(N lg N)