HTML Export for SOSA 2018

Copy to Clipboard Download

<h2>OASIcs, Volume 61, SOSA 2018</h2>
<ul>
<li>
    <span class="authors">Raimund Seidel</span>
    <span class="title">OASIcs, Volume 61, SOSA&#039;18, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018">10.4230/OASIcs.SOSA.2018</a>
</li>
<li>
    <span class="authors">Raimund Seidel</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.0">10.4230/OASIcs.SOSA.2018.0</a>
</li>
<li>
    <span class="authors">Yixin Cao</span>
    <span class="title">A Naive Algorithm for Feedback Vertex Set</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.1">10.4230/OASIcs.SOSA.2018.1</a>
</li>
<li>
    <span class="authors">Chandra Chekuri and Thapanapong Rukkanchanunt</span>
    <span class="title">A Note on Iterated Rounding for the Survivable Network Design Problem</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.2">10.4230/OASIcs.SOSA.2018.2</a>
</li>
<li>
    <span class="authors">Chandra Chekuri and Mark Idleman</span>
    <span class="title">Congestion Minimization for Multipath Routing via Multiroute Flows</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.3">10.4230/OASIcs.SOSA.2018.3</a>
</li>
<li>
    <span class="authors">Deeparnab Chakrabarty and Sanjeev Khanna</span>
    <span class="title">Better and Simpler Error Analysis of the  Sinkhorn-Knopp Algorithm for Matrix Scaling</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.4">10.4230/OASIcs.SOSA.2018.4</a>
</li>
<li>
    <span class="authors">Timothy M. Chan</span>
    <span class="title">Approximation Schemes for 0-1 Knapsack</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.5">10.4230/OASIcs.SOSA.2018.5</a>
</li>
<li>
    <span class="authors">R. Ryan Williams</span>
    <span class="title">Counting Solutions to Polynomial Systems via Reductions</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.6">10.4230/OASIcs.SOSA.2018.6</a>
</li>
<li>
    <span class="authors">Talya Eden and Will Rosenbaum</span>
    <span class="title">On Sampling Edges Almost Uniformly</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.7">10.4230/OASIcs.SOSA.2018.7</a>
</li>
<li>
    <span class="authors">Allan Borodin, Denis Pankratov, and Amirali Salehi-Abari</span>
    <span class="title">A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.8">10.4230/OASIcs.SOSA.2018.8</a>
</li>
<li>
    <span class="authors">Petra Berenbrink, Dominik Kaaser, Peter Kling, and Lena Otterbach</span>
    <span class="title">Simple and Efficient Leader Election</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.9">10.4230/OASIcs.SOSA.2018.9</a>
</li>
<li>
    <span class="authors">Tsvi Kopelowitz and Ely Porat</span>
    <span class="title">A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.10">10.4230/OASIcs.SOSA.2018.10</a>
</li>
<li>
    <span class="authors">Klaus Jansen and Lars Rohwedder</span>
    <span class="title">Compact LP Relaxations for Allocation Problems</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.11">10.4230/OASIcs.SOSA.2018.11</a>
</li>
<li>
    <span class="authors">Divesh Aggarwal and Noah Stephens-Davidowitz</span>
    <span class="title">Just Take the Average! An Embarrassingly Simple 2^n-Time Algorithm for SVP (and CVP)</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.12">10.4230/OASIcs.SOSA.2018.12</a>
</li>
<li>
    <span class="authors">Alantha Newman</span>
    <span class="title">Complex Semidefinite Programming and Max-k-Cut</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.13">10.4230/OASIcs.SOSA.2018.13</a>
</li>
<li>
    <span class="authors">Andrew McGregor and Sofya Vorotnikova</span>
    <span class="title">A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.14">10.4230/OASIcs.SOSA.2018.14</a>
</li>
<li>
    <span class="authors">Michael B. Cohen, T.S. Jayram, and Jelani Nelson</span>
    <span class="title">Simple Analyses of the Sparse Johnson-Lindenstrauss Transform</span>
    <a class="doi" href="https://doi.org/10.4230/OASIcs.SOSA.2018.15">10.4230/OASIcs.SOSA.2018.15</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