Chen, Jing-Chao Proportion extend sort. (English) Zbl 0992.68038 SIAM J. Comput. 31, No. 1, 323-330 (2001). MSC: 68P10 68W40 PDF BibTeX XML Cite \textit{J.-C. Chen}, SIAM J. Comput. 31, No. 1, 323--330 (2001; Zbl 0992.68038) Full Text: DOI
Csurös, Miklós; Kao, Ming-Yang Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets. (English) Zbl 0987.05042 SIAM J. Comput. 31, No. 1, 306-322 (2001). Reviewer: Du Ding-Zhu (Minneapolis) MSC: 05C05 05C85 92D15 60J85 92D20 PDF BibTeX XML Cite \textit{M. Csurös} and \textit{M.-Y. Kao}, SIAM J. Comput. 31, No. 1, 306--322 (2001; Zbl 0987.05042) Full Text: DOI
Hell, Pavol; Shamir, Ron; Sharan, Roded A Fully dynamic algorithm for recognizing and representing proper interval graphs. (English) Zbl 0992.68065 SIAM J. Comput. 31, No. 1, 289-305 (2001). MSC: 68Q25 68W40 05C85 PDF BibTeX XML Cite \textit{P. Hell} et al., SIAM J. Comput. 31, No. 1, 289--305 (2001; Zbl 0992.68065) Full Text: DOI
Eiter, Thomas; Ibaraki, Toshihide; Makino, Kazuhisa Disjunctions of Horn theories and their cores. (English) Zbl 0992.68067 SIAM J. Comput. 31, No. 1, 269-288 (2001). MSC: 68Q25 68T27 PDF BibTeX XML Cite \textit{T. Eiter} et al., SIAM J. Comput. 31, No. 1, 269--288 (2001; Zbl 0992.68067) Full Text: DOI
Sawada, Joe Generating bracelets in constant amortized time. (English) Zbl 0992.68153 SIAM J. Comput. 31, No. 1, 259-268 (2001). MSC: 68R05 68R15 05-04 PDF BibTeX XML Cite \textit{J. Sawada}, SIAM J. Comput. 31, No. 1, 259--268 (2001; Zbl 0992.68153) Full Text: DOI
Boyar, Joan; Larsen, Kim S.; Nielsen, Morten N. The accommodating function: A generalization of the competitive ratio. (English) Zbl 0992.68069 SIAM J. Comput. 31, No. 1, 233-258 (2001). MSC: 68Q25 90B35 05B40 PDF BibTeX XML Cite \textit{J. Boyar} et al., SIAM J. Comput. 31, No. 1, 233--258 (2001; Zbl 0992.68069) Full Text: DOI
Bouchitté, Vincent; Todinca, Ioan Treewidth and minimum fill-in: Grouping the minimal separators. (English) Zbl 0987.05085 SIAM J. Comput. 31, No. 1, 212-232 (2001). Reviewer: Hans L.Bodlaender (Utrecht) MSC: 05C85 68Q25 68R10 PDF BibTeX XML Cite \textit{V. Bouchitté} and \textit{I. Todinca}, SIAM J. Comput. 31, No. 1, 212--232 (2001; Zbl 0987.05085) Full Text: DOI
Kucera, Antonín; Slaman, T. Randomness and recursive enumerability. (English) Zbl 0992.68079 SIAM J. Comput. 31, No. 1, 199-211 (2001). MSC: 68Q30 03D15 PDF BibTeX XML Cite \textit{A. Kucera} and \textit{T. Slaman}, SIAM J. Comput. 31, No. 1, 199--211 (2001; Zbl 0992.68079) Full Text: DOI
Cucker, Felipe; Grigoriev, Dima There are no sparse NP\(_{w}\)-hard sets. (English) Zbl 0992.68061 SIAM J. Comput. 31, No. 1, 193-198 (2001). MSC: 68Q15 03D15 68Q17 PDF BibTeX XML Cite \textit{F. Cucker} and \textit{D. Grigoriev}, SIAM J. Comput. 31, No. 1, 193--198 (2001; Zbl 0992.68061) Full Text: DOI
Luby, Michael; Randall, Dana; Sinclair, Alistair Markov chain algorithms for planar lattice structures. (English) Zbl 0992.82013 SIAM J. Comput. 31, No. 1, 167-192 (2001). MSC: 82B41 05C70 68Q25 60J20 82B20 PDF BibTeX XML Cite \textit{M. Luby} et al., SIAM J. Comput. 31, No. 1, 167--192 (2001; Zbl 0992.82013) Full Text: DOI
Chekuri, C.; Motwani, R.; Natarajan, B.; Stein, C. Approximation techniques for average completion time scheduling. (English) Zbl 0992.68066 SIAM J. Comput. 31, No. 1, 146-166 (2001). MSC: 68Q25 68W25 68W40 90B35 68W20 PDF BibTeX XML Cite \textit{C. Chekuri} et al., SIAM J. Comput. 31, No. 1, 146--166 (2001; Zbl 0992.68066) Full Text: DOI
Flum, Jörg; Grohe, Martin Fixed-parameter tractability, definability, and model-checking. (English) Zbl 0992.68060 SIAM J. Comput. 31, No. 1, 113-145 (2001). MSC: 68Q15 03C40 03C13 PDF BibTeX XML Cite \textit{J. Flum} and \textit{M. Grohe}, SIAM J. Comput. 31, No. 1, 113--145 (2001; Zbl 0992.68060) Full Text: DOI
Leonardi, Stefano; Marchetti-Spaccamela, Alberto; Presciutti, Alessio; Rosén, Adi On-line randomized call control revisited. (English) Zbl 0992.68068 SIAM J. Comput. 31, No. 1, 86-112 (2001). MSC: 68Q25 68W20 PDF BibTeX XML Cite \textit{S. Leonardi} et al., SIAM J. Comput. 31, No. 1, 86--112 (2001; Zbl 0992.68068) Full Text: DOI
Liu, Pangfeng; Aiello, William; Bhatt, Sandeep Tree search on an atomic model for message passing. (English) Zbl 0992.68234 SIAM J. Comput. 31, No. 1, 67-85 (2001). MSC: 68W10 68Q10 68W20 PDF BibTeX XML Cite \textit{P. Liu} et al., SIAM J. Comput. 31, No. 1, 67--85 (2001; Zbl 0992.68234) Full Text: DOI
Althaus, Ernst; Mehlhorn, Kurt Traveling salesman-based curve reconstruction in polynomial time. (English) Zbl 0992.68070 SIAM J. Comput. 31, No. 1, 27-66 (2001). MSC: 68Q25 05C85 PDF BibTeX XML Cite \textit{E. Althaus} and \textit{K. Mehlhorn}, SIAM J. Comput. 31, No. 1, 27--66 (2001; Zbl 0992.68070) Full Text: DOI
Kao, Ming-Yang; Lam, Tak-Wah; Sung, Wing-Kin; Ting, Hing-Fung A decomposition theorem for maximum weight bipartite matchings. (English) Zbl 0989.05091 SIAM J. Comput. 31, No. 1, 18-26 (2001). Reviewer: Ian M.Wanless (Oxford) MSC: 05C70 05C85 68Q10 PDF BibTeX XML Cite \textit{M.-Y. Kao} et al., SIAM J. Comput. 31, No. 1, 18--26 (2001; Zbl 0989.05091) Full Text: DOI
Chen, Jianer; Miranda, Antonio A polynomial time approximation scheme for general multiprocessor job scheduling. (English) Zbl 0992.68009 SIAM J. Comput. 31, No. 1, 1-17 (2001). MSC: 68M20 90B35 90C27 90C39 68Q25 68W05 PDF BibTeX XML Cite \textit{J. Chen} and \textit{A. Miranda}, SIAM J. Comput. 31, No. 1, 1--17 (2001; Zbl 0992.68009) Full Text: DOI