@article{Jain-Mandoiu-Vazirani-Williamson/02,
AUTHOR = {Jain, Kamal and M{\u{a}}ndoiu, Ion and Vazirani, Vijay V. and Williamson, David P.},
TITLE = {A primal-dual schema based approximation algorithm for the element connectivity problem},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {1},
PAGES = {1-15},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Aspnes/02,
AUTHOR = {Aspnes, James},
TITLE = {Fast deterministic consensus in a noisy environment},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {1},
PAGES = {16-39},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kratovil-Tuza/02,
AUTHOR = {Kratov{\'{i}}l, Jan and Tuza, Zsolt},
TITLE = {On the complexity of bicoloring clique hypergraphs of graphs},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {1},
PAGES = {40-54},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hsu/02a,
AUTHOR = {Hsu, Tsan-sheng},
TITLE = {Simpler and faster biconnectivity augmentation},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {1},
PAGES = {55-71},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Halperin-Nathaniel-Zwick/02,
AUTHOR = {Halperin, Eran and Nathaniel, Ram and Zwick, Uri},
TITLE = {Coloring $k$-colorable graphs using relatively small palettes},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {1},
PAGES = {72-90},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Caprara-Italiano-Mohan-Panconesi-Srinivasan/02,
AUTHOR = {Caprara, Alberto and Italiano, Giuseppe F. and Mohan, G. and Panconesi, Alessandro and Srinivasan, Aravind},
TITLE = {Wavelength rerouting in optical networks, or the Venetian routing problem},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {93-125},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Caruso-Chessa-Maestrini-Santi/02,
AUTHOR = {Caruso, Antonio and Chessa, Stefano and Maestrini, Piero and Santi, Paolo},
TITLE = {Diagnosability of regular systems},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {126-143},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Wood/02,
AUTHOR = {Wood, David R.},
TITLE = {Degree constrained book embeddings},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {144-154},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Brinkmann-Caporossi-Hansen/02,
AUTHOR = {Brinkmann, Gunnar and Caporossi, Gilles and Hansen, Pierre},
TITLE = {A constructive enumeration of fusenes and benzenoids},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {155-166},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Jansen-Porkolab/02a,
AUTHOR = {Jansen, Klaus and Porkolab, Lorant},
TITLE = {Polynomial time approximation schemes for general multiprocessor job shop scheduling},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {167-191},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Feder-Motwani/02,
AUTHOR = {Feder, Tom{\'{a}}s and Motwani, Rajeev},
TITLE = {Worst-case time bounds for coloring and satisfiability problems},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {192-201},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Queyranne-Sviridenko/02,
AUTHOR = {Queyranne, Maurice and Sviridenko, Maxim},
TITLE = {A $(2 + \varepsilon)$-approximation algorithm for the generalized preemptive open shop problem with minsum objective},
JOURNAL = {J. Algorithms},
VOLUME = {45},
NUMBER = {2},
PAGES = {202-212},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Fill-Janson/02,
AUTHOR = {Fill, James Allen and Janson, Svante},
TITLE = {Quicksort asymptotics},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {1},
PAGES = {4-28},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chaissaing-Louchard/02,
AUTHOR = {Chaissaing, Philippe and Louchard, Guy},
TITLE = {Reflected Brownian bridge area conditioned on its local time at the origin},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {1},
PAGES = {29-51},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Neininger-Ruschendorf/02,
AUTHOR = {Neininger, Ralph and R{\"u}schendorf, Ludger},
TITLE = {Rates of convergence for Quicksort},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {1},
PAGES = {52-62},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Knessl-Szpankowski/02,
AUTHOR = {Knessl, Charles and Szpankowski, Wojciech},
TITLE = {Limit laws for the height in PATRICIA tries},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {1},
PAGES = {63-97},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Garefalakis-Panario/02,
AUTHOR = {Garefalakis, Theodoulos and Panario, Daniel},
TITLE = {Polynomials over finite fields free from large and small degree irreducible factors},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {1},
PAGES = {98-120},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hubalek-Hwang-Lew-Mahmoud-Prodinger/02,
AUTHOR = {Hubalek, Friedrich and Hwang, Hsien-Kuei and Lew, William and Mahmoud, Hosam and Prodinger, Helmut},
TITLE = {A multivariate view of random bucket digital search trees},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {1},
PAGES = {121-158},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Merlini-Sprugnoli/02,
AUTHOR = {Merlini, Donatella and Sprugnoli, Renzo},
TITLE = {Fountains and histograms},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {1},
PAGES = {159-176},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chern-Hwang-Tsai/02,
AUTHOR = {Chern, Hua-Huai and Hwang, Hsien-Kuei and Tsai, Tsung-Hsi},
TITLE = {An asymptotic theory for Cauchy-Euler differential equations with applicaitons to the analysis of algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {1},
PAGES = {177-225},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Duch-Martinez/02,
AUTHOR = {Duch, Amalia and Mart{\'{i}}nez, Conrado},
TITLE = {On the average performance of orthogonal range search in multidimensional data structures},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {1},
PAGES = {226-245},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bourdon-Daireaux-Vallee/02,
AUTHOR = {Bourdon, J{\'{e}}r{\'{e}}mie and Daireaux, Benoit and Vall{\'{e}}e, Brigitte},
TITLE = {Dynamical analysis of $\alpha$-Euclidean algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {1},
PAGES = {246-285},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{DellAmico-Finta/02,
AUTHOR = {Dell'Amico, Mauro and Finta, Lucian},
TITLE = {A linear time algorithm for scheduling outforests with communication delays on three processors},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {2},
PAGES = {287-307},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Csirik-Woeginger/02,
AUTHOR = {Csirik, J{\'{a}}nos and Woeginger, Gerhard J.},
TITLE = {Resource augmentation for online bounded space bin packing},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {2},
PAGES = {308-320},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Grolmusz/02,
AUTHOR = {Grolmusz, Vince},
TITLE = {Constructing set systems with prescribed intersection sizes},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {2},
PAGES = {321-337},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Anderson-Kannan-Karloff-Ladner/02,
AUTHOR = {Anderson, Richard and Kannan, Sampath and Karloff, Howard and Ladner, Richard E.},
TITLE = {Thresholds and optimal binary comparison search trees},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {2},
PAGES = {338-358},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Wu/02,
AUTHOR = {Wu, Bang Ye},
TITLE = {A polynomial time approximation scheme for the two-source minimum routing cost spanning trees},
JOURNAL = {J. Algorithms},
VOLUME = {44},
NUMBER = {2},
PAGES = {359-378},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hsu/02,
AUTHOR = {Hsu, Wen-Lian},
TITLE = {A simple test for the consecutive ones property},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {1},
PAGES = {1-16},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Heun-Mayr/02,
AUTHOR = {Heun, Volker and Mayr, Ernst W.},
TITLE = {Embedding graphs with bounded treewidth into their optimal hypercubes},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {1},
PAGES = {17-50},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Heun-Mayr/02a,
AUTHOR = {Heun, Volker and Mayr, Ernst W.},
TITLE = {Efficient dynamic embeddings of binary trees into hypercubes},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {1},
PAGES = {51-84},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Irving-Manlove/02,
AUTHOR = {Irving, Robert W. and Manlove, David F.},
TITLE = {The stable roommates problem with ties},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {1},
PAGES = {85-105},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bodlaender-Kratsch/02,
AUTHOR = {Bodlaender, Hans L. and Kratsch, Dieter},
TITLE = {Kayles and Nimbers},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {1},
PAGES = {106-119},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Coffman-Jelenkovic-Momcilovic/02,
AUTHOR = {Coffman, E.G., Jr. and Jelenkovi{\'c}, Predrag and Mom{\v{c}}ilovi{\'c}, Petar},
TITLE = {The dynamic stream merging algorithm},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {1},
PAGES = {120-137},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Gaur-Ibaraki-Krishnamurti/02,
AUTHOR = {Gaur, Daya Ram and Ibaraki, Toshihide and Krishnamurti, Ramesh},
TITLE = {Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {1},
PAGES = {138-152},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Makino/02,
AUTHOR = {Makino, Kazuhisa},
TITLE = {A linear time algorithm for recognizing regular Boolean functions},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {2},
PAGES = {155-176},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chrobak-Gasieniec-Rytter/02,
AUTHOR = {Chrobak, Marek and G{\c{a}}sieniec, Leszek and Rytter, Wojciech},
TITLE = {Fast broadcasting and gossiping in radio networks},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {2},
PAGES = {177-189},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bodlaender-Fomin/02,
AUTHOR = {Bodlaender, Hans L. and Fomin, Fedor V.},
TITLE = {Approximation of pathwidth of outerplanar graphs},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {2},
PAGES = {190-200},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Feige-Karpinski-Langberg/02,
AUTHOR = {Feige, Uriel and Karpinski, Marek and Langberg, Michael},
TITLE = {Improved approximation of Max-Cut on graphs of bounded degree},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {2},
PAGES = {201-219},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Stearns-Hunt/02,
AUTHOR = {Stearns, Richard E. and Hunt III, Harry B.},
TITLE = {Exploiting structure in quantified formulas},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {2},
PAGES = {220-263},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Liben-Nowell/02,
AUTHOR = {Liben-Nowell, David},
TITLE = {Gossip is synteny: Incomplete gossip and the syntenic distance between genomes},
JOURNAL = {J. Algorithms},
VOLUME = {43},
NUMBER = {2},
PAGES = {264-283},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Meyer-Sibeyn/02,
AUTHOR = {Meyer, Ulrich and Sibeyn, Jop F.},
TITLE = {Oblivious gossiping on Tori},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {1},
PAGES = {1-19},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bar-Yehuda-Rawitz/02,
AUTHOR = {Bar-Yehuda, Reuven and Rawitz, Dror},
TITLE = {Approximating element-weighted vertex deletion problems for the complete $k$-partite property},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {1},
PAGES = {20-40},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Nykanen-Ukkonen/02,
AUTHOR = {Nyk{\"a}nen, Matti and Ukkonen, Esko},
TITLE = {The exact path length problem},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {1},
PAGES = {41-53},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Arata-Iwata-Makino-Fujishige/02,
AUTHOR = {Arata, Kouji and Iwata, Satoru and Makino, Kazuhisa and Fujishige, Satoru},
TITLE = {Locating sources to meet flow demands in undirected networks},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {1},
PAGES = {54-68},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Nishimura-Ragde-Thilikos/02,
AUTHOR = {Nishimura, Naomi and Ragde, Prabhakar and Thilikos, Dimitrios M.},
TITLE = {On graph powers for leaf-labeled trees},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {1},
PAGES = {69-108},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Halperin-Sharir-Goldberg/02,
AUTHOR = {Halperin, Dan and Sharir, Micha and Goldberg, Ken},
TITLE = {The 2-center problem with obstacles},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {1},
PAGES = {109-134},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Liu/02b,
AUTHOR = {Liu, Pangfeng},
TITLE = {Broadcast scheduling optimization for heterogeneous cluster systems},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {1},
PAGES = {135-152},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Subramanian-Madhavan/02,
AUTHOR = {Subramanian, C.R. and Madhavan, C.E. Veni},
TITLE = {General partitioning on random graphs},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {1},
PAGES = {153-172},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Asano-Williamson/02,
AUTHOR = {Asano, Takao and Williamson, David P.},
TITLE = {Improved approximation algorithms for MAX SAT},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {1},
PAGES = {173-202},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Thorup/02a,
AUTHOR = {Thorup, Mikkel},
TITLE = {Randomized sorting in $O(n \log\log n)$ time and linear space using addition, shift, and bit-wise Boolean operations},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {2},
PAGES = {205-230},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Baker-Giancarlo/02,
AUTHOR = {Baker, Brenda S. and Giancarlo, Raffaele},
TITLE = {Sparse dynamic programming for longest common subsequence from fragments},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {2},
PAGES = {231-254},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Damian-Iordache-Pemmaraju/02,
AUTHOR = {Damian-Iordache, Mirela and Pemmaraju, Sriram V.},
TITLE = {$A(2+\varepsilon)$-approximation scheme for minimum domination on circle graphs},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {2},
PAGES = {255-276},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bradford-Golin-Larmore-Rytter/02,
AUTHOR = {Bradford, Phil and Golin, Mordecai J. and Larmore, Lawrence L. and Rytter, Wojciech},
TITLE = {Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {2},
PAGES = {277-303},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bahig-Nakamula/02,
AUTHOR = {Bahig, Hatem M. and Nakamula, Ken},
TITLE = {Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {2},
PAGES = {304-316},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
NOTE = {see Erratum in J. Algorithms, Vol. 47, 2003, No. 1, 60-61},
}
@article{Pippenger/02,
AUTHOR = {Pippenger, Nicholas},
TITLE = {Analysis of carry propagation in addition: An elementary approach},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {2},
PAGES = {317-333},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Halldorsson-Kortsarz/02,
AUTHOR = {Halld{\'{o}}rsson, Magn{\'{u}}s M. and Kortsarz, Guy},
TITLE = {Tools for multicoloring with applications to planar graphs and partial $k$-trees},
JOURNAL = {J. Algorithms},
VOLUME = {42},
NUMBER = {2},
PAGES = {334-366},
YEAR = {2002},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}