1: Termination of Multipartite Graph Series Arising from Complex Network Modelling
2: On the Termination of Some Biclique Operators on Multipartite Graphs
3: Quantum-accelerated constraint programming
4: Formal Verification of Authenticated, Append-Only Skip Lists in Agda: Extended Version
5: Online Directed Spanners and Steiner Forests
6: T-SCI: A Two-Stage Conformal Inference Algorithm with Guaranteed Coverage for Cox-MLP
7: A Fully Polynomial Parameterized Algorithm for Counting the Number of Reachable Vertices in a Digraph
8: The distance backbone of complex networks
9: Threshold-based Network Structural Dynamics
10: On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization
11: Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments
12: Dynamic Range Mode Enumeration
13: On the Complexity of the CSG Tree Extraction Problem
14: Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
15: Flow Time Scheduling with Uncertain Processing Time
16: Dory: Overcoming Barriers to Computing Persistent Homology
17: Improved upper bounds for the rigidity of Kronecker products
18: Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs
19: Quantum Algorithms in Cybernetics
20: Effectively Counting s-t Simple Paths in Directed Graphs
21: Bounds on half graph orders in powers of sparse graphs
22: A Lattice Linear Predicate Parallel Algorithm for the Dynamic Programming Problems
23: Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
24: Hitting minors on bounded treewidth graphs. III. Lower bounds
25: Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
26: Hardness of Token Swapping on Trees
27: Imagined-Trailing-Whitespace-Agnostic Levenshtein Distance For Plaintext Table Detection
28: Robust Lower Bounds for Graph Problems in the Blackboard Model of Communication
29: Sampling from the low temperature Potts model through a Markov chain on flows
30: Tight Competitive Analyses of Online Car-sharing Problems
31: On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization
32: Efficient estimation of Pauli observables by derandomization
33: K"{o}nigsberg Sightseeing: Eulerian Walks in Temporal Graphs