ACM Transactions on Algorithms, Volume 2

Volume 2, Number 1, January 2006

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

Volume 2, Number 2, April 2006

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

Volume 2, Number 3, July 2006

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

Volume 2, Number 4, October 2006

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