default search action
ACM Transactions on Algorithms, Volume 6
Volume 6, Number 1, December 2009
- Irene Finocchi
, Fabrizio Grandoni
Resilient dictionaries. 1:1-1:19 - Erik D. Demaine, Shay Mozes
An optimal decomposition algorithm for tree edit distance. 2:1-2:19 - Philip Bille, Rolf Fagerberg, Inge Li Gørtz
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. 3:1-3:14 - Amalia Duch, Conrado Martínez
Updating relaxed K-d trees. 4:1-4:24 - Zeev Nutov:
Approximating connectivity augmentation problems. 5:1-5:19 - Camil Demetrescu, Irene Finocchi
Trading off space for passes in graph streaming problems. 6:1-6:17 - Seth Pettie:
Low distortion spanners. 7:1-7:22 - Kurt Mehlhorn, Dimitrios Michail
Minimum cycle bases: Faster and simpler. 8:1-8:13 - Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca
Exponential time algorithms for the minimum dominating set problem on some graph classes. 9:1-9:21 - Ho-Leung Chan, Joseph Wun-Tat Chan, Tak Wah Lam
Optimizing throughput and energy in online deadline scheduling. 10:1-10:22 - Noga Alon, Yossi Azar, Shai Gutner:
Admission control to minimize rejections and online set cover with repetitions. 11:1-11:13 - David Hay, Gabriel Scalosub:
Jitter regulation for multiple streams. 12:1-12:19 - Luca Becchetti
Latency-constrained aggregation in sensor networks. 13:1-13:20 - Rami Cohen, Dror Rawitz, Danny Raz:
Time-dependent multi-scheduling of multicast. 14:1-14:22 - Iftah Gamzu, Danny Segev:
Improved online algorithms for the sorting buffer problem on line metrics. 15:1-15:14 - Konstantin Andreev, Charles Garrod, Daniel Golovin, Bruce M. Maggs, Adam Meyerson:
Simultaneous source location. 16:1-16:17 - Wolfgang W. Bein, Mordecai J. Golin
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. 17:1-17:22 - Refael Hassin, Asaf Levin
Approximating the minimum quadratic assignment problems. 18:1-18:10 - Gorjan Alagic
Quantum algorithms for Simon's problem over nonabelian groups. 19:1-19:15 - László Babai
Computing rank-convolutions with a mask. 20:1-20:13 - F. Thomas Bruss, Guy Louchard, Mark Daniel Ward:
Inverse auctions: Injecting unique minima into random sets. 21:1-21:19
Volume 6, Number 2, March 2010
- Susanne Albers:
Editorial Note. 22:1 - Claire Mathieu:
Foreword to special issue SODA 2009. 23:1 - Sergio Cabello
Finding shortest contractible and shortest separating cycles in embedded graphs. 24:1-24:18 - James Aspnes, Keren Censor:
Approximate shared-memory counting despite a strong adversary. 25:1-25:23 - Timothy M. Chan:
Comparison-based time-space lower bounds for selection. 26:1-26:16 - Ashish Goel, Michael Kapralov
Perfect matchings via uniform sampling in regular bipartite graphs. 27:1-27:13 - Benjamin Aminof, Orna Kupferman, Robby Lampert:
Reasoning about online algorithms with weighted automata. 28:1-28:36 - Dániel Marx:
Approximating fractional hypertree width. 29:1-29:17 - Philip N. Klein, Shay Mozes
Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm. 30:1-30:18 - Konstantinos Panagiotou, Angelika Steger:
Maximal biconnected subgraphs of random planar graphs. 31:1-31:21 - Stéphan Thomassé:
A 4k2 kernel for feedback vertex set. 32:1-32:8 - Omid Madani, Mikkel Thorup, Uri Zwick:
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. 33:1-33:25 - Alon Shalita, Uri Zwick
Efficient algorithms for the 2-gathering problem. 34:1-34:20 - Nikhil Bansal, Ning Chen, Neva Cherniavsky
Dynamic pricing for impatient bidders. 35:1-35:21 - Yossi Azar, Iftah Gamzu, Shai Gutner:
Truthful unsplittable flow for large capacity networks. 36:1-36:20 - Zoya Svitkina, Éva Tardos:
Facility location with hierarchical facility costs. 37:1-37:22 - George Christodoulou
Mechanism design for fractional scheduling on unrelated machines. 38:1-38:18 - Amos Korman:
Labeling schemes for vertex connectivity. 39:1-39:10 - Ayelet Butman, Danny Hermelin
Optimization problems in multiple-interval graphs. 40:1-40:18 - Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi:
Dial a Ride from k-forest. 41:1-41:21 - Bruce A. Bobier, Joe Sawada:
A fast algorithm to generate open meandric systems and meanders. 42:1-42:12 - Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp:
Periodicity testing with sublinear samples and space. 43:1-43:14
Volume 6, Number 3, June 2010
- Virginia Vassilevska, Ryan Williams
Finding heaviest H-subgraphs in real weighted graphs, with applications. 44:1-44:23 - Frank Ruskey
An explicit universal cycle for the (n-1)-permutations of an n-set. 45:1-45:12 - Matthew Drescher, Adrian Vetta:
An approximation algorithm for the maximum leaf spanning arborescence problem. 46:1-46:18 - Joseph Naor, Roy Schwartz:
The directed circular arrangement problem. 47:1-47:22 - Yossi Azar, Shay Kutten, Boaz Patt-Shamir:
Distributed error confinement. 48:1-48:23 - Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, An Zhu:
Achieving anonymity via clustering. 49:1-49:19 - Eyal Gordon, Adi Rosén:
Competitive weighted throughput analysis of greedy protocols on DAGs. 50:1-50:22 - Amit Chakrabarti
A near-optimal algorithm for estimating the entropy of a stream. 51:1-51:21 - Shahar Fattal, Dana Ron
Approximating the distance to monotonicity in high dimensions. 52:1-52:37 - Conrado Martínez
Adaptive sampling strategies for quickselects. 53:1-53:45 - Noga Alon, Shai Gutner:
Balanced families of perfect hash functions and their applications. 54:1-54:12 - Don Coppersmith, Lisa Fleischer, Atri Rudra:
Ordering by weighted number of wins gives a good ranking for weighted tournaments. 55:1-55:13 - Arturo Gonzalez-Gutierrez
Approximating corridors and tours via restriction and relaxation techniques. 56:1-56:36
Volume 6, Number 4, August 2010
- Susanne Albers:
Editorial note. 57:1 - Mohammad Taghi Hajiaghayi, Shang-Hua Teng:
Foreword to special issue on SODA 2008. 58:1 - Marcel R. Ackermann
Clustering for metric and nonmetric distance measures. 59:1-59:26 - Reid Andersen:
A local algorithm for finding dense subgraphs. 60:1-60:12 - Sergio Cabello
Finding one tight cycle. 61:1-61:13 - Timothy M. Chan:
On the bichromatic k-set problem. 62:1-62:20 - Kenneth L. Clarkson:
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. 63:1-63:30 - Yuval Emek, David Peleg, Liam Roditty:
A near-linear-time algorithm for computing replacement paths in planar directed graphs. 64:1-64:13 - Ulrich Faigle, Britta Peis:
Two-phase greedy algorithms for some classes of combinatorial linear programs. 65:1-65:13 - Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina:
On distributing symmetric streaming computations. 66:1-66:19 - Steve Oudot
Geodesic delaunay triangulations in bounded planar domains. 67:1-67:47 - Bruce M. Kapron
Fast asynchronous Byzantine agreement and leader election with full information. 68:1-68:28 - Zoya Svitkina:
Lower-bounded facility location. 69:1-69:16 - Virginia Vassilevska Williams:
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule. 70:1-70:24 - Pankaj K. Agarwal, Sariel Har-Peled
Hausdorff distance under translation for points and balls. 71:1-71:26 - John Gunnar Carlsson, Benjamin Armbruster, Yinyu Ye:
Finding equitable convex partitions of points in a polygon efficiently. 72:1-72:19
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-12-26 00:56 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: