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

Trading off space for passes in graph streaming problems

JOURNAL ARTICLE published December 2009 in ACM Transactions on Algorithms

Authors: Camil Demetrescu | Irene Finocchi | Andrea Ribichini

k -center Clustering under Perturbation Resilience

JOURNAL ARTICLE published 30 April 2020 in ACM Transactions on Algorithms

Research funded by NSF (CCF-1910321, CCF 1535967, CCF-1422910, CCF-145117, and IIS-1618714)

Authors: Maria-Florina Balcan | Nika Haghtalab | Colin White

Scalably scheduling processes with arbitrary speedup curves

JOURNAL ARTICLE published July 2012 in ACM Transactions on Algorithms

Authors: Jeff Edmonds | Kirk Pruhs

Approximation algorithms for data placement on parallel disks

JOURNAL ARTICLE published October 2009 in ACM Transactions on Algorithms

Research funded by National Science Foundation (CCR-9896232CCR-0113192,CCR-0093117CCR-9820965CCR-0113192CCR-9820965)

Authors: Leana Golubchik | Sanjeev Khanna | Samir Khuller | Ramakrishna Thurimella | An Zhu

Facility location with hierarchical facility costs

JOURNAL ARTICLE published March 2010 in ACM Transactions on Algorithms

Research funded by National Science Foundation (CCR-0325453,CCR-0311333) | Office of Naval Research (N00014-98-1-0589)

Authors: Zoya Svitkina | ÉVA Tardos

The Simplex Algorithm Is NP-Mighty

JOURNAL ARTICLE published 31 January 2019 in ACM Transactions on Algorithms

Research funded by DFG Priority Programme 1736 “Algorithms for Big Data” (SK 58/10-2)

Authors: Yann Disser | Martin Skutella

The Complexity of Cake Cutting with Unequal Shares

JOURNAL ARTICLE published 31 July 2020 in ACM Transactions on Algorithms

Research funded by OTKA grant (K128611) | Magyar Tudományos Akadémia (Cooperation of Excellences Grant (KEP-6/2019)) | Ministry of Human Resources under its New National Excellence Programme (UNKP-18-4-BME-331) | Momentum Programme (LP2016-3/2019) | New Hungary Development Plan (TAMOP-4.2.1/B-09/1/KMR-2010-0002)

Authors: Ágnes Cseh | Tamás Fleiner

Competitive buffer management for shared-memory switches

JOURNAL ARTICLE published November 2008 in ACM Transactions on Algorithms

Authors: William Aiello | Alex Kesselman | Yishay Mansour

Nearest-Neighbor Searching Under Uncertainty II

JOURNAL ARTICLE published 31 January 2017 in ACM Transactions on Algorithms

Research funded by Advanced Cyberinfrastructure (ACI-1443046) | Research Grants Council, University Grants Committee (GRF-621413, GRF-16211614, GRF-16200415) | National Science Foundation (CCF-09-40671, CCF-10-12254, CCF-11-61359, CCF-08-30691, CCF-11-17336, CCF-12-18791, CCF-09-15984, CCF-12- 17462, CCF-1350888) | Division of Information and Intelligent Systems (IIS-14- 08846, IIS-1251019) | National Security Agency (H98230-10-1-0210)

Authors: Pankaj K. Agarwal | Boris Aronov | Sariel Har-Peled | Jeff M. Phillips | Ke Yi | Wuzhou Zhang

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

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

Optimal Streaming and Tracking Distinct Elements with High Probability

JOURNAL ARTICLE published 31 January 2020 in ACM Transactions on Algorithms

Research funded by Office of Naval Research (N00014-15-1-2388)

Authors: Jarosław Błasiok

The optimality of the online greedy algorithm in carpool and chairman assignment problems

JOURNAL ARTICLE published July 2011 in ACM Transactions on Algorithms

Authors: Don Coppersmith | Tomasz Nowicki | Giuseppe Paleologo | Charles Tresser | Chai Wah Wu

Approximating Semi-matchings in Streaming and in Two-Party Communication

JOURNAL ARTICLE published 15 June 2016 in ACM Transactions on Algorithms

Research funded by Icelandic Research Fund (120032011 and 152679-051)

Authors: Christian Konrad | Adi Rosén

Fully Dynamic MIS in Uniformly Sparse Graphs

JOURNAL ARTICLE published 30 April 2020 in ACM Transactions on Algorithms

Authors: Krzysztof Onak | Baruch Schieber | Shay Solomon | Nicole Wein

Replacement paths and k simple shortest paths in unweighted directed graphs

JOURNAL ARTICLE published September 2012 in ACM Transactions on Algorithms

Authors: Liam Roditty | Uri Zwick

A PTAS for Capacitated Vehicle Routing on Trees

JOURNAL ARTICLE published 30 April 2023 in ACM Transactions on Algorithms

Authors: Claire Mathieu | Hang Zhou

Tight Analysis of Parallel Randomized Greedy MIS

JOURNAL ARTICLE published 31 January 2020 in ACM Transactions on Algorithms

Authors: Manuela Fischer | Andreas Noever

Algorithmic aspects of bandwidth trading

JOURNAL ARTICLE published 1 February 2007 in ACM Transactions on Algorithms

Authors: Randeep Bhatia | Julia Chuzhoy | Ari Freund | Joseph (Seffi) Naor