1: Path-contractions, edge deletions and connectivity preservation
2: Revisiting wireless network jamming by SIR-based considerations and Multiband Robust Optimization
3: GUB Covers and Power-Indexed formulations for Wireless Network Design
4: Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time
5: Shifting the Phase Transition Threshold for Random Graphs and 2-SAT using Degree Constraints
6: A hybrid exact-ACO algorithm for the joint scheduling, power and cluster assignment in cooperative wireless networks
7: Continuous monitoring of $\ell_p$ norms in data streams
8: Complexity Analysis of the Parallel Guided Ejection Search for the Pickup and Delivery Problem with Time Windows
9: Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
10: Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
11: Adaptive Cuckoo Filters
12: A Decomposition Algorithm to Solve the Multi-Hop Peer-to-Peer Ride-Matching Problem
13: Ranking with Fairness Constraints
14: A hybrid primal heuristic for Robust Multiperiod Network Design
15: Testing Symmetric Markov Chains from a Single Trajectory
16: Algorithms for Covering Multiple Barriers
17: An exact algorithm exhibiting RS-RSB/easy-hard correspondence for the maximum independent set problem
18: Multiple Source Dual Fault Tolerant BFS Trees
19: A New Fully Polynomial Time Approximation Scheme for the Interval Subset Sum Problem
20: A Match in Time Saves Nine: Deterministic Online Matching With Delays
21: Rerouting flows when links fail
22: Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete
23: Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs
24: Hitting minors on bounded treewidth graphs. I. General upper bounds
25: Elite Bases Regression: A Real-time Algorithm for Symbolic Regression
26: Sampling Biased Monotonic Surfaces using Exponential Metrics
27: Metropolis-Hastings Algorithms for Estimating Betweenness Centrality in Large Networks
28: Strictly Balancing Matrices in Polynomial Time Using Osborne’s Iteration
29: GaKCo: a Fast GApped k-mer string Kernel using COunting
30: Covering Uncertain Points in a Tree
31: Popular Matching with Lower Quotas
32: Indexing Weighted Sequences: Neat and Efficient
33: Single-Pass PCA of Large High-Dimensional Data
34: An efficient data structure for counting all linear extensions of a poset, calculating its jump number, and the likes
35: Succinct Approximate Rank Queries
36: Event Stream-Based Process Discovery using Abstract Representations
37: Concave Flow on Small Depth Directed Networks
38: Sub-string/Pattern Matching in Sub-linear Time Using a Sparse Fourier Transform Approach
39: Exact Algorithms via Multivariate Subroutines
40: A Framework for Algorithm Stability
41: Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs
42: Decremental Data Structures for Connectivity and Dominators in Directed Graphs
43: Relative Error Tensor Low Rank Approximation
44: An Improved Bound for Minimizing the Total Weighted Completion Time of Coflows in Datacenters
45: Improved Oracles for Time-Dependent Road Networks
46: Communication complexity of approximate maximum matching in the message-passing model
47: Linear-Size Hopsets with Small Hopbound, and Distributed Routing with Low Memory
48: An Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems
49: A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry
50: Practical and Effective Re-Pair Compression
51: Faster Betweenness Centrality Updates in Evolving Networks
52: Improved approximation algorithm for the Dense-3-Subhypergraph Problem
53: An Improved Integrality Gap for Steiner Tree
54: Matrix Completion and Related Problems via Strong Duality
55: Relaxing the Irrevocability Requirement for Online Graph Algorithms
56: On 1-factorizations of Bipartite Kneser Graphs
57: Structural Parameters, Tight Bounds, and Approximation for (k,r)-Center