@incollection{Boissonnat/00,
AUTHOR = {Boissonnat, Jean-Daniel},
TITLE = {Voronoi-based systems of coordinates and surface reconstruction},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {1-1},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/xn22rynfrc8cv8fg},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Cai/00a,
AUTHOR = {Cai, Jin-Yi},
TITLE = {Essentially every unimodular matrix defines an expander},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {2-22},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/g566bu7y4ncbb92c},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Bose-Czyzowicz-Gasieniec-Kranakis-Krizanc-Pelc-Vargas_Martin/00,
AUTHOR = {Bose, Prosenjit and Czyzowicz, Jurek and G{\c{a}}sieniec, Leszek and Kranakis, Evangelos and Krizanc, Danny and Pelc, Andrzej and Vargas Martin, Miguel},
TITLE = {Strategies for hotlink assignments},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {23-34},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/wh6b9vuth5t0tlu4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Law-Leiserson/00,
AUTHOR = {Law, Ching and Leiserson, Charles E.},
TITLE = {A new competitive analysis of randomized caching},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {35-46},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/a40d32xvcjyhp9ug},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Bose-Brodnik-Carlsson-Demaine-Fleischer-Lopez-Ortiz-Morin-Munro/00,
AUTHOR = {Bose, Prosenjit and Brodnik, Andrej and Carlsson, Svante and Demaine, Erik D. and Fleischer, Rudolf and L{\'o}pez-Ortiz, Alejandro and Morin, Pat and Munro, J. Ian},
TITLE = {Online routing in convex subdivisions},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {47-59},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/n4mqww96x2jk9hq7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Huang-Chen-Chen/00,
AUTHOR = {Huang, Jingui and Chen, Jianer and Chen, Songqiao},
TITLE = {A simple linear-time approximation algorithm for multi-processor job scheduling on four processors},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {60-71},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/1ywbp2hxnfp2t6np},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Osogami-Imai/00,
AUTHOR = {Osogami, Takayuki and Imai, Hiroshi},
TITLE = {Classification of various neighborhood operations for the nurse scheduling problem},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {72-83},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/emgcp62b6w4penf0},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Chen-Kao-Lu/00,
AUTHOR = {Chen, Yuyu and Kao, Ming-Yang and Lu, Hsueh-I.},
TITLE = {Optimal bid sequences for multiple-object auctions with unequal budgets},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {84-95},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/2l288jwej30v9fmr},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Cicalese-Vaccaro/00a,
AUTHOR = {Cicalese, Ferdinando and Vaccaro, Ugo},
TITLE = {Coping with delays and time-outs in binary search procedures},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {96-107},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/kqqek9wtqj97xqmg},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Chen-Zhu/00,
AUTHOR = {Chen, Zhixiang and Zhu, Binhai},
TITLE = {Some formal analysis of Rocchio's similarity-based relevance feedback algorithm},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {108-119},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/56dguv95nj1w8d40},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Horiyama-Ibaraki/00,
AUTHOR = {Horiyama, Takashi and Ibaraki, Toshihide},
TITLE = {Reasoning with ordered binary decision diagrams},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {120-131},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/lxuldtemf0jdnubb},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Chen-Kanj/00,
AUTHOR = {Chen, Jianer and Kanj, Iyad A.},
TITLE = {On approximating minimum vertex cover for graphs with perfect matching},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {132-143},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/wxn1bhwb7v9gv0la},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Deng-Li-Zang-Zhou/00,
AUTHOR = {Deng, Xiaotie and Li, Guojun and Zang, Wenan and Zhou, Yi},
TITLE = {A 2-approximation algorithm for path coloring on trees of rings},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {144-155},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/2v8e4q5x2areg4pg},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Wu-Lu-Lee/00,
AUTHOR = {Wu, Q.S. and Lu, C.L. and Lee, R.C.T.},
TITLE = {An approximate algorithm for the weighted Hamiltonian path completion problem on a tree},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {156-167},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/103cnuhn3aknv262},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Zhou-Nishizeki/00,
AUTHOR = {Zhou, Xiao and Nishizeki, Takao},
TITLE = {Finding independent spanning trees in partial $k$-trees},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {168-179},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/fj0uj8bxrj904v0r},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Niedermeier-Rossmanith/00b,
AUTHOR = {Niedermeier, Rolf and Rossmanith, Peter},
TITLE = {On efficient fixed parameter algorithms for WEIGHTED VERTEX COVER},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {180-191},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/uw1yu7kw1mahrket},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Thilikos-Serna-Bodlaender/00,
AUTHOR = {Thilikos, Dimitrios M. and Serna, Maria J. and Bodlaender, Hans L.},
TITLE = {Constructive linear time algorithms for small cutwidth and carving-width},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {192-203},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/ue9ha5gd10f7w3u5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Asano-Halldorsson-Iwama-Matsuda/00,
AUTHOR = {Asano, Takao and Halld{\'o}rsson, Magn{\'u}s M. and Iwama, Kazuo and Matsuda, Takeshi},
TITLE = {Approximation algorithms for the maximum power consumption problem on combinatorial circuits},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {204-215},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/hlbrllfm030f6815},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Kubo-Muramoto-Shimozono/00,
AUTHOR = {Kubo, Norihiro and Muramoto, Katsuhiro and Shimozono, Shinichi},
TITLE = {A simple and quick approximation algorithm for Traveling Salesman Problem in the plane},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {216-227},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/deay6bqn2vwf92nn},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Erlebach-Spieksma/00,
AUTHOR = {Erlebach, Thomas and Spieksma, Frits C.R.},
TITLE = {Simple algorithms for a weighted interval selection problem},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {228-240},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/82qdb8d944a5qcfy},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Lu-Peng-Tang/00,
AUTHOR = {Lu, Chin Lung and Peng, Sheng-Lung and Tang, Chuan Yi},
TITLE = {Efficient minus and signed domination in graphs},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {241-253},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/9jr65tlmmhd8cj40},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Miura-Nakano-Nishizeki/00,
AUTHOR = {Miura, Kazuyuki and Nakano, Shin-ichi and Nishizeki, Takao},
TITLE = {Convex grid drawings of four-connected plane graphs},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {254-265},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/h92y060tu4w5jbtv},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Hong-Eades/00,
AUTHOR = {Hong, Seok-Hee and Eades, Peter},
TITLE = {An algorithm for finding three dimensional symmetry in series parallel digraphs},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {266-277},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/93n3ht3n8phn9634},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Katsura-Kobayashi-Otto/00,
AUTHOR = {Katsura, Masashi and Kobayashi, Yuji and Otto, Friedrich},
TITLE = {Undecidability results for monoids with linear-time decidable word problems},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {278-289},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/uvdhd09x88b487yg},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Yoshikawa-Guo-Motegi-Igarashi/00,
AUTHOR = {Yoshikawa, Reina and Guo, Shimin and Motegi, Kazuhiro and Igarashi, Yoshihide},
TITLE = {Secret key exchange using random deals of cards on hierarchical structures},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {290-301},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/d4j1dh0vc5qpyq62},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Lu/00,
AUTHOR = {Lu, Chi-Jen},
TITLE = {Derandomizing Arthur-Merlin games under uniform assumptions},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {302-312},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/ca72p6767h4em1c3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Jackson-Jordan/00,
AUTHOR = {Jackson, Bill and Jord{\'a}n, Tibor},
TITLE = {A near optimal algorithm for vertex connectivity augmentation},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {313-325},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/gxdvehydt4l7mywf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Ishii-Nagamochi/00a,
AUTHOR = {Ishii, Toshimasa and Nagamochi, Hiroshi},
TITLE = {Simultaneous augmentation of two graphs to an $l$-edge-connected graph and a biconnected graph},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {326-337},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/6c7qbd5u3jvn4dqf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Ito-Ito-Itatsu-Uehara-Yokoyama/00,
AUTHOR = {Ito, Hiro and Ito, Motoyasu and Itatsu, Yuichiro and Uehara, Hideyuki and Yokoyama, Mitsuo},
TITLE = {Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {338-349},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/kbfhe25lt6y0lpfq},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Chen-Liu-Jia-Chen/00,
AUTHOR = {Chen, Jianer and Liu, Lihua and Jia, Weijia and Chen, Songqiao},
TITLE = {An intuitive and effective new representation for interconnection network structures},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {350-361},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/lqjj2pxjy1ggkbch},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Nakano-Olariu/00,
AUTHOR = {Nakano, Koji and Olariu, Stephan},
TITLE = {Randomized leader election protocols in radio networks with no collision detection},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {362-373},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/dry26dmltb6k34f2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{De_Marco-Pelc/00,
AUTHOR = {De Marco, Gianluca and Pelc, Andrzej},
TITLE = {Deterministic broadcasting time with partial knowledge of the network},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {374-385},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/l167x23xffu3qlnp},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Poon-Zhang/00,
AUTHOR = {Poon, Chung Keung and Zhang, Pixing},
TITLE = {Minimizing makespan in batch machine scheduling},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {386-397},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/xr01pr0bgrbjyk4f},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Jansen-Porkolab/00b,
AUTHOR = {Jansen, Klaus and Porkolab, Lorant},
TITLE = {Preemptive parallel task scheduling in $O(n) + Poly(m)$ time},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {398-409},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/k8pd7u82aqu2a15t},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Sadakane/00,
AUTHOR = {Sadakane, Kunihiko},
TITLE = {Compressed text databases with efficient query algorithms based on the compressed suffix array},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {410-421},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/kh8myh1dqjd88tkf},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Wolff-Thon-Xu/00,
AUTHOR = {Wolff, Alexander and Thon, Michael and Xu, Yinfeng},
TITLE = {A better lower bound for two-circle point labeling},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {422-431},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/dwvfyhp6t8rq9f7p},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Kim-Kim-Sugihara/00,
AUTHOR = {Kim, Deok-Soo and Kim, Donguk and Sugihara, Kokichi},
TITLE = {Voronoi diagram of a circle set constructed from Voronoi diagram of a point set},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {432-443},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/rjpafvm9wt4cqt8h},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Bose-Morin/00,
AUTHOR = {Bose, Prosenjit and Morin, Pat},
TITLE = {An improved algorithm for subdivision traversal without extra storage},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {444-455},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/jj3a2gk7ac396w2q},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Kristiansen-Telle/00,
AUTHOR = {Kristiansen, Petter and Telle, Jan Arne},
TITLE = {Generalized $H$-coloring of graphs},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {456-466},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/ac3anb16345luwwr},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Wang-Lin/00,
AUTHOR = {Wang, Biing-Feng and Lin, Jyh-Jye},
TITLE = {Finding a two-core of a tree in linear time},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {467-478},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/4t1x49hlxyxnmppa},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Kao-Lam-Sung-Ting/00a,
AUTHOR = {Kao, Ming-Yang and Lam, Tak-Wah and Sung, Wing-Kin and Ting, Hing-Fung},
TITLE = {Unbalanced and hierarchical bipartite matchings with applications to labeled tree comparison},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {479-490},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/8nvx6j9newxk6cc3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Chen-Hu-Xu/00,
AUTHOR = {Chen, Danny Z. and Hu, Xiaobo (Sharon) and Xu, Jinhui},
TITLE = {Optimal beam penetrations in two and three dimensions},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {491-502},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/t0je0v9mljqx71w3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Tan/00a,
AUTHOR = {Tan, Xuehou},
TITLE = {Searching a simple polygon by a $k$-searcher},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {503-514},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/fyku6rexb07r7mr3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Park-Lee-Chwa/00,
AUTHOR = {Park, Sang-Min and Lee, Jae-Ha and Chwa, Kyung-Yong},
TITLE = {Characterization of rooms searchable by two guards},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {515-526},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/122xcg3gqtaky4jg},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Hon-Kao-Lam/00,
AUTHOR = {Hon, Wing-Kai and Kao, Ming-Yang and Lam, Tak-Wah},
TITLE = {Improved phylogeny comparisons: Non-shared edges, nearest neighbor interchanges, and subtree transfers},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {527-538},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/277bw5dx0vv8aaja},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Lin-Kearney-Jiang/00,
AUTHOR = {Lin, Guo-Hui and Kearney, Paul E. and Jiang, Tao},
TITLE = {Phylogenetic $k$-root and Steiner $k$-root},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {539-551},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/v3jg6h2yxwnlmdc8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Katz-Nielsen-Segal/00,
AUTHOR = {Katz, Matthew J. and Nielsen, Frank and Segal, Michael},
TITLE = {Maintenance of a piercing set for intervals with applications},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {552-563},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/742txm72flbkrgrg},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Chen-Hu-Wu/00,
AUTHOR = {Chen, Danny Z. and Hu, Xiaobo (Sharon) and Wu, Xiaodong},
TITLE = {Optimal polygon cover problems and applications},
BOOKTITLE = {Proceedings of the 11th International Conference on Algorithms and Computation, ISAAC'2000 (Taipei, Taiwan, December 18-20, 2000)},
SERIES = {LNCS},
VOLUME = {1969},
PAGES = {564-576},
YEAR = {2000},
EDITOR = {Lee, D.T. and Teng, Shang-Hua},
URL = {http://www.springerlink.com/content/u7gp44hchuhly6yg},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}