JOURNAL ISSUE published 1 June 2013 in ACM Transactions on Algorithms

JOURNAL ISSUE published 1 February 2014 in ACM Transactions on Algorithms

JOURNAL ISSUE published 4 June 2018 in ACM Transactions on Algorithms

An approximation algorithm for the maximum leaf spanning arborescence problem

JOURNAL ARTICLE published June 2010 in ACM Transactions on Algorithms

Research funded by Natural Sciences and Engineering Research Council of Canada (28833-04) | Fonds Québécois de la Recherche sur la Nature et les Technologies (NC-98649)

Authors: Matthew Drescher | Adrian Vetta

Reliable Spanners for Metric Spaces

JOURNAL ARTICLE published 31 January 2023 in ACM Transactions on Algorithms

Research funded by NSF AF (CCF-1907400) | BSF (2018223) | Netherlands Organisation for Scientific Research (024.002.003)

Authors: Sariel Har-Peled | Manor Mendel | Dániel Oláh

A logarithmic approximation for unsplittable flow on line graphs

JOURNAL ARTICLE published January 2014 in ACM Transactions on Algorithms

Authors: Nikhil Bansal | Zachary Friggstad | Rohit Khandekar | Mohammad R. Salavatipour

Approximating parameterized convex optimization problems

JOURNAL ARTICLE published December 2012 in ACM Transactions on Algorithms

Research funded by Deutsche Forschungsgemeinschaft (GI-711/3-1) | Swiss National Science Foundation (20PA21-121957)

Authors: Joachim Giesen | Martin Jaggi | Sören Laue

Faster fixed parameter tractable algorithms for finding feedback vertex sets

JOURNAL ARTICLE published July 2006 in ACM Transactions on Algorithms

Authors: Venkatesh Raman | Saket Saurabh | C. R. Subramanian

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

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal

JOURNAL ARTICLE published 30 April 2018 in ACM Transactions on Algorithms

Research funded by ERC Starting Grant PaPaAlg (715744) | ERC Starting Grant PARAPPROX (306992) | ERC Starting Grant PARAMTIGHT (280152) | Consolidator Grant SYSTEMATICGRAPH (755978)

Authors: Daniel Lokshtanov | Dániel Marx | Saket Saurabh

Cheeger-Type Approximation for Sparsest st -Cut

JOURNAL ARTICLE published 31 January 2017 in ACM Transactions on Algorithms

Research funded by U.S.-Israel BSF (2010418) | Israel Science Foundation (897/13)

Authors: Robert Krauthgamer | Tal Wagner

Time vs. Information Tradeoffs for Leader Election in Anonymous Trees

JOURNAL ARTICLE published 31 July 2017 in ACM Transactions on Algorithms

Research funded by NSERC Discovery (8136-2013) | ANR project DISPLEXITY (ANR-11BS02-014)

Authors: Christian Glacet | Avery Miller | Andrzej Pelc

True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk Graphs

JOURNAL ARTICLE published 8 April 2024 in ACM Transactions on Algorithms

Authors: Sayan Bandyapadhyay | William Lochet | Daniel Lokshtanov | Saket Saurabh | Jie Xue

Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space

JOURNAL ARTICLE published 31 July 2021 in ACM Transactions on Algorithms

Research funded by Israel Science Foundation (1176/18) | National Science Foundation (2008838) | Swarnajayanti Fellowship (DST/SJF/MSA-01/2017-18) | United States–Israel Binational Science Foundation (2018302)

Authors: Daniel Lokshtanov | Andreas BjÖrklund | Saket Saurabh | Meirav Zehavi

Dense subgraph problems with output-density conditions

JOURNAL ARTICLE published August 2008 in ACM Transactions on Algorithms

Authors: Akiko Suzuki | Takeshi Tokuyama

Approximation Algorithms and Hardness of the k -Route Cut Problem

JOURNAL ARTICLE published 8 February 2016 in ACM Transactions on Algorithms

Research funded by National Science Foundation (CCF-0844872)

Authors: Julia Chuzhoy | Yury Makarychev | Aravindan Vijayaraghavan | Yuan Zhou

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

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

JOURNAL ISSUE published 12 February 2016 in ACM Transactions on Algorithms

JOURNAL ISSUE published 1 March 2010 in ACM Transactions on Algorithms