1: Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022
2: Fast Regression for Structured Inputs
3: Online Task Assignment Problems with Reusable Resources
4: Practical Detectability for Persistent Lock-Free Data Structures
5: On Comparable Box Dimension
6: Maximizing Modular plus Non-monotone Submodular Functions
7: Optimal mixing for two-state anti-ferromagnetic spin systems
8: Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves
9: Edge-based Local Push for Personalized PageRank
10: QUBOs for Sorting Lists and Building Trees
11: Quantum Parameterized Complexity
12: Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexity
13: Tight Lower Bounds for Approximate & Exact $k$-Center in $\mathbb{R}^d$
14: Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV
15: Minimum Height Drawings of Ordered Trees in Polynomial Time: Homotopy Height of Tree Duals
16: Short and local transformations between ($\Delta+1$)-colorings
17: Centrality Measures in multi-layer Knowledge Graphs
18: A flexible solution to embrace Ranking and Skyline queries approaches
19: FUSED-PAGERANK: Loop-Fusion based Approximate PageRank
20: Stronger 3SUM-Indexing Lower Bounds
21: Extremal Event Graphs: A (Stable) Tool for Analyzing Noisy Time Series Data
22: Triangle and Four Cycle Counting with Predictions in Graph Streams
23: Scheduling a single machine with compressible jobs to minimize maximum lateness
24: Exact approaches for the Connected Vertex Cover problem
25: Kernelization for Treewidth-2 Vertex Deletion
26: Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs
27: A Quantum Algorithm for Network Reliability
28: On Practical Nearest Sub-Trajectory Queries under the Fr'echet Distance
29: Red Domination in Perfect Elimination Bipartite Graphs
30: Scaling Up Maximal k-plex Enumeration
31: Coresets for Weight-Constrained Anisotropic Assignment and Clustering
32: Brooks’ Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\Delta$-Coloring