Some Easy and Some Not So Easy Geometric Optimization Problems.- Deterministic Min-Cost Matching with Delays.- Sequential Metric Dimension.- A Primal-Dual Online Deterministic Algorithm for Matching with Delays.- Advice Complexity of Priority Algorithms.- Approximating Node-Weighted k-MST on Planar Graphs.- Exploring Sparse Graphs with Advice.- Call Admission Problems on Grids with Advice.- Improved Approximation Algorithms for Minimum Power Covering Problems.- DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals.- Strategic Contention Resolution in Multiple Channels.- Sublinear Graph Augmentation for Fast Query Implementation.- Bin Packing Games with Weight Decision: How To Get a Small Value for the Price of Anarchy.- Probabilistic Embeddings of the Fréchet Distance.- Algorithms for Dynamic NFV Workload.- Longest Increasing Subsequence under Persistent Comparison Errors.- Cut Sparsifiers for Balanced Digraphs.- Reconfigurationof Graphs with Connectivity Constraints.- The Itinerant List Update Problem.- The Price of Fixed Assignments in Stochastic Extensible Bin Packing.

GPSR Compliance The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this. If you have any concerns about our products you can contact us on ProductSafety@springernature.com. In case Publisher is established outside the EU, the EU authorized representative is: Springer Nature Customer Service Center GmbH Europaplatz 3 69115 Heidelberg, Germany ProductSafety@springernature.com