Journal: ACM Transactions on Algorithms

Volume 2, Issue 4

491 -- 0Alejandro López-Ortiz, J. Ian Munro. Foreword
492 -- 509David Eppstein. Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
510 -- 534Richard F. Geary, Rajeev Raman, Venkatesh Raman. Succinct ordinal trees with level-ancestor queries
535 -- 556Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick. Melding priority queues
557 -- 577Surender Baswana, Sandeep Sen. Approximate distance oracles for unweighted graphs in expected ::::O::::(::::n:::::::2:::) time
578 -- 601Camil Demetrescu, Giuseppe F. Italiano. Experimental analysis of dynamic all pairs shortest path algorithms
602 -- 610Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch. Rank-maximal matchings
611 -- 639Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter. When indexing equals compression: Experiments with compressing suffix arrays and applications
640 -- 660Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor. A general approach to online network optimization problems
661 -- 678William S. Evans, David G. Kirkpatrick. Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ
679 -- 706René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking. Computing equilibria for a service provider game with (Im)perfect information
707 -- 723Cristopher Moore, Daniel N. Rockmore, Alexander Russell. Generic quantum Fourier transforms

Volume 2, Issue 3

297 -- 317Daniel Berend, Amir Sapir. The cyclic multi-peg Tower of Hanoi
318 -- 334Michael Drmota, Helmut Prodinger. The register function for ::::t::::-ary trees
335 -- 363Lukasz Kowalik, Maciej Kurowski. Oracles for bounded-length shortest paths in planar graphs
364 -- 379Irit Katriel, Hans Leo Bodlaender. Online topological ordering
380 -- 402Christian A. Duncan, Stephen G. Kobourov, V. S. Anil Kumar. Optimal constrained graph exploration
403 -- 415Venkatesh Raman, Saket Saurabh, C. R. Subramanian. Faster fixed parameter tractable algorithms for finding feedback vertex sets
416 -- 434Klaus Jansen, Hu Zhang. An approximation algorithm for scheduling malleable tasks under general precedence constraints
435 -- 472Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright. Secure multiparty computation of approximations
473 -- 489David S. Johnson. The NP-completeness column: The many limits on approximation

Volume 2, Issue 2

135 -- 152James F. Korsh, Paul LaFollette. A loopless Gray code for rooted trees
153 -- 177Noga Alon, Dana Moshkovitz, Shmuel Safra. Algorithmic construction of sets for ::::k::::-restrictions
178 -- 208Lap Chi Lau. Bipartite roots of graphs
209 -- 227Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun. Efficient algorithms for bichromatic separability
228 -- 243Leah Epstein, Rob van Stee. This side up!
244 -- 262Yumei Huo, Joseph Y.-T. Leung. Minimizing mean flow time for UET tasks
263 -- 281Refael Hassin, Danny Segev. Robust subgraphs for trees and paths
282 -- 295Yossi Azar, Yossi Richter. An improved algorithm for CIOQ switches

Volume 2, Issue 1

1 -- 13Joe Sawada. Generating rooted and free plane trees
14 -- 43Rajneesh Hegde. Finding 3-shredders efficiently
44 -- 65Jens Gramm, Jiong Guo, Rolf Niedermeier. Pattern matching for arc-annotated sequences
66 -- 78Refael Hassin, Asaf Levin. The minimum generalized vertex cover problem
79 -- 94Leah Epstein, Rob van Stee. Online scheduling of splittable tasks
95 -- 115Teofilo F. Gonzalez, Joseph Y.-T. Leung, Michael Pinedo. Minimizing total completion time on uniform machines with deadline constraints
116 -- 129Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai. Improved results for data migration and open shop scheduling
130 -- 134Samir Khuller. Problems column