@Proceedings{fineman_et_al:OASIcs.SOSA.2019,
title = {{OASIcs, Volume 69, SOSA'19, Complete Volume}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019},
URN = {urn:nbn:de:0030-drops-101683},
doi = {10.4230/OASIcs.SOSA.2019},
annote = {Keywords: Theory of computation, Design and analysis of algorithms}
}
@InProceedings{fineman_et_al:OASIcs.SOSA.2019.0,
author = {Fineman, Jeremy T. and Mitzenmacher, Michael},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {0:i--0:x},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.0},
URN = {urn:nbn:de:0030-drops-100263},
doi = {10.4230/OASIcs.SOSA.2019.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{rote:OASIcs.SOSA.2019.1,
author = {Rote, G\"{u}nter},
title = {{Isotonic Regression by Dynamic Programming}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {1:1--1:18},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.1},
URN = {urn:nbn:de:0030-drops-100274},
doi = {10.4230/OASIcs.SOSA.2019.1},
annote = {Keywords: Convex functions, dynamic programming, convex hull, isotonic regression}
}
@InProceedings{alman:OASIcs.SOSA.2019.2,
author = {Alman, Josh},
title = {{An Illuminating Algorithm for the Light Bulb Problem}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {2:1--2:11},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.2},
URN = {urn:nbn:de:0030-drops-100289},
doi = {10.4230/OASIcs.SOSA.2019.2},
annote = {Keywords: Light Bulb Problem, Polynomial Method, Finding Correlations}
}
@InProceedings{liu_et_al:OASIcs.SOSA.2019.3,
author = {Liu, Sixue and Tarjan, Robert E.},
title = {{Simple Concurrent Labeling Algorithms for Connected Components}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {3:1--3:20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.3},
URN = {urn:nbn:de:0030-drops-100292},
doi = {10.4230/OASIcs.SOSA.2019.3},
annote = {Keywords: Connected Components, Concurrent Algorithms}
}
@InProceedings{dereniowski_et_al:OASIcs.SOSA.2019.4,
author = {Dereniowski, Dariusz and Tiegel, Stefan and Uznanski, Przemyslaw and Wolleb-Graf, Daniel},
title = {{A Framework for Searching in Graphs in the Presence of Errors}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {4:1--4:17},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.4},
URN = {urn:nbn:de:0030-drops-100305},
doi = {10.4230/OASIcs.SOSA.2019.4},
annote = {Keywords: graph algorithms, noisy binary search, query complexity, reliability}
}
@InProceedings{kaplan_et_al:OASIcs.SOSA.2019.5,
author = {Kaplan, Haim and Kozma, L\'{a}szl\'{o} and Zamir, Or and Zwick, Uri},
title = {{Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {5:1--5:21},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.5},
URN = {urn:nbn:de:0030-drops-100315},
doi = {10.4230/OASIcs.SOSA.2019.5},
annote = {Keywords: selection, soft heap}
}
@InProceedings{quanrud:OASIcs.SOSA.2019.6,
author = {Quanrud, Kent},
title = {{Approximating Optimal Transport With Linear Programs}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {6:1--6:9},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.6},
URN = {urn:nbn:de:0030-drops-100321},
doi = {10.4230/OASIcs.SOSA.2019.6},
annote = {Keywords: optimal transport, fast approximations, linear programming}
}
@InProceedings{chekuri_et_al:OASIcs.SOSA.2019.7,
author = {Chekuri, Chandra and Quanrud, Kent and Xu, Chao},
title = {{LP Relaxation and Tree Packing for Minimum k-cuts}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {7:1--7:18},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.7},
URN = {urn:nbn:de:0030-drops-100335},
doi = {10.4230/OASIcs.SOSA.2019.7},
annote = {Keywords: k-cut, LP relaxation, tree packing}
}
@InProceedings{felsner_et_al:OASIcs.SOSA.2019.8,
author = {Felsner, Stefan and Rote, G\"{u}nter},
title = {{On Primal-Dual Circle Representations}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {8:1--8:18},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.8},
URN = {urn:nbn:de:0030-drops-100349},
doi = {10.4230/OASIcs.SOSA.2019.8},
annote = {Keywords: Disk packing, planar graphs, contact representation}
}
@InProceedings{barba_et_al:OASIcs.SOSA.2019.9,
author = {Barba, Luis and Mulzer, Wolfgang},
title = {{Asymmetric Convex Intersection Testing}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {9:1--9:14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.9},
URN = {urn:nbn:de:0030-drops-100358},
doi = {10.4230/OASIcs.SOSA.2019.9},
annote = {Keywords: polytope intersection, LP-type problem, randomized algorithm}
}
@InProceedings{filtser_et_al:OASIcs.SOSA.2019.10,
author = {Filtser, Arnold and Krauthgamer, Robert and Trabelsi, Ohad},
title = {{Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {10:1--10:14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.10},
URN = {urn:nbn:de:0030-drops-100369},
doi = {10.4230/OASIcs.SOSA.2019.10},
annote = {Keywords: Clustering, Steiner point removal, Zero extension, Doubling dimension, Relaxed voronoi}
}
@InProceedings{assadi_et_al:OASIcs.SOSA.2019.11,
author = {Assadi, Sepehr and Bernstein, Aaron},
title = {{Towards a Unified Theory of Sparsification for Matching Problems}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {11:1--11:20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.11},
URN = {urn:nbn:de:0030-drops-100370},
doi = {10.4230/OASIcs.SOSA.2019.11},
annote = {Keywords: Maximum matching, matching sparsifiers, one-way communication complexity, stochastic matching, fault-tolerant matching}
}
@InProceedings{ducoffe:OASIcs.SOSA.2019.12,
author = {Ducoffe, Guillaume},
title = {{A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {12:1--12:7},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.12},
URN = {urn:nbn:de:0030-drops-100383},
doi = {10.4230/OASIcs.SOSA.2019.12},
annote = {Keywords: Graph diameter, Orthogonal Range Queries, Hardness in P, FPT in P}
}
@InProceedings{ghaffari_et_al:OASIcs.SOSA.2019.13,
author = {Ghaffari, Mohsen and Wajc, David},
title = {{Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {13:1--13:8},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.13},
URN = {urn:nbn:de:0030-drops-100396},
doi = {10.4230/OASIcs.SOSA.2019.13},
annote = {Keywords: Streaming, Semi-Streaming, Space-Optimal, Matching}
}
@InProceedings{kotrbcik_et_al:OASIcs.SOSA.2019.14,
author = {Kotrbc{\'\i}k, Michal and Skoviera, Martin},
title = {{Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {14:1--14:9},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.14},
URN = {urn:nbn:de:0030-drops-100409},
doi = {10.4230/OASIcs.SOSA.2019.14},
annote = {Keywords: maximum genus, embedding, graph, greedy algorithm}
}
@InProceedings{manurangsi:OASIcs.SOSA.2019.15,
author = {Manurangsi, Pasin},
title = {{A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {15:1--15:21},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.15},
URN = {urn:nbn:de:0030-drops-100417},
doi = {10.4230/OASIcs.SOSA.2019.15},
annote = {Keywords: Maximum k-Vertex Cover, Minimum k-Vertex Cover, Approximation Algorithms, Fixed Parameter Algorithms, Approximate Kernelization}
}
@InProceedings{chang_et_al:OASIcs.SOSA.2019.16,
author = {Chang, Yi-Jun and Jin, Wenyu and Pettie, Seth},
title = {{Simple Contention Resolution via Multiplicative Weight Updates}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {16:1--16:16},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.16},
URN = {urn:nbn:de:0030-drops-100426},
doi = {10.4230/OASIcs.SOSA.2019.16},
annote = {Keywords: Contention resolution, multiplicative weight update method}
}
@InProceedings{jin_et_al:OASIcs.SOSA.2019.17,
author = {Jin, Ce and Wu, Hongxun},
title = {{A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {17:1--17:6},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.17},
URN = {urn:nbn:de:0030-drops-100436},
doi = {10.4230/OASIcs.SOSA.2019.17},
annote = {Keywords: subset sum, formal power series, FFT}
}
@InProceedings{liu_et_al:OASIcs.SOSA.2019.18,
author = {Liu, Paul and Vondrak, Jan},
title = {{Submodular Optimization in the MapReduce Model}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {18:1--18:10},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.18},
URN = {urn:nbn:de:0030-drops-100447},
doi = {10.4230/OASIcs.SOSA.2019.18},
annote = {Keywords: mapreduce, submodular, optimization, approximation algorithms}
}
@InProceedings{karmalkar_et_al:OASIcs.SOSA.2019.19,
author = {Karmalkar, Sushrut and Price, Eric},
title = {{Compressed Sensing with Adversarial Sparse Noise via L1 Regression}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {19:1--19:19},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.19},
URN = {urn:nbn:de:0030-drops-100455},
doi = {10.4230/OASIcs.SOSA.2019.19},
annote = {Keywords: Robust Regression, Compressed Sensing}
}
@InProceedings{garg_et_al:OASIcs.SOSA.2019.20,
author = {Garg, Jugal and McGlaughlin, Peter and Taki, Setareh},
title = {{Approximating Maximin Share Allocations}},
booktitle = {2nd Symposium on Simplicity in Algorithms (SOSA 2019)},
pages = {20:1--20:11},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-099-6},
ISSN = {2190-6807},
year = {2019},
volume = {69},
editor = {Fineman, Jeremy T. and Mitzenmacher, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.20},
URN = {urn:nbn:de:0030-drops-100465},
doi = {10.4230/OASIcs.SOSA.2019.20},
annote = {Keywords: Fair division, Maximin share, Approximation algorithm}
}
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