Journal: J. Algorithms

Volume 45, Issue 2

93 -- 125Alberto Caprara, Giuseppe F. Italiano, G. Mohan, Alessandro Panconesi, Aravind Srinivasan. Wavelength rerouting in optical networks, or the Venetian Routing problem
126 -- 143Antonio Caruso, Stefano Chessa, Piero Maestrini, Paolo Santi. Diagnosability of regular systems
144 -- 154David R. Wood. Degree constrained book embeddings
155 -- 166Gunnar Brinkmann, Gilles Caporossi, Pierre Hansen. A constructive enumeration of fusenes and benzenoids
167 -- 191Klaus Jansen, Lorant Porkolab. Polynomial time approximation schemes for general multiprocessor job shop scheduling
192 -- 201Tomás Feder, Rajeev Motwani. Worst-case time bounds for coloring and satisfiability problems
202 -- 212Maurice Queyranne, Maxim Sviridenko. A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective

Volume 45, Issue 1

1 -- 15Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson. A primal-dual schema based approximation algorithm for the element connectivity problem
16 -- 39James Aspnes. Fast deterministic consensus in a noisy environment
40 -- 54Jan Kratochvíl, Zsolt Tuza. On the complexity of bicoloring clique hypergraphs of graphs
55 -- 71Tsan-sheng Hsu. Simpler and faster biconnectivity augmentation
72 -- 90Eran Halperin, Ram Nathaniel, Uri Zwick. Coloring k-colorable graphs using relatively small palettes