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

Tight Analysis of Parallel Randomized Greedy MIS

JOURNAL ARTICLE published 31 January 2020 in ACM Transactions on Algorithms

Authors: Manuela Fischer | Andreas Noever

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

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

A PTAS for Capacitated Vehicle Routing on Trees

JOURNAL ARTICLE published 30 April 2023 in ACM Transactions on Algorithms

Authors: Claire Mathieu | Hang Zhou

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

Subtree Isomorphism Revisited

JOURNAL ARTICLE published 31 July 2018 in ACM Transactions on Algorithms

Research funded by BSF (BSF:2012338) | Carlsberg Foundation (CF14-0617) | NSF (CCF-1417238 and CCF-1514339) | Israeli Centers of Research Excellence (Center No. 4/11)

Authors: Amir Abboud | Arturs Backurs | Thomas Dueholm Hansen | Virginia Vassilevska Williams | Or Zamir

PTAS for Sparse General-valued CSPs

JOURNAL ARTICLE published 30 April 2023 in ACM Transactions on Algorithms

Research funded by UKRI (EP/X024431/1) | European Union’s Horizon 2020 research and innovation programme (714532)

Authors: Balázs F. Mezei | Marcin Wrochna | stanislav Živný

Cluster Editing Parameterized above Modification-disjoint P ₃ -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

Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems

JOURNAL ARTICLE published 30 April 2020 in ACM Transactions on Algorithms

Authors: Ivan Bliznets | Marek Cygan | Paweł Komosa | Michał Pilipczuk | Lukáš Mach

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

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

Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem

JOURNAL ARTICLE published June 2008 in ACM Transactions on Algorithms

Authors: Yefim Dinitz | Shay Solomon

Nondecreasing paths in a weighted graph or

JOURNAL ARTICLE published August 2010 in ACM Transactions on Algorithms

Research funded by Division of Information and Intelligent Systems (CCR-0122581CCR-0313148IIS-0121641CCF-0832797) | National Science Foundation (937060,CCR-0122581CCR-0313148IIS-0121641CCF-0832797) | Division of Computing and Communication Foundations (CCR-0122581CCR-0313148IIS-0121641CCF-0832797)

Authors: Virginia Vassilevska Williams

Fault-Tolerant Approximate BFS Structures

JOURNAL ARTICLE published 31 January 2018 in ACM Transactions on Algorithms

Research funded by United States-Israel Binational Science Foundation (2008348) | ISF (4/11) | Israel Science Foundation (894/09)

Authors: Merav Parter | David Peleg

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

Competitive analysis of flash memory algorithms

JOURNAL ARTICLE published March 2011 in ACM Transactions on Algorithms

Authors: Avraham Ben-Aroya | Sivan Toledo

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

Approximating Rooted Steiner Networks

JOURNAL ARTICLE published 17 November 2014 in ACM Transactions on Algorithms

Research funded by Natural Sciences and Engineering Research Council of Canada (No. OGP0138432 and No. 28833)

Authors: Joseph Cheriyan | Bundit Laekhanukit | Guyslain Naves | Adrian Vetta