
BibTeX records: Jyh-Jye Lin
@article{DBLP:journals/dam/LinCW10, author = {Jyh{-}Jye Lin and Chi{-}Yuan Chan and Biing{-}Feng Wang}, title = {Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches}, journal = {Discret. Appl. Math.}, volume = {158}, number = {8}, pages = {932--942}, year = {2010}, url = {https://doi.org/10.1016/j.dam.2008.10.018}, doi = {10.1016/j.dam.2008.10.018}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/LinCW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/WangLK04, author = {Biing{-}Feng Wang and Jyh{-}Jye Lin and Shan{-}Chyun Ku}, title = {Efficient algorithms for the scaled indexing problem}, journal = {J. Algorithms}, volume = {52}, number = {1}, pages = {82--100}, year = {2004}, url = {https://doi.org/10.1016/j.jalgor.2004.03.006}, doi = {10.1016/j.jalgor.2004.03.006}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/WangLK04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/WangL00, author = {Biing{-}Feng Wang and Jyh{-}Jye Lin}, editor = {D. T. Lee and Shang{-}Hua Teng}, title = {Finding a Two-Core of a Tree in Linear Time}, booktitle = {Algorithms and Computation, 11th International Conference, {ISAAC} 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1969}, pages = {467--478}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40996-3\_40}, doi = {10.1007/3-540-40996-3\_40}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/WangL00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.