1: Efficient parameterized algorithms for computing all-pairs shortest paths
2: Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution
3: Tight Static Lower Bounds for Non-Adaptive Data Structures
4: An Efficient and Wear-Leveling-Aware Frequent-Pattern Mining on Non-Volatile Memory
5: A color-avoiding approach to subgraph counting in bounded expansion classes
6: Optimal Skeleton Huffman Trees Revisited
7: Computationally easy, spectrally good multipliers for congruential pseudorandom number generators
8: Correlation decay for hard spheres via Markov chains
9: Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space
10: Improvement of an Approximated Self-Improving Sorter and Error Analysis of its Estimated Entropy
11: Faster STR-EC-LCS Computation
12: Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees
13: Generalised Pattern Matching Revisited
14: Elements of Scheduling
15: A New Fairness Model based on User’s Objective for Multi-user Multi-processor Online Scheduling
16: Grover’s Algorithm and Many-Valued Quantum Logic
17: Lower density selection schemes via small universal hitting sets with short remaining path length
18: Counting difficult tree pairs with respect to the rotation distance problem
19: An efficient sampling algorithm for difficult tree pairs
20: Circllhist – A Log-Linear Histogram Data Structure for IT Infrastructure Monitoring
21: RCELF: A Residual-based Approach for Influence Maximization Problem
22: Computing the probability of gene trees concordant with the species tree in the multispecies coalescent
23: The Power of Pivoting for Exact Clique Counting
24: Dynamic Weighted Fairness with Minimal Disruptions
25: Chaining with overlaps revisited
26: A survey of parameterized algorithms and the complexity of edge modification
27: 75,000,000,000 Streaming Inserts/Second Using Hierarchical Hypersparse GraphBLAS Matrices
28: Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover
29: A 2-Competitive Largest Job on Least Loaded Machine Online Algorithm based on Multi Lists Scheduling Model
30: High-Quality Hierarchical Process Mapping
31: Finding path motifs in large temporal graphs using algebraic fingerprints
32: A node-charge graph-based online carshare rebalancing policy with capacitated electric charging
33: Near-Additive Spanners and Near-Exact Hopsets, A Unified View