Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 15
Volume 15, Number 1, January 2019
- Zhengyang Liu, Xi Chen, Rocco A. Servedio
, Ying Sheng, Jinyu Xie:
Distribution-free Junta Testing. 1:1-1:23 - Arnab Bhattacharyya, Palash Dey, David P. Woodruff:
An Optimal Algorithm for ℓ1-Heavy Hitters in Insertion Streams and Related Problems. 2:1-2:27 - Zbigniew Golebiewski, Abram Magner, Wojciech Szpankowski:
Entropy and Optimal Compression of Some General Plane Trees. 3:1-3:23 - Michael Elkin, Ofer Neiman:
Efficient Algorithms for Constructing Very Sparse Spanners and Emulators. 4:1-4:29 - Yann Disser, Martin Skutella:
The Simplex Algorithm Is NP-Mighty. 5:1-5:19 - Anna Adamaszek, Artur Czumaj, Matthias Englert, Harald Räcke:
An O(log k)-Competitive Algorithm for Generalized Caching. 6:1-6:18 - Daniel Lokshtanov, Amer E. Mouawad:
The Complexity of Independent Set Reconfiguration on Bipartite Graphs. 7:1-7:19 - Barun Gorain, Andrzej Pelc:
Deterministic Graph Exploration with Advice. 8:1-8:17 - Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. 9:1-9:27 - Petra Berenbrink, Ralf Klasing, Adrian Kosowski, Frederik Mallmann-Trenn, Przemyslaw Uznanski:
Improved Analysis of Deterministic Load-Balancing Schemes. 10:1-10:22 - Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. 11:1-11:28 - Mikkel Abrahamsen, Bartosz Walczak:
Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace. 12:1-12:21 - Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi:
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. 13:1-13:44 - Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
On Problems Equivalent to (min, +)-Convolution. 14:1-14:25 - Hiroshi Hirai:
A Dual Descent Algorithm for Node-capacitated Multiflow Problems and Its Applications. 15:1-15:24
Volume 15, Number 2, May 2019
- Aravind Srinivasan:
Editorial. 16:1 - Dániel Marx, Virginia Vassilevska Williams, Neal E. Young:
Introduction to the Special Issue on SODA 2017. 17:1-17:2 - Ami Paz, Gregory Schwartzman:
A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model. 18:1-18:15 - David Adjiashvili:
Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs. 19:1-19:26 - David Adjiashvili, Andrea Baggio, Rico Zenklusen:
Firefighting on Trees Beyond Integrality Gaps. 20:1-20:33 - Sergio Cabello:
Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs. 21:1-21:38 - Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek:
Even Delta-Matroids and the Complexity of Planar Boolean CSPs. 22:1-22:33 - Jiawei Gao, Russell Impagliazzo, Antonina Kolokolova, Ryan Williams:
Completeness for First-order Properties on Sparse Structures with Algorithmic Applications. 23:1-23:35 - Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz:
Polynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes. 24:1-24:19
- Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, Gerhard J. Woeginger:
Domination When the Stars Are Out. 25:1-25:90 - Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation Schemes for Clustering with Outliers. 26:1-26:26 - Diodato Ferraioli, Carmine Ventre:
Metastability of the Logit Dynamics for Asymptotically Well-Behaved Potential Games. 27:1-27:42 - Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos:
The (h, k)-Server Problem on Bounded Depth Trees. 28:1-28:26 - Veli Mäkinen, Alexandru I. Tomescu, Anna Kuosmanen, Topi Paavilainen, Travis Gagie, Rayan Chikhi:
Sparse Dynamic Programming on DAGs with Small Width. 29:1-29:21
Volume 15, Number 3, July 2019
- Niv Buchbinder, Moran Feldman, Roy Schwartz:
Online Submodular Maximization with Preemption. 30:1-30:31 - Klaus Jansen, Marten Maack, Malin Rau:
Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times. 31:1-31:28 - Avrim Blum, Sariel Har-Peled, Benjamin Raichel:
Sparse Approximation via Generating Point Sets. 32:1-32:16 - David Coudert, Guillaume Ducoffe, Alexandru Popa:
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs. 33:1-33:57 - Sampath Kannan, Kevin Tian:
Locating Errors in Faulty Formulas. 34:1-34:13 - Moni Naor, Eylon Yogev:
Bloom Filters in Adversarial Environments. 35:1-35:30 - David G. Harris, Thomas W. Pensyl, Aravind Srinivasan, Khoa Trinh:
A Lottery Model for Center-Type Problems With Outliers. 36:1-36:25 - Xiaohui Bei, Jugal Garg, Martin Hoefer:
Ascending-Price Algorithms for Unknown Markets. 37:1-37:33 - Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang:
Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals. 38:1-38:15 - Saeed Akhoondian Amiri, Stefan Schmid, Sebastian Siebertz:
Distributed Dominating Set Approximations beyond Planar Graphs. 39:1-39:18 - Konstantinos Koiliaris, Chao Xu:
Faster Pseudopolynomial Time Algorithms for Subset Sum. 40:1-40:20 - Deeparnab Chakrabarty, Maryam Negahbani:
Generalized Center Problems with Outliers. 41:1-41:14 - Yeow Meng Chee, Johan Chrisnata, Han Mao Kiah, Tuan Thanh Nguyen:
Deciding the Confusability of Words under Tandem Repeats in Linear Time. 42:1-42:22 - David G. Harris:
Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set. 43:1-43:29 - Hiroshi Hirai, Yuni Iwamasa, Kazuo Murota, Stanislav Zivný:
A Tractable Class of Binary VCSPs via M-Convex Intersection. 44:1-44:41
Volume 15, Number 4, October 2019
- Ulrich Brenner, Anna Hermann:
Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival Times. 45:1-45:23 - Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha:
Dynamic Beats Fixed: On Phase-based Algorithms for File Migration. 46:1-46:21 - Sandy Heydrich, Andreas Wiese:
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem. 47:1-47:28 - Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu:
An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph. 48:1-48:17 - Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan:
Exponential Separations in the Energy Complexity of Leader Election. 49:1-49:31 - Hugo A. Akitaya, Radoslav Fulek, Csaba D. Tóth:
Recognizing Weak Embeddings of Graphs. 50:1-50:27 - Mark Bun, Jelani Nelson, Uri Stemmer:
Heavy Hitters and the Structure of Local Privacy. 51:1-51:40 - Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh:
Spanning Circuits in Regular Matroids. 52:1-52:38 - Boris Klemz, Günter Rote:
Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity. 53:1-53:25 - Marek Cygan, Lukasz Kowalik, Arkadiusz Socala:
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. 54:1-54:19 - Christoph Hunkenschröder, Santosh S. Vempala, Adrian Vetta:
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem. 55:1-55:28
a service of 
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 2024-09-02 20:31 CEST 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:
