@incollection{Thorup-Karger/00,
AUTHOR = {Thorup, Mikkel and Karger, David R.},
TITLE = {Dynamic graph algorithms with applications},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {1-9},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Feige/00a,
AUTHOR = {Feige, Uriel},
TITLE = {Coping with the $NP$-hardness of the graph bandwidth problem},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {10-19},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Ukkonen/00,
AUTHOR = {Ukkonen, Esko},
TITLE = {Toward complete genome data mining in computational biology},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {20-21},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Pagh/00a,
AUTHOR = {Pagh, Rasmus},
TITLE = {A new trade-off for deterministic dictionaries},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {22-31},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Iacono/00,
AUTHOR = {Iacono, John},
TITLE = {Improved upper bounds for pairing heaps},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {32-45},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Alstrup-Holm-Thorup/00,
AUTHOR = {Alstrup, Stephen and Holm, Jacob and Thorup, Mikkel},
TITLE = {Maintaining center and median in dynamic trees},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {46-56},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Brodal-Jacob/00,
AUTHOR = {Brodal, Gerth St{\o}lting and Jacob, Riko},
TITLE = {Dynamic planar convex hull with optimal query time and $O(\log n \cdot \log \log n)$ update time},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {57-70},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Aleksandrov-Djidjev/00,
AUTHOR = {Aleksandrov, Lyudmil G. and Djidjev, Hristo N.},
TITLE = {A dynamic algorithm for maintaining graph partitions},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {71-82},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Bender-Sethia-Skiena/00,
AUTHOR = {Bender, Michael A. and Sethia, Saurabh and Skiena, Steven},
TITLE = {Data structures for maintaining set partitions},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {83-96},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Alber-Bodlaender-Fernau-Niedermeier/00,
AUTHOR = {Alber, Jochen and Bodlaender, Hans L. and Fernau, Henning and Niedermeier, Rolf},
TITLE = {Fixed parameter algorithms for PLANAR DOMINATING SET and related problems},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {97-110},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_10},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Gupta-Nishimura-Proskurowski-Ragde/00,
AUTHOR = {Gupta, Arvind and Nishimura, Naomi and Proskurowski, Andrzej and Ragde, Prabhakar},
TITLE = {Embeddings of $k$-connected graphs of pathwidth $k$},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {111-124},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_11},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Nishimura-Ragde-Thilikos/00a,
AUTHOR = {Nishimura, Naomi and Ragde, Prabhakar and Thilikos, Dimitrios M.},
TITLE = {On graph powers for leaf-labeled trees},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {125-138},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_12},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Berry-Bordat-Heggernes/00,
AUTHOR = {Berry, Anne and Bordat, Jean-Paul and Heggernes, Pinar},
TITLE = {Recognizing weakly triangulated graphs by edge separability},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {139-149},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_13},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Kalyanasundaram-Noga-Pruhs-Woeginger/00,
AUTHOR = {Kalyanasundaram, Bala and Noga, John and Pruhs, Kirk and Woeginger, Gerhard},
TITLE = {Caching for web searching},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {150-163},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_14},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Azar-Epstein/00,
AUTHOR = {Azar, Yossi and Epstein, Leah},
TITLE = {On-line scheduling with precedence constraints},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {164-174},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_15},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Liberatore/00,
AUTHOR = {Liberatore, Vincenzo},
TITLE = {Scheduling jobs before shut-down},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {175-188},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_16},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Azar-Epstein-van_Stee/00,
AUTHOR = {Azar, Yossi and Epstein, Leah and van Stee, Rob},
TITLE = {Resource augmentation in load balancing},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {189-199},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_17},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Azar-Boyar-Favrholdt-Larsen-Nielsen/00,
AUTHOR = {Azar, Yossi and Boyar, Joan and Favrholdt, Lene M. and Larsen, Kim S. and Nielsen, Morten N.},
TITLE = {Fair versus Unrestricted Bin Packing},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {200-213},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_18},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Berman/00,
AUTHOR = {Berman, Piotr},
TITLE = {A $d/2$ approximation for maximum weight independent set in $d$-claw free graphs},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {214-219},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_19},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Peleg/00a,
AUTHOR = {Peleg, David},
TITLE = {Approximation algorithms for the Label-Cover$_{MAX}$ and Red-Blue Set Cover problems},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {220-230},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_20},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Hassin-Rubinstein/00a,
AUTHOR = {Hassin, Refael and Rubinstein, Shlomi},
TITLE = {Approximation algorithms for Maximum Linear Arrangement},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {231-236},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_21},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Doddi-Marathe-Ravi-Taylor-Widmayer/00,
AUTHOR = {Doddi, Srinivas R. and Marathe, Madhav V. and Ravi, S.S. and Taylor, David Scot and Widmayer, Peter},
TITLE = {Approximation algorithms for clustering to minimize the sum of diameters},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {237-250},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_22},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Hassin-Rubinstein/00b,
AUTHOR = {Hassin, Refael and Rubinstein, Shlomi},
TITLE = {Robust matchings and maximum clustering},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {251-258},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_23},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Irving-Manlove-Scott/00,
AUTHOR = {Irving, Robert W. and Manlove, David and Scott, Sandy},
TITLE = {The hospitals/residents problem with ties},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {259-271},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_24},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Dinitz-Nossenson/00,
AUTHOR = {Dinitz, Yefim and Nossenson, Ronit},
TITLE = {Incremental maintenance of the 5-edge-connectivity classes of a graph},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {272-285},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_25},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Ishii-Nagamochi/00,
AUTHOR = {Ishii, Toshimasa and Nagamochi, Hiroshi},
TITLE = {On the minimum augmentation of an $l$-connected graph to a $k$-connected graph},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {286-299},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_26},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Arata-Iwata-Makino-Fujishige/00,
AUTHOR = {Arata, Kouji and Iwata, Satoru and Makino, Kazuhisa and Fujishige, Satoru},
TITLE = {Locating sources to meet flow demands in undirected networks},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {300-313},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_27},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Gudmundsson-Levcopoulos-Narasimhan/00,
AUTHOR = {Gudmundsson, Joachim and Levcopoulos, Christos and Narasimhan, Giri},
TITLE = {Improved greedy algorithms for constructing sparse geometric spanners},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {314-327},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_28},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Agarwal-Guibas-Har-Peled-Rabinovitch-Sharir/00,
AUTHOR = {Agarwal, Pankaj K. and Guibas, Leonidas J. and Har-Peled, Sariel and Rabinovitch, Alexander and Sharir, Micha},
TITLE = {Computing the penetration depth of two convex polytopes in 3D},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {328-338},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_29},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Guibas-Snoeyink-Zhang/00,
AUTHOR = {Guibas, Leonidas J. and Snoeyink, Jack and Zhang, Li},
TITLE = {Compact Voronoi diagrams for moving convex polygons},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {339-352},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_30},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Arya-Cheng-Mount-Ramesh/00,
AUTHOR = {Arya, Sunil and Cheng, Siu-Wing and Mount, David M. and Ramesh, H.},
TITLE = {Efficient expected-case algorithms for planar point location},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {353-366},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_31},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Palios/00,
AUTHOR = {Palios, Leonidas},
TITLE = {A new competitive strategy for reaching the kernel of an unknown polygon},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {367-382},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_32},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Kao-Samet-Sung/00,
AUTHOR = {Kao, Ming-Yang and Samet, Jared and Sung, Wing-Kin},
TITLE = {The enhanced double digest problem for DNA physical mapping},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {383-392},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_33},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Shibuya/00,
AUTHOR = {Shibuya, Tetsuo},
TITLE = {Generalization of a suffix tree for RNA structural pattern matching},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {393-406},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_34},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Rick/00a,
AUTHOR = {Rick, Claus},
TITLE = {Efficient computation of all longest common subsequences},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {407-418},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_35},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Venkataraman-Sahni-Mukhopadhyaya/00,
AUTHOR = {Venkataraman, Gayathri and Sahni, Sartaj and Mukhopadhyaya, Srabani},
TITLE = {A blocked all-pairs shortest-paths algorithm},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {419-432},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_36},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Arge-Brodal-Toma/00,
AUTHOR = {Arge, Lars and Brodal, Gerth St{\o}lting and Toma, Laura},
TITLE = {On external-memory MST, SSSP, and multi-way planar graph separation},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {433-447},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_37},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Arge-Pagter/00,
AUTHOR = {Arge, Lars and Pagter, Jakob},
TITLE = {I/O-space trade-offs},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {448-461},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_38},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Suri-Sandholm-Warkhede/00,
AUTHOR = {Suri, Subhash and Sandholm, Tuomas and Warkhede, Priyank Ramesh},
TITLE = {Optimal flow aggregation},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {462-475},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_39},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Asano-Matsui-Tokuyama/00,
AUTHOR = {Asano, Tetsuo and Matsui, Tomomi and Tokuyama, Takeshi},
TITLE = {On the complexities of the optimal rounding problems of sequences and matrices},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {476-489},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_40},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Ahal-Rabinovich/00,
AUTHOR = {Ahal, Shlomo and Rabinovich, Yuri},
TITLE = {On the complexity of the sub-permutation problem},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {490-503},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_41},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Damaschke/00a,
AUTHOR = {Damaschke, Peter},
TITLE = {Parallel attribute-efficient learning of monotone Boolean functions},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {504-512},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_42},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Makino-Yamashita-Kameda/00,
AUTHOR = {Makino, Kazuhisa and Yamashita, Masafumi and Kameda, Tiko},
TITLE = {Max- and min-neighborhood monopolies},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {513-526},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_43},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Bjorklund/00,
AUTHOR = {Bj{\"o}rklund, Andreas},
TITLE = {Optimal adaptive fault diagnosis of hypercubes},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {527-534},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_44},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Stachowiak/00,
AUTHOR = {Stachowiak, Grzegorz},
TITLE = {Fibonacci correction networks},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {535-548},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_45},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Cicalese-Mundici-Vaccaro/00,
AUTHOR = {Cicalese, Ferdinando and Mundici, Daniele and Vaccaro, Ugo},
TITLE = {Least adaptive optimal search with unreliable tests},
BOOKTITLE = {Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT'2000 (Bergen, Norway, July 5-7, 2000)},
SERIES = {LNCS},
VOLUME = {1851},
PAGES = {549-562},
YEAR = {2000},
EDITOR = {Halld{\'o}rsson, Magn{\'u}s M.},
URL = {http://dx.doi.org/10.1007/3-540-44985-X_46},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}