Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 14
Volume 14, Number 1, January 2018
- Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs. 1:1-1:33 - David Eppstein:
The Parametric Closure Problem. 2:1-2:22 - Daniel Lokshtanov, Marcin Pilipczuk
, Erik Jan van Leeuwen:
Independence and Efficient Domination on P6-free Graphs. 3:1-3:30 - Stephan Held, Sophie Theresa Spirkl:
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. 4:1-4:18 - Nikhil R. Devanur, Zhiyi Huang:
Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms. 5:1-5:30 - Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos:
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. 6:1-6:31 - Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set. 7:1-7:37 - Ran Duan, Seth Pettie, Hsin-Hao Su:
Scaling Algorithms for Weighted Matching in General Graphs. 8:1-8:35 - T.-H. Hubert Chan, Shaofeng H.-C. Jiang:
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics. 9:1-9:18 - Merav Parter, David Peleg:
Fault-Tolerant Approximate BFS Structures. 10:1-10:15
Volume 14, Number 2, June 2018
- Timothy M. Chan, J. Ian Munro, Venkatesh Raman:
Selection and Sorting in the "Restore" Model. 11:1-11:18 - T.-H. Hubert Chan, Fei Chen, Xiaowei Wu:
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity. 12:1-12:25 - Daniel Lokshtanov, Dániel Marx, Saket Saurabh:
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. 13:1-13:30 - Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh:
Deterministic Truncation of Linear Matroids. 14:1-14:20 - Torsten Mütze, Jerri Nummenpalo:
Efficient Computation of Middle Levels Gray Codes. 15:1-15:29 - Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy:
Approximation Algorithms for Minimum-Load k-Facility Location. 16:1-16:29 - Gramoz Goranci, Monika Henzinger, Mikkel Thorup:
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time. 17:1-17:21 - Evangelos Anagnostopoulos, Ioannis Z. Emiris, Ioannis Psarros:
Randomized Embeddings with Slack and High-Dimensional Approximate Nearest Neighbor. 18:1-18:21 - Alantha Newman, Heiko Röglin, Johanna Seif:
The Alternating Stock Size Problem and the Gasoline Puzzle. 19:1-19:23 - Ademir Hujdurovic, Edin Husic, Martin Milanic, Romeo Rizzi, Alexandru I. Tomescu:
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem. 20:1-20:26 - Marcin Bienkowski, Tomasz Jurdzinski, Miroslaw Korzeniowski, Dariusz R. Kowalski:
Distributed Online and Stochastic Queueing on a Multiple Access Channel. 21:1-21:22 - Andreas Schmid, Jens M. Schmidt:
Computing 2-Walks in Polynomial Time. 22:1-22:18 - Zhewei Wei, Ke Yi:
Tight Space Bounds for Two-Dimensional Approximate Range Counting. 23:1-23:17 - Pankaj K. Agarwal, Kyle Fox, Abhinandan Nath, Anastasios Sidiropoulos, Yusu Wang:
Computing the Gromov-Hausdorff Distance for Metric Trees. 24:1-24:20 - Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh, Meirav Zehavi:
Exact Algorithms for Terrain Guarding. 25:1-25:20
Volume 14, Number 3, July 2018
- Arnab Bhattacharyya, Fabrizio Grandoni, Aleksandar Nikolov, Barna Saha, Saket Saurabh, Aravindan Vijayaraghavan, Qin Zhang:
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue. 26:1-26:2 - Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir:
Subtree Isomorphism Revisited. 27:1-27:23 - Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm:
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. 28:1-28:31 - Rasmus Pagh:
CoveringLSH: Locality-Sensitive Hashing without False Negatives. 29:1-29:17 - Timothy M. Chan:
Improved Deterministic Algorithms for Linear Programming in Low Dimensions. 30:1-30:10 - Matti Karppa, Petteri Kaski, Jukka Kohonen:
A Faster Subquadratic Algorithm for Finding Outlier Correlations. 31:1-31:26 - Niv Buchbinder, Moran Feldman:
Deterministic Algorithms for Submodular Maximization Problems. 32:1-32:20 - Shiri Chechik, Christian Wulff-Nilsen:
Near-Optimal Light Spanners. 33:1-33:15
- Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michal Pilipczuk, Marcin Wrochna:
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. 34:1-34:45 - Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk:
Subexponential Parameterized Algorithm for Interval Completion. 35:1-35:62 - Mark de Berg, Joachim Gudmundsson, Mehran Mehr:
Faster Algorithms for Computing Plurality Points. 36:1-36:23 - Zeev Nutov:
Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies. 37:1-37:8 - Florian Barbero, Christophe Paul, Michal Pilipczuk:
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs. 38:1-38:31 - Harold N. Gabow:
Data Structures for Weighted Matching and Extensions to b-matching and f-factors. 39:1-39:80
Volume 14, Number 4, October 2018
- Sampath Kannan, Claire Mathieu, Hang Zhou:
Graph Reconstruction and Verification. 40:1-40:30 - Boris Aronov, Matthew J. Katz:
Batched Point Location in SINR Diagrams via Algebraic Tools. 41:1-41:29 - Robert Krauthgamer, Ohad Trabelsi:
Conditional Lower Bounds for All-Pairs Max-Flow. 42:1-42:15 - Amos Korman, Yoav Rodeh:
The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. 43:1-43:23 - Jean-Daniel Boissonnat, Karthik C. S.:
An Efficient Representation for Filtrations of Simplicial Complexes. 44:1-44:21 - Suguru Tamaki, Yuichi Yoshida:
Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues. 45:1-45:13 - Pankaj K. Agarwal, Kyle Fox, Oren Salzman:
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. 46:1-46:21 - David G. Harris:
Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma. 47:1-47:24 - Hossein Esfandiari, MohammadTaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, Krzysztof Onak:
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond. 48:1-48:23 - Jérémy Barbay, Pablo Pérez-Lantero:
Adaptive Computation of the Swap-Insert Correction Distance. 49:1-49:16 - Omer Gold, Micha Sharir:
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier. 50:1-50:17 - Lin Chen, Guochuan Zhang:
Packing Groups of Items into Multiple Knapsacks. 51:1-51:24 - Edith Cohen:
Stream Sampling Framework and Application for Frequency Cap Statistics. 52:1-52:40 - Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen:
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. 53:1-53:73 - Patrizio 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. 54:1-54:24 - Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese:
A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path. 55:1-55:23 - T.-H. Hubert Chan, Zhiyi Huang, Shaofeng H.-C. Jiang, Ning Kang, Zhihao Gavin Tang:
Online Submodular Maximization with Free Disposal. 56:1-56:29
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-04-22 20:03 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:
