Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 1 of 963 results
Sort by: relevance publication year
Showing results for ISSN matching 1549-6325

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

https://doi.org/10.1145/2532645 Actions

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)

Authors: Noa Avigdor-Elgrabli | Yuval Rabani

https://doi.org/10.1145/2663347 Actions

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)

Authors: Marcin Bienkowski | Jarosław Byrka | Marcin Mucha

https://doi.org/10.1145/3340296 Actions

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)

Authors: Axel Bacher | Olivier Bodini | Hsien-Kuei Hwang | Tsung-Hsi Tsai

https://doi.org/10.1145/3009909 Actions

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.)

Authors: Édouard Bonnet | Tillmann Miltzow

https://doi.org/10.1145/3398684 Actions

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

https://doi.org/10.1145/2151171.2151178 Actions

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

https://doi.org/10.1145/2635806 Actions

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

https://doi.org/10.1145/3461477 Actions

Dense subgraph problems with output-density conditions

JOURNAL ARTICLE published August 2008 in ACM Transactions on Algorithms

Authors: Akiko Suzuki | Takeshi Tokuyama

https://doi.org/10.1145/1383369.1383374 Actions

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

https://doi.org/10.1145/2644814 Actions

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

https://doi.org/10.1145/3039872 Actions

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)

Authors: Shaohua Li | Marcin Pilipczuk | Manuel Sorge

https://doi.org/10.1145/3626526 Actions

JOURNAL ISSUE published 30 January 2018 in ACM Transactions on Algorithms

https://doi.org/10.1145/3171590 Actions

JOURNAL ISSUE published 1 November 2008 in ACM Transactions on Algorithms

https://doi.org/10.1145/1435375 Actions

Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival Times

JOURNAL ARTICLE published 31 October 2019 in ACM Transactions on Algorithms

Authors: Ulrich Brenner | Anna Hermann

https://doi.org/10.1145/3340321 Actions

Spanning Circuits in Regular Matroids

JOURNAL ARTICLE published 31 October 2019 in ACM Transactions on Algorithms

Authors: Fedor V. Fomin | Petr A. Golovach | Daniel Lokshtanov | Saket Saurabh

https://doi.org/10.1145/3355629 Actions

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)

Authors: Piotr Berman | Sofya Raskhodnikova

https://doi.org/10.1145/2636920 Actions

Optimal Partitioning for Dual-Pivot Quicksort

JOURNAL ARTICLE published 12 February 2016 in ACM Transactions on Algorithms

Authors: Martin Aumüller | Martin Dietzfelbinger

https://doi.org/10.1145/2743020 Actions

Average Case and Distributional Analysis of Dual-Pivot Quicksort

JOURNAL ARTICLE published 13 January 2015 in ACM Transactions on Algorithms

Authors: Sebastian Wild | Markus E. Nebel | Ralph Neininger

https://doi.org/10.1145/2629340 Actions

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)

Authors: Zhewei Wei | Ke Yi

https://doi.org/10.1145/3205454 Actions
Feedback: support@crossref.org