- Loukas Georgiadis, Robert E. Tarjan:
Dominator Tree Certification and Divergent Spanning Trees. ACM Trans. Algorithms 12(1): 11:1-11:42 (2016) - Loukas Georgiadis, Robert E. Tarjan:
Addendum to "Dominator Tree Certification and Divergent Spanning Trees". ACM Trans. Algorithms 12(4): 56:1-56:3 (2016) - Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin:
Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT. ACM Trans. Algorithms 12(3): 35:1-35:17 (2016) - Ronald L. Graham, Linus Hamilton, Ariel Levavi, Po-Shen Loh:
Anarchy Is Free in Network Creation. ACM Trans. Algorithms 12(2): 15:1-15:10 (2016) - Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets. ACM Trans. Algorithms 12(1): 10:1-10:21 (2016) - Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from Some Optimal Geometric Inapproximability Results. ACM Trans. Algorithms 12(1): 6:1-6:25 (2016) - Mohammad Taghi Hajiaghayi, Wei Hu, Jian Li, Shi Li, Barna Saha:
A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median. ACM Trans. Algorithms 12(3): 36:1-36:19 (2016) - Mohammad Taghi Hajiaghayi, Rohit Khandekar, Mohammad Reza Khani, Guy Kortsarz:
Approximation Algorithms for Movement Repairmen. ACM Trans. Algorithms 12(4): 54:1-54:38 (2016) - Goran Konjevod, Andréa W. Richa, Donglin Xia:
Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension. ACM Trans. Algorithms 12(3): 27:1-27:29 (2016) - Christian Konrad, Adi Rosén:
Approximating Semi-matchings in Streaming and in Two-Party Communication. ACM Trans. Algorithms 12(3): 32:1-32:21 (2016) - Guy Kortsarz, Zeev Nutov:
A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2. ACM Trans. Algorithms 12(2): 23:1-23:20 (2016) - Ioannis Koutis, Alex Levin, Richard Peng:
Faster Spectral Sparsification and Numerical Algorithms for SDD Matrices. ACM Trans. Algorithms 12(2): 17:1-17:16 (2016) - Ioannis Koutis, Ryan Williams:
LIMITS and Applications of Group Algebras for Parameterized Problems. ACM Trans. Algorithms 12(3): 31:1-31:18 (2016) - Stefan Kratsch, Geevarghese Philip, Saurabh Ray:
Point Line Cover: The Easy Kernel is Essentially Tight. ACM Trans. Algorithms 12(3): 40:1-40:16 (2016) - V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks. ACM Trans. Algorithms 12(3): 28:1-28:25 (2016) - Guillaume Moroz, Boris Aronov:
Computing the Distance between Piecewise-Linear Bivariate Functions. ACM Trans. Algorithms 12(1): 3:1-3:13 (2016) - Ofer Neiman, Shay Solomon:
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching. ACM Trans. Algorithms 12(1): 7:1-7:15 (2016) - Mihai Patrascu, Mikkel Thorup:
On the k-Independence Required by Linear Probing and Minwise Independence. ACM Trans. Algorithms 12(1): 8:1-8:27 (2016) - Lukás Polácek, Ola Svensson:
Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation. ACM Trans. Algorithms 12(2): 13:1-13:13 (2016) - Yuval Rabani, Andréa W. Richa, Jared Saia, David P. Woodruff:
Editorial to the Special Issue on SODA'12. ACM Trans. Algorithms 12(1): 1:1 (2016) - Siddhartha Sen, Robert E. Tarjan, David Hong Kyun Kim:
Deletion Without Rebalancing in Binary Search Trees. ACM Trans. Algorithms 12(4): 57:1-57:31 (2016) - Marcel Kenji de Carli Silva, Nicholas J. A. Harvey, Cristiane M. Sato:
Sparse Sums of Positive Semidefinite Matrices. ACM Trans. Algorithms 12(1): 9:1-9:17 (2016) - Arkadiusz Socala:
Tight Lower Bound for the Channel Assignment Problem. ACM Trans. Algorithms 12(4): 48:1-48:19 (2016) - Chaitanya Swamy:
Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications. ACM Trans. Algorithms 12(4): 49:1-49:22 (2016) - Justin Ward, Stanislav Zivný:
Maximizing k-Submodular Functions and Beyond. ACM Trans. Algorithms 12(4): 47:1-47:26 (2016) - Oren Weimann, Raphael Yuster:
Approximating the Diameter of Planar Graphs in Near Linear Time. ACM Trans. Algorithms 12(1): 12:1-12:13 (2016) - Karl Wimmer:
Agnostic Learning in Permutation-Invariant Domains. ACM Trans. Algorithms 12(4): 46:1-46:22 (2016)