default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd SOSA 2019: San Diego, CA, USA
- Jeremy T. Fineman, Michael Mitzenmacher:
2nd Symposium on Simplicity in Algorithms, SOSA 2019, January 8-9, 2019, San Diego, CA, USA. OASIcs 69, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-099-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:x
- Günter Rote:
Isotonic Regression by Dynamic Programming. 1:1-1:18 - Josh Alman:
An Illuminating Algorithm for the Light Bulb Problem. 2:1-2:11 - Sixue Liu, Robert E. Tarjan:
Simple Concurrent Labeling Algorithms for Connected Components. 3:1-3:20 - Dariusz Dereniowski, Stefan Tiegel, Przemyslaw Uznanski
, Daniel Wolleb-Graf:
A Framework for Searching in Graphs in the Presence of Errors. 4:1-4:17 - Haim Kaplan, László Kozma, Or Zamir, Uri Zwick:
Selection from Heaps, Row-Sorted Matrices, and X+Y Using Soft Heaps. 5:1-5:21 - Kent Quanrud:
Approximating Optimal Transport With Linear Programs. 6:1-6:9 - Chandra Chekuri, Kent Quanrud, Chao Xu:
LP Relaxation and Tree Packing for Minimum k-cuts. 7:1-7:18 - Stefan Felsner, Günter Rote:
On Primal-Dual Circle Representations. 8:1-8:18 - Luis Barba, Wolfgang Mulzer:
Asymmetric Convex Intersection Testing. 9:1-9:14 - Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi:
Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. 10:1-10:14 - Sepehr Assadi, Aaron Bernstein:
Towards a Unified Theory of Sparsification for Matching Problems. 11:1-11:20 - Guillaume Ducoffe:
A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters. 12:1-12:7 - Mohsen Ghaffari, David Wajc:
Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching. 13:1-13:8 - Michal Kotrbcík, Martin Skoviera:
Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph. 14:1-14:9 - Pasin Manurangsi:
A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation. 15:1-15:21 - Yi-Jun Chang, Wenyu Jin, Seth Pettie:
Simple Contention Resolution via Multiplicative Weight Updates. 16:1-16:16 - Ce Jin, Hongxun Wu:
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. 17:1-17:6 - Paul Liu, Jan Vondrák:
Submodular Optimization in the MapReduce Model. 18:1-18:10 - Sushrut Karmalkar, Eric Price:
Compressed Sensing with Adversarial Sparse Noise via L1 Regression. 19:1-19:19 - Jugal Garg, Peter McGlaughlin, Setareh Taki:
Approximating Maximin Share Allocations. 20:1-20:11
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-20 22:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
