1: Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters
2: Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets
3: Distributed Testing of Conductance
4: Parallel Accelerated Vector Similarity Calculations for Genomics Applications
5: Parallel Accelerated Custom Correlation Coefficient Calculations for Genomics Applications
6: Randomized Composable Coresets for Matching and Vertex Cover
7: Optimization in large graphs: Toward a better future?
8: Algorithms and hardness results for happy coloring problems
9: Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers
10: Efficient Coalgebraic Partition Refinement
11: On The Multiparty Communication Complexity of Testing Triangle-Freeness
12: A study on exponential-size neighborhoods for the bin packing problem with conflicts
13: Representing the suffix tree with the CDAWG
14: Combinatorial n-fold Integer Programming and Applications
15: Fast algorithms for anti-distance matrices as a generalization of Boolean matrices
16: Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-Linear Chaining Extended
17: A Two-Level Graph Partitioning Problem Arising in Mobile Wireless Communications
18: Linearizable Iterators for Concurrent Sets
19: Matroids Hitting Sets and Unsupervised Dependency Grammar Induction
20: Triangle Finding and Listing in CONGEST Networks
21: On the (parameterized) complexity of recognizing well-covered (r,l)-graphs
22: Is Our Model for Contention Resolution Wrong?
23: Overcommitment in Cloud Services – Bin packing with Chance Constraints
24: Shared Memory Parallel Subgraph Enumeration
25: Duel and sweep algorithm for order-preserving pattern matching
26: New Variants of Pattern Matching with Constants and Variables
27: On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation
28: Approximating Constrained Minimum Cost Input-Output Selection for Generic Arbitrary Pole Placement in Structured Systems
29: Distributed Dominating Set Approximations beyond Planar Graphs
30: Gossip in a Smartphone Peer-to-Peer Network
31: Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
32: Multiresolution Priority Queues
33: A greedy approximation algorithm for the minimum (2,2)-connected dominating set problem
34: Multi-scale Online Learning and its Applications to Online Auctions
35: Linear-size CDAWG: new repetition-aware indexing and grammar compression
36: Half-quadratic transportation problems
37: Universal Protocols for Information Dissemination Using Emergent Signals