@article{Larmore-Przytycka/98,
AUTHOR = {Larmore, Lawrence L. and Przytycka, Teresa M.},
TITLE = {The optimal alphabetic tree problem revisited},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {1},
PAGES = {1-20},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Zhang/98,
AUTHOR = {Zhang, Yanjun},
TITLE = {The variance of two game tree algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {1},
PAGES = {21-39},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kutten-Peleg/98,
AUTHOR = {Kutten, Shay and Peleg, David},
TITLE = {Fast distributed construction of small $k$-dominating sets and applications},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {1},
PAGES = {40-66},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Awerbuch-Bartal-Fiat/98,
AUTHOR = {Awerbuch, Baruch and Bartal, Yair and Fiat, Amos},
TITLE = {Distributed paging for general networks},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {1},
PAGES = {67-104},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Fernandes/98,
AUTHOR = {Fernandes, Cristina G.},
TITLE = {A better approximation ratio for the minimum size $k$-edge-connected spanning subgraph problem},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {1},
PAGES = {105-124},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kolliopoulos-Stein/98,
AUTHOR = {Kolliopoulos, Stavros G. and Stein, Clifford},
TITLE = {Finding real-valued single-source shortest paths in $o(n^3)$ expected time},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {1},
PAGES = {125-141},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Marathe-Ravi-Sundaram-Ravi-Rosenkrantz-Hunt/98,
AUTHOR = {Marathe, Madhav V. and Ravi, R. and Sundaram, Ravi and Ravi, S.S. and Rosenkrantz, Daniel J. and Hunt III, Harry B.},
TITLE = {Bicriteria network design problems},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {1},
PAGES = {142-171},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Foata-Han/98,
AUTHOR = {Foata, Dominique and Han, Guo-Niu},
TITLE = {Transformations on words},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {1},
PAGES = {172-191},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Khuller/98,
AUTHOR = {Khuller, Samir},
TITLE = {Problems},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {1},
PAGES = {192-195},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Berkman-Matias-Ragde/98,
AUTHOR = {Berkman, Omer and Matias, Yossi and Ragde, Prabhakar},
TITLE = {Triply-logarithmic parallel upper and lower bounds for minimum and range minima over small domains},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {2},
PAGES = {197-215},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Ho-Sung-Hsu-Tsai-Hwang/98,
AUTHOR = {Ho, Tung-Yang and Sung, Ting-Yi and Hsu, Lih-Hsing and Tsai, Chang-Hsiung and Hwang, Jeng-Yan},
TITLE = {The recognition of double Euler trails in series-parallel networks},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {2},
PAGES = {216-257},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chen/98c,
AUTHOR = {Chen, Jing-Chao},
TITLE = {Quadripartite sort},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {2},
PAGES = {258-271},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kloks-Kratsch-Wong/98,
AUTHOR = {Kloks, T. and Kratsch, D. and Wong, C.K.},
TITLE = {Minimum fill-in on circle and circular-arc graphs},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {2},
PAGES = {272-289},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Gazit-Reif/98,
AUTHOR = {Gazit, Hillel and Reif, John H.},
TITLE = {A randomized parallel algorithm for planar graph isomorphism},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {2},
PAGES = {290-314},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Mitra-Nandy/98,
AUTHOR = {Mitra, Pinaki and Nandy, Subhas C.},
TITLE = {Efficient computation of rectilinear geodesic Voronoi neighbor in the presence of obstacles},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {2},
PAGES = {315-338},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Bar-Noy-Kortsarz/98,
AUTHOR = {Bar-Noy, Amotz and Kortsarz, Guy},
TITLE = {Minimum color sum of bipartite graphs},
JOURNAL = {J. Algorithms},
VOLUME = {28},
NUMBER = {2},
PAGES = {339-365},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}