OASIcs, Volume 69, SOSA 2019

• Jeremy T. Fineman and Michael Mitzenmacher OASIcs, Volume 69, SOSA'19, Complete Volume 10.4230/OASIcs.SOSA.2019
• Jeremy T. Fineman and Michael Mitzenmacher Front Matter, Table of Contents, Preface, Conference Organization 10.4230/OASIcs.SOSA.2019.0
• Günter Rote Isotonic Regression by Dynamic Programming 10.4230/OASIcs.SOSA.2019.1
• Josh Alman An Illuminating Algorithm for the Light Bulb Problem 10.4230/OASIcs.SOSA.2019.2
• Sixue Liu and Robert E. Tarjan Simple Concurrent Labeling Algorithms for Connected Components 10.4230/OASIcs.SOSA.2019.3
• Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, and Daniel Wolleb-Graf A Framework for Searching in Graphs in the Presence of Errors 10.4230/OASIcs.SOSA.2019.4
• Haim Kaplan, László Kozma, Or Zamir, and Uri Zwick Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps 10.4230/OASIcs.SOSA.2019.5
• Kent Quanrud Approximating Optimal Transport With Linear Programs 10.4230/OASIcs.SOSA.2019.6
• Chandra Chekuri, Kent Quanrud, and Chao Xu LP Relaxation and Tree Packing for Minimum k-cuts 10.4230/OASIcs.SOSA.2019.7
• Stefan Felsner and Günter Rote On Primal-Dual Circle Representations 10.4230/OASIcs.SOSA.2019.8
• Luis Barba and Wolfgang Mulzer Asymmetric Convex Intersection Testing 10.4230/OASIcs.SOSA.2019.9
• Arnold Filtser, Robert Krauthgamer, and Ohad Trabelsi Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems 10.4230/OASIcs.SOSA.2019.10
• Sepehr Assadi and Aaron Bernstein Towards a Unified Theory of Sparsification for Matching Problems 10.4230/OASIcs.SOSA.2019.11
• Guillaume Ducoffe A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters 10.4230/OASIcs.SOSA.2019.12
• Mohsen Ghaffari and David Wajc Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching 10.4230/OASIcs.SOSA.2019.13
• Michal Kotrbcík and Martin Skoviera Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph 10.4230/OASIcs.SOSA.2019.14
• Pasin Manurangsi A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation 10.4230/OASIcs.SOSA.2019.15
• Yi-Jun Chang, Wenyu Jin, and Seth Pettie Simple Contention Resolution via Multiplicative Weight Updates 10.4230/OASIcs.SOSA.2019.16
• Ce Jin and Hongxun Wu A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum 10.4230/OASIcs.SOSA.2019.17
• Paul Liu and Jan Vondrak Submodular Optimization in the MapReduce Model 10.4230/OASIcs.SOSA.2019.18
• Sushrut Karmalkar and Eric Price Compressed Sensing with Adversarial Sparse Noise via L1 Regression 10.4230/OASIcs.SOSA.2019.19
• Jugal Garg, Peter McGlaughlin, and Setareh Taki Approximating Maximin Share Allocations 10.4230/OASIcs.SOSA.2019.20