Dynamic Facility Location via Exponential Clocks

JOURNAL ARTICLE published 30 April 2017 in ACM Transactions on Algorithms

Research funded by ERC Starting (335288-OptApprox) | Korea government (2016R1C1B1012910)

Authors: Hyung-Chan An | Ashkan Norouzi-Fard | Ola Svensson

Approximating Spanners and Directed Steiner Forest

JOURNAL ARTICLE published 31 July 2020 in ACM Transactions on Algorithms

Research funded by National Science Foundation (1464239, 1535887, 1218620, 1540547, 1910565) | Israel Science Foundation (1002/14,621/12) | Israeli Centers for Research Excellence (4/11)

Authors: Eden Chlamtáč | Michael Dinitz | Guy Kortsarz | Bundit Laekhanukit

Hausdorff distance under translation for points and balls

JOURNAL ARTICLE published August 2010 in ACM Transactions on Algorithms

Research funded by National Science Foundation (EIA-98-70724EIA-99-72879ITR-333-1050CCR-97-32787CCR-00-86013CCR-01-32901CCR-97-32101CCR-00-98246ITR-333-1050CCR-02-04118) | U.S. Department of Energy (DE-FG02-06ER25735)

Authors: Pankaj K. Agarwal | Sariel Har-Peled | Micha Sharir | Yusu Wang

A data structure for a sequence of string accesses in external memory

JOURNAL ARTICLE published February 2007 in ACM Transactions on Algorithms

Authors: Valentina Ciriani | Paolo Ferragina | Fabrizio Luccio | S. Muthukrishnan

For-All Sparse Recovery in Near-Optimal Time

JOURNAL ARTICLE published 31 July 2017 in ACM Transactions on Algorithms

Research funded by DARPA/ONR (N66001-08-1-2065) | NSF CCF (0743372)

Authors: Anna C. Gilbert | Yi Li | Ely Porat | Martin J. Strauss

On the query complexity of testing orientations for being Eulerian

JOURNAL ARTICLE published April 2012 in ACM Transactions on Algorithms

Research funded by European Research Council (202405-2) | Israel Science Foundation (1101/06)

Authors: Eldar Fischer | Oded Lachish | Arie Matsliah | Ilan Newman | Orly Yahalom

Testing Properties of Sparse Images

JOURNAL ARTICLE published August 2014 in ACM Transactions on Algorithms

Research funded by Israel Science Foundation (246/08)

Authors: Dana Ron | Gilad Tsur

Skip graphs

JOURNAL ARTICLE published November 2007 in ACM Transactions on Algorithms

Authors: James Aspnes | Gauri Shah

Deterministic Algorithms for Submodular Maximization Problems

JOURNAL ARTICLE published 31 July 2018 in ACM Transactions on Algorithms

Research funded by BSF (2014414) | ERC (335288-OptApprox) | ISF (1585/15 and 1357/16)

Authors: Niv Buchbinder | Moran Feldman

Faster approximation schemes for fractional multicommodity flow problems

JOURNAL ARTICLE published March 2008 in ACM Transactions on Algorithms

Authors: George Karakostas

Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs

JOURNAL ARTICLE published 31 October 2018 in ACM Transactions on Algorithms

Research funded by H2020 European Research Council (714704 and 677651) | FP7 Ideas: European Research Council (259515 and 267959)

Authors: Marcin Pilipczuk | Michał Pilipczuk | Piotr Sankowski | Erik Jan Van Leeuwen

Faster Parameterized Algorithms Using Linear Programming

JOURNAL ARTICLE published 17 November 2014 in ACM Transactions on Algorithms

Authors: Daniel Lokshtanov | N. S. Narayanaswamy | Venkatesh Raman | M. S. Ramanujan | Saket Saurabh

JOURNAL ISSUE published 30 January 2018 in ACM Transactions on Algorithms

JOURNAL ISSUE published 1 November 2008 in ACM Transactions on Algorithms

Perfect matchings via uniform sampling in regular bipartite graphs

JOURNAL ARTICLE published March 2010 in ACM Transactions on Algorithms

Research funded by Division of Computing and Communication Foundations (CCF-0635084) | National Science Foundation (428868,339262)

Authors: Ashish Goel | Michael Kapralov | Sanjeev Khanna

Clustering lines in high-dimensional space

JOURNAL ARTICLE published November 2010 in ACM Transactions on Algorithms

Research funded by National Science Foundation (CCR-0326554) | NSA (H98230-06-1-0074) | Division of Computing and Communication Foundations (CCF-0346991CCF-0515342)

Authors: Jie Gao | Michael Langberg | Leonard J. Schulman

An O ( n ^2.75 ) algorithm for incremental topological ordering

JOURNAL ARTICLE published August 2008 in ACM Transactions on Algorithms

Research funded by Deutsche Forschungsgemeinschaft (ME 2088/1-3)

Authors: Deepak Ajwani | Tobias Friedrich | Ulrich Meyer

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes

JOURNAL ARTICLE published 31 October 2022 in ACM Transactions on Algorithms

Authors: Rahul Arya | Sunil Arya | Guilherme D. da Fonseca | David Mount

Generic Techniques for Building Top- k Structures

JOURNAL ARTICLE published 31 October 2022 in ACM Transactions on Algorithms

Research funded by GRF (14203421, 14207820)

Authors: Saladi Rahul | Yufei Tao

I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths

JOURNAL ARTICLE published July 2012 in ACM Transactions on Algorithms

Research funded by Deutsche Forschungsgemeinschaft (ME 3250/1-1)

Authors: Ulrich Meyer | Norbert Zeh