English  |  正體中文  |  简体中文  |  Total items :0  
Visitors :  52304640    Online Users :  1019
Project Commissioned by the Ministry of Education
Project Executed by National Taiwan University Library
 
臺灣學術機構典藏系統 (Taiwan Academic Institutional Repository, TAIR)
About TAIR

Browse By

News

Copyright

Related Links

"hung l j"

Return to Browse by Author
Sorting by Title Sort by Date

Showing items 1-10 of 10  (1 Page(s) Totally)
1 
View [10|25|50] records per page

Institution Date Title Author
國立成功大學 2023 A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks Kao, S.-S.;Klasing, R.;Hung, L.-J.;Lee, C.-W.;Hsieh, S.-Y.
國立成功大學 2022 Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs Yeh, H.-P.;Lu, W.;Chen, L.-H.;Hung, L.-J.;Klasing, R.;Hsieh, S.-Y.
國立成功大學 2022 On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Klasing, R.
國立成功大學 2021 A Parallel Algorithm for�Constructing Multiple Independent Spanning Trees in�Bubble-Sort Networks Kao, S.-S.;Klasing, R.;Hung, L.-J.;Hsieh, S.-Y.
國立成功大學 2020 Approximation algorithms for the p-hub center routing problem in parameterized metric graphs Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Klasing, R.
國立成功大學 2020 The Hardness and Approximation of the Densest k-Subgraph Problem in Parameterized Metric Graphs Chang, S.-C.;Chen, L.-H.;Hung, L.-J.;Kao, S.-S.;Klasing, R.
國立成功大學 2017 On the complexity of the star p-hub center problem with parameterized triangle inequality Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Klasing, R.;Lee, C.-W.;Wu, B.Y.
國立成功大學 2017 An efficient fixed-parameter algorithm for the 2-plex bipartition problem Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Rossmanith, P.
國立成功大學 2017 The approximability of the p-hub center problem with parameterized triangle inequality Chen, L.-H.;Hsieh, S.-Y.;Hung, L.-J.;Klasing, R.
國立東華大學 2009 Block-graph width Peng,S.-L.; Chang,M.-S.; Hung,L.-J.; Kloks,T.

Showing items 1-10 of 10  (1 Page(s) Totally)
1 
View [10|25|50] records per page