<h2>OASIcs, Volume 69, SOSA 2019</h2>
<ul>
<li>
<span class="authors">Jeremy T. Fineman and Michael Mitzenmacher</span>
<span class="title">OASIcs, Volume 69, SOSA'19, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019">10.4230/OASIcs.SOSA.2019</a>
</li>
<li>
<span class="authors">Jeremy T. Fineman and Michael Mitzenmacher</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.0">10.4230/OASIcs.SOSA.2019.0</a>
</li>
<li>
<span class="authors">Günter Rote</span>
<span class="title">Isotonic Regression by Dynamic Programming</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.1">10.4230/OASIcs.SOSA.2019.1</a>
</li>
<li>
<span class="authors">Josh Alman</span>
<span class="title">An Illuminating Algorithm for the Light Bulb Problem</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.2">10.4230/OASIcs.SOSA.2019.2</a>
</li>
<li>
<span class="authors">Sixue Liu and Robert E. Tarjan</span>
<span class="title">Simple Concurrent Labeling Algorithms for Connected Components</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.3">10.4230/OASIcs.SOSA.2019.3</a>
</li>
<li>
<span class="authors">Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski, and Daniel Wolleb-Graf</span>
<span class="title">A Framework for Searching in Graphs in the Presence of Errors</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.4">10.4230/OASIcs.SOSA.2019.4</a>
</li>
<li>
<span class="authors">Haim Kaplan, László Kozma, Or Zamir, and Uri Zwick</span>
<span class="title">Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.5">10.4230/OASIcs.SOSA.2019.5</a>
</li>
<li>
<span class="authors">Kent Quanrud</span>
<span class="title">Approximating Optimal Transport With Linear Programs</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.6">10.4230/OASIcs.SOSA.2019.6</a>
</li>
<li>
<span class="authors">Chandra Chekuri, Kent Quanrud, and Chao Xu</span>
<span class="title">LP Relaxation and Tree Packing for Minimum k-cuts</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.7">10.4230/OASIcs.SOSA.2019.7</a>
</li>
<li>
<span class="authors">Stefan Felsner and Günter Rote</span>
<span class="title">On Primal-Dual Circle Representations</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.8">10.4230/OASIcs.SOSA.2019.8</a>
</li>
<li>
<span class="authors">Luis Barba and Wolfgang Mulzer</span>
<span class="title">Asymmetric Convex Intersection Testing</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.9">10.4230/OASIcs.SOSA.2019.9</a>
</li>
<li>
<span class="authors">Arnold Filtser, Robert Krauthgamer, and Ohad Trabelsi</span>
<span class="title">Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.10">10.4230/OASIcs.SOSA.2019.10</a>
</li>
<li>
<span class="authors">Sepehr Assadi and Aaron Bernstein</span>
<span class="title">Towards a Unified Theory of Sparsification for Matching Problems</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.11">10.4230/OASIcs.SOSA.2019.11</a>
</li>
<li>
<span class="authors">Guillaume Ducoffe</span>
<span class="title">A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.12">10.4230/OASIcs.SOSA.2019.12</a>
</li>
<li>
<span class="authors">Mohsen Ghaffari and David Wajc</span>
<span class="title">Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.13">10.4230/OASIcs.SOSA.2019.13</a>
</li>
<li>
<span class="authors">Michal Kotrbcík and Martin Skoviera</span>
<span class="title">Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.14">10.4230/OASIcs.SOSA.2019.14</a>
</li>
<li>
<span class="authors">Pasin Manurangsi</span>
<span class="title">A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.15">10.4230/OASIcs.SOSA.2019.15</a>
</li>
<li>
<span class="authors">Yi-Jun Chang, Wenyu Jin, and Seth Pettie</span>
<span class="title">Simple Contention Resolution via Multiplicative Weight Updates</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.16">10.4230/OASIcs.SOSA.2019.16</a>
</li>
<li>
<span class="authors">Ce Jin and Hongxun Wu</span>
<span class="title">A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.17">10.4230/OASIcs.SOSA.2019.17</a>
</li>
<li>
<span class="authors">Paul Liu and Jan Vondrak</span>
<span class="title">Submodular Optimization in the MapReduce Model</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.18">10.4230/OASIcs.SOSA.2019.18</a>
</li>
<li>
<span class="authors">Sushrut Karmalkar and Eric Price</span>
<span class="title">Compressed Sensing with Adversarial Sparse Noise via L1 Regression</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.19">10.4230/OASIcs.SOSA.2019.19</a>
</li>
<li>
<span class="authors">Jugal Garg, Peter McGlaughlin, and Setareh Taki</span>
<span class="title">Approximating Maximin Share Allocations</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2019.20">10.4230/OASIcs.SOSA.2019.20</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing