@article{Borchers-Du-Gao-Wan/98,
AUTHOR = {Borchers, Al and Du, Ding-Zhu and Gao, Biao and Wan, Pengjun},
TITLE = {The $k$-Steiner ratio in the rectilinear plane},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {1},
PAGES = {1-17},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Breslauer-Colussi-Toniolo/98,
AUTHOR = {Breslauer, Dany and Colussi, Livio and Toniolo, Laura},
TITLE = {On the comparison complexity of the string prefix-matching problem},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {1},
PAGES = {18-67},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Rajasekaran/98a,
AUTHOR = {Rajasekaran, Sanguthevar},
TITLE = {Selection on mesh connected computers with fixed and reconfigurable buses},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {1},
PAGES = {68-81},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Arikati-Chaudhuri-Zaroliagis/98,
AUTHOR = {Arikati, Srinivasa R. and Chaudhuri, Shiva and Zaroliagis, Christos D.},
TITLE = {All-pairs min-cut in sparse networks},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {1},
PAGES = {82-110},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kearney-Corneil/98,
AUTHOR = {Kearney, Paul E. and Corneil, Derek G.},
TITLE = {Tree powers},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {1},
PAGES = {111-131},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Lu-Ravi/98,
AUTHOR = {Lu, Hsueh-I and Ravi, R.},
TITLE = {Approximating maximum leaf spanning trees in almost linear time},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {1},
PAGES = {132-141},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kao-Ma-Sipser-Yin/98,
AUTHOR = {Kao, Ming-Yang and Ma, Yuan and Sipser, Michael and Yin, Yiqun},
TITLE = {Optimal constructions of hybrid algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {1},
PAGES = {142-164},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Walsh/98,
AUTHOR = {Walsh, Timothy R.},
TITLE = {Generation of well-formed parenthesis strings in constant worst-case time},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {1},
PAGES = {165-173},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hochbaum/98,
AUTHOR = {Hochbaum, Dorit S.},
TITLE = {Approximating clique and biclique problems},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {1},
PAGES = {174-200},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Schieber/98,
AUTHOR = {Schieber, Baruch},
TITLE = {Computing a minimum weight $k$-link path in graphs with the concave Monge property},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {2},
PAGES = {204-222},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kannan-Proebsting/98,
AUTHOR = {Kannan, Sampath and Proebsting, Todd},
TITLE = {Register allocation in structured programs},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {2},
PAGES = {223-237},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chew-Kedem-Sharir-Tagansky-Welzl/98,
AUTHOR = {Chew, L. Paul and Kedem, Klara and Sharir, Micha and Tagansky, Boaz and Welzl, Emo},
TITLE = {Voronoi diagrams of lines in 3-space under polyhedral convex distance functions},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {2},
PAGES = {238-255},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Andersson-Petersson/98,
AUTHOR = {Andersson, Arne and Petersson, Ola},
TITLE = {Approximate indexed lists},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {2},
PAGES = {256-276},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Lueker/98,
AUTHOR = {Lueker, George S.},
TITLE = {Average-case analysis of off-line and on-line knapsack problems},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {2},
PAGES = {277-305},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Ajtai-Aspnes-Naor-Rabani-Schulman-Waarts/98,
AUTHOR = {Ajtai, Miklos and Aspnes, James and Naor, Moni and Rabani, Yuval and Schulman, Leonard J. and Waarts, Orli},
TITLE = {Fairness in scheduling},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {2},
PAGES = {306-357},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Aiello-Rajagopalan-Venkatesan/98,
AUTHOR = {Aiello, William and Rajagopalan, S. Raj and Venkatesan, Ramarathnam},
TITLE = {Design of practical and provably good random number generators},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {2},
PAGES = {358-389},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kahale-Leighton/98,
AUTHOR = {Kahale, Nabil and Leighton, Tom},
TITLE = {Greedy dynamic routing on arrays},
JOURNAL = {J. Algorithms},
VOLUME = {29},
NUMBER = {2},
PAGES = {390-410},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@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},
}
@article{Gavoille-Guevremont/98,
AUTHOR = {Gavoille, Cyril and Gu{\'{e}}vremont, Eric},
TITLE = {Worst case bounds for shortest path interval routing},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {1},
PAGES = {1-25},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Galluccio-Loebl/98,
AUTHOR = {Galluccio, Anna and Loebl, Martin},
TITLE = {Even directed cycles in $H$-free digraphs},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {1},
PAGES = {26-41},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Dor/98,
AUTHOR = {Dor, Avner},
TITLE = {The greedy search algorithm on binary vectors},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {1},
PAGES = {42-60},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Motwani/98,
AUTHOR = {Motwani, Rajeev},
TITLE = {Realization of matrices and directed graphs},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {1},
PAGES = {61-74},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Albers-Koga/98,
AUTHOR = {Albers, Susanne and Koga, Hisashi},
TITLE = {New on-line algorithms for the page replication problem},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {1},
PAGES = {75-96},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hebert/98,
AUTHOR = {Hebert, D.J.},
TITLE = {Cyclic interlaced quadtree algorithms for Quincunx multiresolution},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {1},
PAGES = {97-128},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Gordon/98,
AUTHOR = {Gordon, Daniel M.},
TITLE = {A survey of fast exponentiation methods},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {1},
PAGES = {129-146},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chan/98b,
AUTHOR = {Chan, Timothy M.},
TITLE = {Deterministic algorithms for 2-d convex programming and 3-d online linear programming},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {1},
PAGES = {147-166},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Propp-Wilson/98,
AUTHOR = {Propp, James Gary and Wilson, David Bruce},
TITLE = {How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {2},
PAGES = {170-217},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kenyon-Rabani-Sinclair/98,
AUTHOR = {Kenyon, Claire and Rabani, Yuval and Sinclair, Alistair},
TITLE = {Biased random walks, Lyapunov functions, and stochastic analysis of Best Fit bin packing},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {2},
PAGES = {218-235},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Kamath-Palmon-Plotkin/98,
AUTHOR = {Kamath, Anil and Palmon, Omri and Plotkin, Serge},
TITLE = {Routing and admission control in general topology networks with poisson arrivals},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {2},
PAGES = {236-258},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Panigrahy-Vishwanathan/98,
AUTHOR = {Panigrahy, Rina and Vishwanathan, Sundar},
TITLE = {An $O(\log^* n)$ approximation algorithm for the asymmetric $p$-center problem},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {2},
PAGES = {259-268},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Galinescu-Fernandes-Finkler-Karloff/98,
AUTHOR = {G{\u{a}}linescu, Gruia and Fernandes, Cristina G. and Finkler, Ulrich and Karloff, Howard},
TITLE = {A better approximation algorithm for finding planar subgraphs},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {2},
PAGES = {269-302},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Levcopoulos-Krznaric/98a,
AUTHOR = {Levcopoulos, Christos and Krznaric, Drago},
TITLE = {Quasi-greedy triangulations approximating the minimum weight triangulation},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {2},
PAGES = {303-338},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Lupton-Maley-Young/98,
AUTHOR = {Lupton, Robert and Maley, F. Miller and Young, Neal},
TITLE = {Data collection for the Sloan Digital Sky Survey --- A network-flow heuristic},
JOURNAL = {J. Algorithms},
VOLUME = {27},
NUMBER = {2},
PAGES = {339-356},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{MacKenzie-Stout/98,
AUTHOR = {MacKenzie, Philip D. and Stout, Quentin F.},
TITLE = {Ultrafast expected time parallel algorithms},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {1},
PAGES = {1-33},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Sunder-He/98,
AUTHOR = {Sunder, Sivaprakasam and He, Xin},
TITLE = {Scheduling interval ordered tasks in parallel},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {1},
PAGES = {34-47},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Gabow/98,
AUTHOR = {Gabow, Harold N.},
TITLE = {Algorithms for graphic polymatroids and parametric $\bar{s}$-sets},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {1},
PAGES = {48-86},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Auletta-Parente-Persiano/98,
AUTHOR = {Auletta, Vincenzo and Parente, Domenico and Persiano, Giuseppe},
TITLE = {Placing resources on a growing line},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {1},
PAGES = {87-100},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Elmallah-Stewart/98,
AUTHOR = {Elmallah, E.S. and Stewart, L.K.},
TITLE = {Polygon graph recognition},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {1},
PAGES = {101-140},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Agarwal-Condon/98,
AUTHOR = {Agarwal, Sameet and Condon, Anne},
TITLE = {On approximation algorithms for hierarchical MAX-SAT},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {1},
PAGES = {141-165},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chen/98a,
AUTHOR = {Chen, Zhi-Zhong},
TITLE = {Efficient approximation schemes for maximization problems on $K_{3,3}$-free or $K_5$-free graphs},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {1},
PAGES = {166-187},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Goldberg-Goldberg-Phillips-Sorkin/98,
AUTHOR = {Goldberg, Leslie Ann and Goldberg, Paul W. and Phillips, Cynthia A. and Sorkin, Gregory B.},
TITLE = {Constructing computer virus phylogenies},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {1},
PAGES = {188-208},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Mirolo/98,
AUTHOR = {Mirolo, Claudio},
TITLE = {Convex minimization on a grid and applications},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {2},
PAGES = {209-237},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Hunt-Marathe-Radhakrishnan-Ravi-Rosenkrantz-Stearns/98,
AUTHOR = {Hunt III, Harry B. and Marathe, Madhav V. and Radhakrishnan, Venkatesh and Ravi, S.S. and Rosenkrantz, Daniel J. and Stearns, Richard E.},
TITLE = {$NC$-approximation schemes for $NP$- and PSPACE-hard problems for geometric graphs},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {2},
PAGES = {238-274},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Squire/98,
AUTHOR = {Squire, Matthew B.},
TITLE = {Generating the acyclic orientations of a graph},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {2},
PAGES = {275-290},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Makino-Ibaraki/98,
AUTHOR = {Makino, Kazuhisa and Ibaraki, Toshihide},
TITLE = {A fast and simple algorithm for identifying 2-monotonic positive Boolean functions},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {2},
PAGES = {291-305},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{McKay/98,
AUTHOR = {McKay, Brendan D.},
TITLE = {Isomorph-free exhaustive generation},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {2},
PAGES = {306-324},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Narayanan-Nishimura/98,
AUTHOR = {Narayanan, Lata and Nishimura, Naomi},
TITLE = {Interval routing on $k$-trees},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {2},
PAGES = {325-369},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Chen/98b,
AUTHOR = {Chen, Weimin},
TITLE = {More efficient algorithm for ordered tree inclusion},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {2},
PAGES = {370-385},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}
@article{Aspnes-Hurwood/98,
AUTHOR = {Aspnes, James and Hurwood, William},
TITLE = {Spreading rumors rapidly despite an adversary},
JOURNAL = {J. Algorithms},
VOLUME = {26},
NUMBER = {2},
PAGES = {386-411},
YEAR = {1998},
PUBLISHER = {Academic Press},
ADDRESS = {San Diego-London},
}