Journal: ACM Transactions on Algorithms

Volume 14, Issue 4

0 -- 0Sampath Kannan, Claire Mathieu, Hang Zhou 0001. Graph Reconstruction and Verification
0 -- 0T.-H. Hubert Chan, Zhiyi Huang 0002, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang. Online Submodular Maximization with Free Disposal
0 -- 0Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter. Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
0 -- 0Aris Anagnostopoulos, Fabrizio Grandoni 0001, Stefano Leonardi, Andreas Wiese. A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path
0 -- 0Robert Krauthgamer, Ohad Trabelsi. Conditional Lower Bounds for All-Pairs Max-Flow
0 -- 0Amos Korman, Yoav Rodeh. The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback
0 -- 0Edith Cohen. Stream Sampling Framework and Application for Frequency Cap Statistics
0 -- 0Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen. Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
0 -- 0Suguru Tamaki, Yuichi Yoshida. Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues
0 -- 0Omer Gold, Micha Sharir. Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
0 -- 0Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak. Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
0 -- 0Lin Chen, Guochuan Zhang. Packing Groups of Items into Multiple Knapsacks
0 -- 0Jean-Daniel Boissonnat, Karthik C. S.. An Efficient Representation for Filtrations of Simplicial Complexes
0 -- 0David G. Harris. Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma
0 -- 0Pankaj K. Agarwal, Kyle Fox, Oren Salzman. An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
0 -- 0Boris Aronov, Matthew J. Katz. Batched Point Location in SINR Diagrams via Algebraic Tools
0 -- 0Jérémy Barbay, Pablo Pérez-Lantero. Adaptive Computation of the Swap-Insert Correction Distance

Volume 14, Issue 3

0 -- 0Zeev Nutov. Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies
0 -- 0Florian Barbero, Christophe Paul, Michal Pilipczuk. Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs
0 -- 0Timothy M. Chan. Improved Deterministic Algorithms for Linear Programming in Low Dimensions
0 -- 0Matti Karppa, Petteri Kaski, Jukka Kohonen. A Faster Subquadratic Algorithm for Finding Outlier Correlations
0 -- 0Niv Buchbinder, Moran Feldman. Deterministic Algorithms for Submodular Maximization Problems
0 -- 0Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm. On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique
0 -- 0Harold N. Gabow. f-factors
0 -- 0Shiri Chechik, Christian Wulff-Nilsen. Near-Optimal Light Spanners
0 -- 0Rasmus Pagh. CoveringLSH: Locality-Sensitive Hashing without False Negatives
0 -- 0Arnab Bhattacharyya, Fabrizio Grandoni 0001, Aleksandar Nikolov, Barna Saha, Saket Saurabh 0001, Aravindan Vijayaraghavan, Qin Zhang. Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue
0 -- 0Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Michal Pilipczuk, Marcin Wrochna. Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
0 -- 0Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir. Subtree Isomorphism Revisited
0 -- 0Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk. Subexponential Parameterized Algorithm for Interval Completion
0 -- 0Mark de Berg, Joachim Gudmundsson, Mehran Mehr. Faster Algorithms for Computing Plurality Points

Volume 14, Issue 2

0 -- 0Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu. Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem
0 -- 0Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy. k-Facility Location
0 -- 0Gramoz Goranci, Monika Henzinger, Mikkel Thorup. Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
0 -- 0T.-H. Hubert Chan, Fei Chen, Xiaowei Wu. Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity
0 -- 0Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh 0001, Meirav Zehavi. Exact Algorithms for Terrain Guarding
0 -- 0Torsten Mütze, Jerri Nummenpalo. Efficient Computation of Middle Levels Gray Codes
0 -- 0Daniel Lokshtanov, Dániel Marx, Saket Saurabh 0001. Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
0 -- 0Timothy M. Chan, J. Ian Munro, Venkatesh Raman 0001. Selection and Sorting in the "Restore" Model
0 -- 0Alantha Newman, Heiko Röglin, Johanna Seif. The Alternating Stock Size Problem and the Gasoline Puzzle
0 -- 0Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh 0001. Deterministic Truncation of Linear Matroids
0 -- 0Zhewei Wei, Ke Yi. Tight Space Bounds for Two-Dimensional Approximate Range Counting
0 -- 0Marcin Bienkowski, Tomasz Jurdzinski, Miroslaw Korzeniowski, Dariusz R. Kowalski. Distributed Online and Stochastic Queueing on a Multiple Access Channel
0 -- 0Evangelos Anagnostopoulos, Ioannis Z. Emiris, Ioannis Psarros. Randomized Embeddings with Slack and High-Dimensional Approximate Nearest Neighbor
0 -- 0Andreas Schmid 0003, Jens M. Schmidt. Computing 2-Walks in Polynomial Time
0 -- 0Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang. Computing the Gromov-Hausdorff Distance for Metric Trees

Volume 14, Issue 1

0 -- 0Rezaul Alam Chowdhury, Vijaya Ramachandran. Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs
0 -- 0Merav Parter, David Peleg. Fault-Tolerant Approximate BFS Structures
0 -- 0Stephan Held, Sophie Theresa Spirkl. Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two
0 -- 0Nikhil R. Devanur, Zhiyi Huang 0002. Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms
0 -- 0Daniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen. 6-free Graphs
0 -- 0Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001. Linear Time Parameterized Algorithms for Subset Feedback Vertex Set
0 -- 0T.-H. Hubert Chan, Shaofeng H.-C. Jiang. Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics
0 -- 0Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos. Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
0 -- 0Ran Duan, Seth Pettie, Hsin-Hao Su. Scaling Algorithms for Weighted Matching in General Graphs
0 -- 0David Eppstein. The Parametric Closure Problem