Facet browsing currently unavailable
Page 1 of 963 results
Sort by: relevance publication year
A logarithmic approximation for unsplittable flow on line graphs JOURNAL ARTICLE published January 2014 in ACM Transactions on Algorithms |
An Improved Competitive Algorithm for Reordering Buffer Management JOURNAL ARTICLE published 23 June 2015 in ACM Transactions on Algorithms Research funded by Israel Science Foundation (856/11) |
Dynamic Beats Fixed JOURNAL ARTICLE published 31 October 2019 in ACM Transactions on Algorithms Research funded by Polish National Science Centre (2016/22/E/ST6/00499 and 2015/18/E/ST6/00456) | European Research Council (677651) |
Generating Random Permutations by Coin Tossing JOURNAL ARTICLE published 30 April 2017 in ACM Transactions on Algorithms Research funded by ANR-MOST Joint Project MetAConC (ANR 2015-BLAN-0204 and MOST 105-2923-E-001-001-MY4) |
Parameterized Hardness of Art Gallery Problems JOURNAL ARTICLE published 31 October 2020 in ACM Transactions on Algorithms Research funded by supporteNetherlands Organisation for Scientific Research (016.Veni.192.250.) |
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) |
Testing Properties of Sparse Images JOURNAL ARTICLE published August 2014 in ACM Transactions on Algorithms Research funded by Israel Science Foundation (246/08) |
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) |
Dense subgraph problems with output-density conditions JOURNAL ARTICLE published August 2008 in ACM Transactions on Algorithms |
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) |
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) |
Cluster Editing Parameterized above Modification-disjoint P 3 -packings JOURNAL ARTICLE published 31 January 2024 in ACM Transactions on Algorithms Research funded by European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (714704) |
JOURNAL ISSUE published 30 January 2018 in ACM Transactions on Algorithms |
JOURNAL ISSUE published 1 November 2008 in ACM Transactions on Algorithms |
Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival Times JOURNAL ARTICLE published 31 October 2019 in ACM Transactions on Algorithms |
Spanning Circuits in Regular Matroids JOURNAL ARTICLE published 31 October 2019 in ACM Transactions on Algorithms |
Approximation Algorithms for Min-Max Generalization Problems JOURNAL ARTICLE published 28 October 2014 in ACM Transactions on Algorithms Research funded by Division of Computing and Communication Foundations (CCF-0729171,CCF-0845701) |
Optimal Partitioning for Dual-Pivot Quicksort JOURNAL ARTICLE published 12 February 2016 in ACM Transactions on Algorithms |
Average Case and Distributional Analysis of Dual-Pivot Quicksort JOURNAL ARTICLE published 13 January 2015 in ACM Transactions on Algorithms |
Tight Space Bounds for Two-Dimensional Approximate Range Counting JOURNAL ARTICLE published 30 April 2018 in ACM Transactions on Algorithms Research funded by HKRGC (GRF-16211614, GRF-16200415 and GRF-16202317) | Research Funds of Renmin University of China (18XNLG21) | National Natural Science Foundation of China (61502503) |