default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 13
Volume 13, Number 1, December 2016
- Ravishankar Krishnaswamy, Maxim Sviridenko:
Inapproximability of the Multilevel Uncapacitated Facility Location Problem. 1:1-1:25 - Per Austrin, Siavosh Benabbas, Konstantinos Georgiou:
Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection. 2:1-2:27 - Pankaj K. Agarwal, Boris Aronov
, Sariel Har-Peled, Jeff M. Phillips, Ke Yi, Wuzhou Zhang:
Nearest-Neighbor Searching Under Uncertainty II. 3:1-3:25 - Andrew Shallue:
Tabulating Pseudoprimes and Tabulating Liars. 4:1-4:14 - Ken-ichi Kawarabayashi, Yusuke Kobayashi:
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two. 5:1-5:17 - Yuval Emek, Adi Rosén:
Semi-Streaming Set Cover. 6:1-6:22 - Edith Cohen, Graham Cormode, Nick G. Duffield, Carsten Lund:
On the Tradeoff between Stability and Fit. 7:1-7:24 - Martin Aumüller, Martin Dietzfelbinger, Pascal Klaue:
How Good Is Multi-Pivot Quicksort? 8:1-8:47 - Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, Nikos Parotsidis:
2-Edge Connectivity in Directed Graphs. 9:1-9:24 - Matthias Englert, Heiko Röglin, Berthold Vöcking:
Smoothed Analysis of the 2-Opt Algorithm for the General TSP. 10:1-10:15 - Merav Parter, David Peleg:
Sparse Fault-Tolerant BFS Structures. 11:1-11:24 - Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann:
Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal. 12:1-12:32 - Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan:
Minimum Latency Submodular Cover. 13:1-13:28 - Robert Krauthgamer, Tal Wagner:
Cheeger-Type Approximation for Sparsest st-Cut. 14:1-14:21 - Elisabeth Lübbecke, Olaf Maurer, Nicole Megow, Andreas Wiese:
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio. 15:1-15:34 - Maxim A. Babenko, Andrew V. Goldberg, Anupam Gupta, Viswanath Nagarajan:
Algorithms for Hub Label Optimization. 16:1-16:17 - David G. Harris:
Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided Lovász Local Lemma. 17:1-17:26
Volume 13, Number 2, May 2017
- Alexandr Andoni, Debmalya Panigrahi, Marcin Pilipczuk:
Editorial. 18:1 - Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn:
Tight Bounds on Vertex Connectivity Under Sampling. 19:1-19:26 - Deeparnab Chakrabarty, Kashyap Dixit, Madhav Jha, C. Seshadhri:
Property Testing on Product Distributions: Optimal Testers for Bounded Derivative Properties. 20:1-20:30 - Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson:
Dynamic Facility Location via Exponential Clocks. 21:1-21:20 - Shi Li:
On Uniform Capacitated k-Median Beyond the Natural LP Relaxation. 22:1-22:18 - Jaroslaw Byrka, Thomas W. Pensyl, Bartosz Rybicki, Aravind Srinivasan, Khoa Trinh:
An Improved Approximation for k-Median and Positive Correlation in Budgeted Optimization. 23:1-23:31
- Axel Bacher, Olivier Bodini, Hsien-Kuei Hwang, Tsung-Hsi Tsai:
Generating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation. 24:1-24:43 - Michael Etscheid, Heiko Röglin:
Smoothed Analysis of Local Search for the Maximum-Cut Problem. 25:1-25:12 - Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir:
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. 26:1-26:42 - Siu-Wing Cheng, Jiongxin Jin, Man-Kit Lau:
A Fast and Simple Surface Reconstruction Algorithm. 27:1-27:30 - Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao:
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries. 28:1-28:31 - Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting. 29:1-29:32
Volume 13, Number 3, August 2017
- Keren Cohavi, Shahar Dobzinski:
Faster and Simpler Sketches of Valuation Functions. 30:1-30:9 - Christian Glacet, Avery Miller, Andrzej Pelc:
Time vs. Information Tradeoffs for Leader Election in Anonymous Trees. 31:1-31:41 - Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-All Sparse Recovery in Near-Optimal Time. 32:1-32:26 - David G. Harris, Aravind Srinivasan:
Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution. 33:1-33:40 - Mahdi Cheraghchi, Piotr Indyk:
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. 34:1-34:36 - Archontia C. Giannopoulou, Bart M. P. Jansen, Daniel Lokshtanov, Saket Saurabh:
Uniform Kernelization Complexity of Hitting Forbidden Minors. 35:1-35:35 - Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Representative Families of Product Families. 36:1-36:29 - Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson:
Combinatorial Algorithm for Restricted Max-Min Fair Allocation. 37:1-37:28 - Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Storage Reallocation. 38:1-38:20 - Moran Feldman:
Maximizing Symmetric Submodular Functions. 39:1-39:36 - Michael Dinitz, Guy Kortsarz, Zeev Nutov:
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. 40:1-40:16 - Allan Borodin, Aadhar Jain, Hyun Chul Lee, Yuli Ye:
Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates. 41:1-41:25 - Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, Uri Zwick:
Hollow Heaps. 42:1-42:27 - Marek Cygan, Fabrizio Grandoni, Danny Hermelin:
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy. 43:1-43:22
Volume 13, Number 4, December 2017
- Serge Gaspers, Gregory B. Sorkin:
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets. 44:1-44:36 - Harold N. Gabow:
A Data Structure for Nearest Common Ancestors with Linking. 45:1-45:28 - M. S. Ramanujan, Saket Saurabh:
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts. 46:1-46:25 - Hsien-Kuei Hwang, Svante Janson, Tsung-Hsi Tsai:
Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications. 47:1-47:43 - Andreas Björklund, Petteri Kaski, Lukasz Kowalik:
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time. 48:1-48:26 - Takuro Fukunaga:
Spider Covers for Prize-Collecting Network Activation Problem. 49:1-49:31 - Elaine Shi, T.-H. Hubert Chan, Eleanor Gilbert Rieffel, Dawn Song:
Distributed Private Data Analysis: Lower Bounds and Practical Constructions. 50:1-50:38 - Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks. 51:1-51:24 - Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, Amin Saberi:
Approximation Algorithms for Computing Maximin Share Allocations. 52:1-52:28 - Bernhard Haeupler, David G. Harris:
Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs. 53:1-53:25 - Konstantin Makarychev, Maxim Sviridenko:
Maximizing Polynomials Subject to Assignment Constraints. 54:1-54:15 - Amr Elmasry:
Toward Optimal Self-Adjusting Heaps. 55:1-55:14
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-12-04 01:29 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:
