default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 16
Volume 16, Number 1, January 2020
- Yin Tat Lee, Marcin Pilipczuk, David P. Woodruff:
Introduction to the Special Issue on SODA'18. 1:1-1:2 - Mudabir Kabir Asathulla, Sanjeev Khanna, Nathaniel Lahn
, Sharath Raghvendra:
A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs. 2:1-2:30 - Jaroslaw Blasiok:
Optimal Streaming and Tracking Distinct Elements with High Probability. 3:1-3:28 - Chloe Ching-Yun Hsu, Chris Umans:
A New Algorithm for Fast Generalized DFTs. 4:1-4:20 - Friedrich Eisenbrand, Robert Weismantel:
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma. 5:1-5:14 - Manuela Fischer, Andreas Noever:
Tight Analysis of Parallel Randomized Greedy MIS. 6:1-6:13 - Timothy M. Chan:
More Logarithmic-factor Speedups for 3SUM, (median, +)-convolution, and Some Geometric 3SUM-hard Problems. 7:1-7:23
- Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, Jara Uitto:
Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma. 8:1-8:51 - Clifford Stein, Mingxian Zhong:
Scheduling When You Do Not Know the Number of Machines. 9:1-9:20 - Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, Pan Xu:
Algorithms to Approximate Column-sparse Packing Problems. 10:1-10:32 - Joe Sawada, Aaron Williams:
Solving the Sigma-Tau Problem. 11:1-11:17 - Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Approximation Schemes for Low-rank Binary Matrix Approximation Problems. 12:1-12:39 - Gopal Pandurangan, Peter Robinson, Michele Scquizzato:
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees. 13:1-13:27 - Ashish Chiplunkar, Sundar Vishwanathan:
Randomized Memoryless Algorithms for the Weighted and the Generalized k-server Problems. 14:1-14:28 - Fabrizio Grandoni, Virginia Vassilevska Williams:
Faster Replacement Paths and Distance Sensitivity Oracles. 15:1-15:25
Volume 16, Number 2, April 2020
- Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search. 16:1-16:24 - Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen:
Linear-time String Indexing and Analysis in Small Space. 17:1-17:54 - Talya Eden, Reut Levi, Dana Ron:
Testing Bounded Arboricity. 18:1-18:22 - Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and Their Applications. 19:1-19:21 - Saleh Soltan, Mihalis Yannakakis, Gil Zussman:
Doubly Balanced Connected Graph Partitioning. 20:1-20:24 - Fedor V. Fomin, Daniel Lokshtanov, Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. 21:1-21:37 - Maria-Florina Balcan, Nika Haghtalab, Colin White:
k-center Clustering under Perturbation Resilience. 22:1-22:39 - Miriam Backens, Leslie Ann Goldberg:
Holant Clones and the Approximability of Conservative Holant Problems. 23:1-23:55 - T.-H. Hubert Chan, Haotian Jiang, Shaofeng H.-C. Jiang:
A Unified PTAS for Prize Collecting TSP and Steiner Tree Problem in Doubling Metrics. 24:1-24:23 - Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk, Lukás Mach:
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems. 25:1-25:31 - Krzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein:
Fully Dynamic MIS in Uniformly Sparse Graphs. 26:1-26:19 - Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
A Linear-Time Algorithm for Seeds Computation. 27:1-27:23
Volume 16, Number 3, June 2020
- Sándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen:
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces. 28:1-28:30 - Ágnes Cseh, Tamás Fleiner:
The Complexity of Cake Cutting with Unequal Shares. 29:1-29:21 - Rodrigo S. V. Martins, Daniel Panario, Claudio M. Qureshi, Eric Schmutz:
Periods of Iterations of Functions with Restricted Preimage Sizes. 30:1-30:28 - Achiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen, Adi Shamir:
Tight Bounds on Online Checkpointing Algorithms. 31:1-31:22 - Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. 32:1-32:31 - Eden Chlamtác, Michael Dinitz, Guy Kortsarz, Bundit Laekhanukit:
Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds. 33:1-33:31 - Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An Improved Isomorphism Test for Bounded-tree-width Graphs. 34:1-34:31 - André Berger, László Kozma, Matthias Mnich, Roland Vincze:
Time- and Space-optimal Algorithm for the Many-visits TSP. 35:1-35:22 - Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Structure Learning of H-Colorings. 36:1-36:28 - Martin E. Dyer, Andreas Galanis, Leslie Ann Goldberg, Mark Jerrum, Eric Vigoda:
Random Walks on Small World Networks. 37:1-37:33 - Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma, Kevin Schewior:
A PTAS for Euclidean TSP with Hyperplane Neighborhoods. 38:1-38:16 - Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond:
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. 39:1-39:23 - Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim:
Clustering in Hypergraphs to Minimize Average Edge Service Time. 40:1-40:28 - Shay Solomon, Nicole Wein:
Improved Dynamic Graph Coloring. 41:1-41:24
Volume 16, Number 4, September 2020
- Édouard Bonnet, Tillmann Miltzow:
Parameterized Hardness of Art Gallery Problems. 42:1-42:23 - Waldo Gálvez, José A. Soto, José Verschae:
Symmetry Exploitation for Online Machine Covering with Bounded Migration. 43:1-43:22 - Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty:
Approximate Single-Source Fault Tolerant Shortest Path. 44:1-44:22 - Josh Alman, Matthias Mnich, Virginia Vassilevska Williams:
Dynamic Parameterized Problems and Algorithms. 45:1-45:46 - Deeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy:
The Non-Uniform k-Center Problem. 46:1-46:19 - Eduard Eiben, Iyad Kanj:
A Colored Path Problem and Its Applications. 47:1-47:48 - Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can). 48:1-48:22 - Euiwoong Lee, Sahil Singla:
Maximum Matching in the Online Batch-arrival Model. 49:1-49:31 - Johannes Fischer, Tomohiro I, Dominik Köppl:
Deterministic Sparse Suffix Sorting in the Restore Model. 50:1-50:53 - Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems. 51:1-51:38 - Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, Makrand Sinha:
Edge Estimation with Independent Set Oracles. 52:1-52:27 - Johannes Blömer, Sascha Brauer, Kathrin Bujna:
A Complexity Theoretical Study of Fuzzy K-Means. 53:1-53:25 - Clément Carbonnel, Miguel Romero, Stanislav Zivný:
Point-Width and Max-CSPs. 54:1-54:28
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-19 01:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
