Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications

JOURNAL ARTICLE published 30 April 2017 in ACM Transactions on Algorithms

Research funded by U.S.-Israel Binational Science Foundation (2006/204,2006/194 and 2012/229) | Israeli Centers of Research Excellence (I-CORE) program (Center No. 4/11) | Israel Science Fund (338/09 and 892/13,794/13,822/10 and 1841/14) | NSF (CCF-0964037, CCF-1111109 and CCR-08-30272) | German-Israeli Foundation for Scientific Research and Development (1161/2011)

Authors: Haim Kaplan | Shay Mozes | Yahav Nussbaum | Micha Sharir

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

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

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

Optimal Partitioning for Dual-Pivot Quicksort

JOURNAL ARTICLE published 12 February 2016 in ACM Transactions on Algorithms

Authors: Martin Aumüller | Martin Dietzfelbinger

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

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

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

Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs

JOURNAL ARTICLE published 31 January 2018 in ACM Transactions on Algorithms

Research funded by NSF (CCR-9988160, CCF-1320675, CCF-1439084 and CNS-1553510)

Authors: Rezaul A. Chowdhury | Vijaya Ramachandran

Firefighting on Trees Beyond Integrality Gaps

JOURNAL ARTICLE published 30 April 2019 in ACM Transactions on Algorithms

Research funded by EU grant FP7-PEOPLE-2012-ITN (316647) | Swiss National Science Foundation (200021_165866)

Authors: David Adjiashvili | Andrea Baggio | Rico Zenklusen

Improved Deterministic Algorithms for Linear Programming in Low Dimensions

JOURNAL ARTICLE published 31 July 2018 in ACM Transactions on Algorithms

Authors: Timothy M. CHAN

Randomized Embeddings with Slack and High-Dimensional Approximate Nearest Neighbor

JOURNAL ARTICLE published 30 April 2018 in ACM Transactions on Algorithms

Research funded by European Unions Horizon 2020 research and innovation programme (734242 (Project LAMBDA))

Authors: Evangelos Anagnostopoulos | Ioannis Z. Emiris | Ioannis Psarros

Maximizing Polynomials Subject to Assignment Constraints

JOURNAL ARTICLE published 31 October 2017 in ACM Transactions on Algorithms

Authors: Konstantin Makarychev | Maxim Sviridenko

A Generalization of Self-Improving Algorithms

JOURNAL ARTICLE published 31 July 2022 in ACM Transactions on Algorithms

Research funded by National Natural Science Foundation of China (62002394) | Research Grants Council, Hong Kong, China (16200317) | ERC (StG 757609)

Authors: Kai Jin | Siu-Wing Cheng | Man-Kwun Chiu | Man Ting Wong

Editorial

JOURNAL ARTICLE published 31 July 2021 in ACM Transactions on Algorithms

Editors: Edith Cohen

Deterministic Leader Election in Anonymous Radio Networks

JOURNAL ARTICLE published 31 July 2022 in ACM Transactions on Algorithms

Research funded by Natural Sciences and Engineering Research Council of Canada (RGPIN–2017–05936, RGPIN–2018–03899)

Authors: Avery Miller | Andrzej Pelc | Ram Narayan Yadav

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms

JOURNAL ARTICLE published 31 July 2020 in ACM Transactions on Algorithms

Research funded by Parameterized Approximation (306992) | Pareto-Optimal Parameterized Algorithms (715744) | Swarnajayanti Fellowship (DST/SJF/MSA-01/2017-18) | European Research Council (819416) | Rigorous Theory of Preprocessing (267959)

Authors: Daniel Lokshtanov | Fahad Panolan | Saket Saurabh | Roohani Sharma | Meirav Zehavi

Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search

JOURNAL ARTICLE published 30 April 2020 in ACM Transactions on Algorithms

Research funded by Israel Science Foundation (794/13 and 592/17)

Authors: Paweł Gawrychowski | Shay Mozes | Oren Weimann

A PTAS for Euclidean TSP with Hyperplane Neighborhoods

JOURNAL ARTICLE published 31 July 2020 in ACM Transactions on Algorithms

Research funded by Deutscher Akademischer Austauschdienst (PRIME) | CONICYT (Grant PII 201501 40) | Deutsche Forschungsgemeinschaft (AN 1262/1-1) | European Research Council (TUgbOAT no.772346)

Authors: Antonios Antoniadis | Krzysztof Fleszar | Ruben Hoeksma | Kevin Schewior