default search action
Guohui Lin
Guo-Hui Lin
Person information
- affiliation: University of Alberta, Edmonton, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j133]Mingyang Gong
, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano:
Approximation Algorithms for Covering Vertices by Long Paths. Algorithmica 86(8): 2625-2651 (2024) - [j132]Mingyang Gong
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. Ann. Oper. Res. 335(1): 185-204 (2024) - [j131]Yuichi Asahiro, Jesper Jansson
Polynomial-time equivalences and refined algorithms for longest common subsequence variants. Discret. Appl. Math. 353: 44-64 (2024) - [j130]Yingying Jiang
Widen the debate: What is the academic community's perception on ChatGPT? Educ. Inf. Technol. 29(15): 20181-20200 (2024) - [j129]Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin
Approximating the directed path partition problem. Inf. Comput. 297: 105150 (2024) - [j128]Xianyu Yu, Hengte Du, Dequn Zhou, Qunwei Wang, Guohui Lin:
Bi-objective carbon-efficient distributed flow-shop scheduling with multistep electricity pricing. Int. J. Prod. Res. 62(18): 6842-6858 (2024) - [j127]Qiaojun Shu, Guohui Lin
Planar graphs are acyclically edge (Δ + 5)-colorable. J. Comb. Optim. 47(4): 64 (2024) - [c86]Lin Chen, Yixiong Gao, Minming Li, Guohui Lin, Kai Wang:
Revisit the Scheduling Problem with Calibrations. ISAAC 2024: 20:1-20:15 - [c85]Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir:
Directed Path Partition Problem on Directed Acyclic Graphs. IWOCA 2024: 314-326 - [i22]Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
Approximately covering vertices by order-5 or longer paths. CoRR abs/2408.11225 (2024) - 2023
- [j126]Kenya Kobayashi, Guohui Lin
Path Cover Problems with Length Cost. Algorithmica 85(11): 3348-3375 (2023) - [j125]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru:
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. Theor. Comput. Sci. 975: 114114 (2023) - [c84]Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue:
Independent Set Under a Change Constraint from an Initial Solution. CIAC 2023: 37-51 - [c83]Mingyang Gong
An Approximation Algorithm for Covering Vertices by 4+-Paths. COCOA (1) 2023: 459-470 - [c82]Yuichi Asahiro, Hiroshi Eto, Mingyang Gong
Approximation Algorithms for the Longest Run Subsequence Problem. CPM 2023: 2:1-2:12 - [c81]Yuya Higashikawa, Naoki Katoh, Guohui Lin
On Computing a Center Persistence Diagram. FCT 2023: 262-275 - [i21]Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Zhaohui Zhan:
An Approximation Algorithm for Covering Vertices by 4^+-Paths. CoRR abs/2304.12779 (2023) - [i20]Mingyang Gong, Zhi-Zhong Chen, Guohui Lin:
Randomized algorithms for fully online multiprocessor scheduling with testing. CoRR abs/2305.01605 (2023) - [i19]Qiaojun Shu, Guohui Lin:
Planar graphs are acyclically edge (Δ+ 5)-colorable. CoRR abs/2306.15813 (2023) - 2022
- [j124]Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. J. Comb. Optim. 43(3): 571-588 (2022) - [j123]Wenchang Luo, Rylan Chin, Alexander Cai, Guohui Lin
A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling. J. Comb. Optim. 44(1): 690-722 (2022) - [j122]Mingyang Gong
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing. J. Comb. Optim. 44(1): 877-893 (2022) - [j121]Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin
Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim. 44(3): 1753-1773 (2022) - [j120]Yong Chen, Randy Goebel, Guohui Lin
A local search 4/3-approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 44(5): 3595-3610 (2022) - [c80]Yuichi Asahiro, Jesper Jansson
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM 2022: 15:1-15:17 - [c79]Mingyang Gong
Approximation Algorithms for Covering Vertices by Long Paths. MFCS 2022: 53:1-53:14 - [c78]Kenya Kobayashi, Guohui Lin, Eiji Miyano
Path Cover Problems with Length Cost. WALCOM 2022: 396-408 - [i18]Jianming Dong, Ruyan Jin, Guohui Lin, Bing Su, Weitian Tong, Yao Xu:
An efficient polynomial-time approximation scheme for parallel multi-stage open shops. CoRR abs/2205.14407 (2022) - [i17]Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano:
Approximation algorithms for covering vertices by long paths. CoRR abs/2208.03294 (2022) - 2021
- [j119]Yong Chen, Zhi-Zhong Chen, Guohui Lin
Approximation Algorithms for Maximally Balanced Connected Graph Partition. Algorithmica 83(12): 3715-3740 (2021) - [j118]Jianming Dong, Randy Goebel, Jueliang Hu, Guohui Lin, Bing Su:
Minimizing total job completion time in MapReduce scheduling. Comput. Ind. Eng. 158: 107387 (2021) - [j117]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka
Parameterized algorithms for the Happy Set problem. Discret. Appl. Math. 304: 32-44 (2021) - [j116]Guohui Lin
An improved approximation algorithm for the minimum common integer partition problem. Inf. Comput. 281: 104784 (2021) - [j115]Yong Chen, Zhi-Zhong Chen, Guohui Lin
A randomized approximation algorithm for metric triangle packing. J. Comb. Optim. 41(1): 12-27 (2021) - [j114]Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang:
Improved hardness and approximation results for single allocation hub location problems. Theor. Comput. Sci. 864: 10-19 (2021) - [j113]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano
Complexity and approximability of the happy set problem. Theor. Comput. Sci. 866: 123-144 (2021) - [j112]Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Theor. Comput. Sci. 882: 77-108 (2021) - [c77]Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu
Approximation Algorithms for the Directed Path Partition Problems. IJTCS-FAW 2021: 23-36 - [c76]Mingyang Gong
Improved Approximation Algorithms for Multiprocessor Scheduling with Testing. IJTCS-FAW 2021: 65-77 - [i16]Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang:
Approximation algorithms for the directed path partition problems. CoRR abs/2107.04699 (2021) - 2020
- [j111]An Zhang, Yong Chen, Zhi-Zhong Chen, Guohui Lin
Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs. Algorithmica 82(10): 3041-3064 (2020) - [j110]Wenchang Luo, Miaomiao Jin, Bing Su, Guohui Lin
An approximation scheme for rejection-allowed single-machine rescheduling. Comput. Ind. Eng. 146: 106574 (2020) - [j109]Yong Chen, Guohui Lin
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. 40(3): 806-824 (2020) - [j108]Jianming Dong, Joshua Chang, Bing Su, Jueliang Hu, Guohui Lin
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments. J. Sched. 23(5): 595-608 (2020) - [j107]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu
Approximation algorithms for the three-machine proportionate mixed shop scheduling. Theor. Comput. Sci. 803: 57-70 (2020) - [j106]Yong Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang:
Open-shop scheduling for unit jobs under precedence constraints. Theor. Comput. Sci. 803: 144-151 (2020) - [j105]Yuichi Asahiro, Jesper Jansson
Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. 838: 238-249 (2020) - [c75]Xing Wang, Guangting Chen, Yong Chen, Guohui Lin
Improved Hardness and Approximation Results for Single Allocation Hub Location. AAIM 2020: 85-96 - [c74]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano
Graph Classes and Approximability of the Happy Set Problem. COCOON 2020: 335-346 - [c73]Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano
Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles. TAMC 2020: 426-438 - [c72]Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka
Parameterized Algorithms for the Happy Set Problem. WALCOM 2020: 323-328 - [i15]Qiaojun Shu, Guohui Lin, Eiji Miyano:
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. CoRR abs/2005.06152 (2020)
2010 – 2019
- 2019
- [j104]Zhi-Zhong Chen, Guohui Lin
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. Algorithmica 81(11-12): 4167-4199 (2019) - [j103]Huili Zhang
Online minimum latency problem with edge uncertainty. Eur. J. Oper. Res. 273(2): 418-429 (2019) - [j102]Yuichi Asahiro, Guohui Lin, Zhilong Liu, Eiji Miyano
An Approximation Algorithm for the Maximum Induced Matching Problem on C5-Free Regular Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(9): 1142-1149 (2019) - [j101]Jianming Dong, Ruyan Jin, Jueliang Hu, Guohui Lin
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops. J. Comb. Optim. 37(2): 668-684 (2019) - [j100]Shanshan Zhai, Peng Zhang, Daming Zhu, Weitian Tong
An approximation algorithm for genome sorting by reversals to recover all adjacencies. J. Comb. Optim. 37(4): 1170-1190 (2019) - [j99]Yong Chen, Randy Goebel, Guohui Lin
An improved approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 38(1): 150-164 (2019) - [j98]Wenchang Luo, Yao Xu
Single-machine scheduling with job-dependent machine deterioration. J. Sched. 22(6): 691-707 (2019) - [c71]Yuichi Asahiro, Jesper Jansson
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA 2019: 1-12 - [c70]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang:
A Randomized Approximation Algorithm for Metric Triangle Packing. COCOA 2019: 119-129 - [c69]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang:
Approximation Algorithms for Maximally Balanced Connected Graph Partition. COCOA 2019: 130-141 - [c68]Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem. FAW 2019: 14-25 - [c67]Lin Chen
Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement). SPAA 2019: 237-239 - [i14]Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. CoRR abs/1910.01753 (2019) - [i13]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang:
Approximation algorithms for maximally balanced connected graph partition. CoRR abs/1910.02470 (2019) - 2018
- [j97]Peng Zhang, Yao Xu
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. Algorithmica 80(5): 1412-1438 (2018) - [j96]Wenchang Luo
Algorithms for Communication Scheduling in Data Gathering Network with Data Compression. Algorithmica 80(11): 3158-3176 (2018) - [j95]Wenchang Luo, Boyuan Gu, Guohui Lin
Communication scheduling in data gathering networks of heterogeneous sensors with data compression: Algorithms and empirical experiments. Eur. J. Oper. Res. 271(2): 462-473 (2018) - [j94]Jianming Dong, Xueshi Wang, Jueliang Hu, Guohui Lin:
Single machine scheduling with job delivery to multiple customers. J. Sched. 21(3): 337-348 (2018) - [j93]Wenchang Luo, Taibo Luo, Randy Goebel, Guohui Lin
Rescheduling due to machine disruption to minimize the total weighted completion time. J. Sched. 21(5): 565-578 (2018) - [j92]Weitian Tong
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. Theor. Comput. Sci. 734: 24-31 (2018) - [c66]Longcheng Liu, Guanqun Ni, Yong Chen, Randy Goebel, Yue Luo, An Zhang, Guohui Lin:
Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop. AAIM 2018: 268-280 - [c65]An Zhang, Yong Chen, Randy Goebel, Guohui Lin:
Open-Shop Scheduling for Unit Jobs Under Precedence Constraints. COCOA 2018: 329-340 - [c64]Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang:
Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph. COCOON 2018: 205-217 - [c63]Wenchang Luo, Bing Su, Yao Xu
An Approximation Framework for Bounded Facility Location Problems. COCOON 2018: 353-364 - [i12]Yinhui Cai, Guangting Chen, Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, An Zhang:
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph. CoRR abs/1803.02862 (2018) - [i11]Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, An Zhang:
Approximation algorithms for the three-machine proportionate mixed shop scheduling. CoRR abs/1809.05745 (2018) - [i10]An Zhang, Yong Chen, Zhi-Zhong Chen, Guohui Lin:
Improved approximation algorithms for path vertex covers in regular graphs. CoRR abs/1811.01162 (2018) - [i9]Yong Chen, Randy Goebel, Guohui Lin, Longcheng Liu, Bing Su, Weitian Tong, Yao Xu, An Zhang:
A local search 4/3-approximation algorithm for the minimum 3-path partition problem. CoRR abs/1812.09353 (2018) - 2017
- [j91]Jianming Dong, Weitian Tong
An FPTAS for the parallel two-stage flowshop problem. Theor. Comput. Sci. 657: 64-72 (2017) - [j90]Jianming Dong, Jueliang Hu, Mikhail Y. Kovalyov
Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72]. Theor. Comput. Sci. 687: 93-94 (2017) - [c62]Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang:
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. COCOON 2017: 124-136 - [c61]Yao Xu, Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Peng Zhang:
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem. ISAAC 2017: 66:1-66:12 - [i8]Wenchang Luo, Taibo Luo, Randy Goebel, Guohui Lin:
On rescheduling due to machine disruption while to minimize the total weighted completion time. CoRR abs/1701.07498 (2017) - [i7]Yao Xu, Yong Chen, Taibo Luo, Guohui Lin:
A local search 2.917-approximation algorithm for duo-preservation string mapping. CoRR abs/1702.01877 (2017) - [i6]Yao Xu, Yong Chen, Taibo Luo, Guohui Lin:
A (1.4 + ε)-approximation algorithm for the 2-{Max-Duo} problem. CoRR abs/1702.06256 (2017) - 2016
- [j89]Huili Zhang, Weitian Tong
The Steiner traveling salesman problem with online advanced edge blockages. Comput. Oper. Res. 70: 26-38 (2016) - [j88]Jianming Dong, Xueshi Wang, Jueliang Hu, Guohui Lin:
An improved two-machine flowshop scheduling with intermediate transportation. J. Comb. Optim. 31(3): 1316-1334 (2016) - [j87]Jianming Dong, Jueliang Hu, Guohui Lin:
A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines. Optim. Lett. 10(1): 109-118 (2016) - [j86]Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong
Machine scheduling with a maintenance interval and job delivery coordination. Optim. Lett. 10(8): 1645-1656 (2016) - [j85]Weitian Tong
Smoothed heights of tries and patricia tries. Theor. Comput. Sci. 609: 620-626 (2016) - [c60]Weitian Tong
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan. FAW 2016: 227-237 - [c59]Wenchang Luo
Single Machine Scheduling with Job-Dependent Machine Deterioration. ISAAC 2016: 55:1-55:13 - [i5]Yao Xu, Randy Goebel, Guohui Lin:
Submodular and supermodular multi-labeling, and vertex happiness. CoRR abs/1606.03185 (2016) - [i4]Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin:
Single machine scheduling with job-dependent machine deterioration. CoRR abs/1606.04157 (2016) - [i3]Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen:
Approximation algorithms for the maximum weight internal spanning tree problem. CoRR abs/1608.03299 (2016) - 2015
- [j84]Yining Wang
Whole genome SNP genotype piecemeal imputation. BMC Bioinform. 16: 340:1-340:11 (2015) - [j83]Haitao Jiang, Guohui Lin, Weitian Tong
Isomorphism and similarity for 2-generation pedigrees. BMC Bioinform. 16(S-5): S7 (2015) - [j82]Huili Zhang
The Steiner Traveling Salesman Problem with online edge blockages. Eur. J. Oper. Res. 243(1): 30-40 (2015) - [j81]Liqin Huang, Weitian Tong
A 0.5358-approximation for Bandpass-2. J. Comb. Optim. 30(3): 612-626 (2015) - [j80]Francis Y. L. Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang
Competitive algorithms for unbounded one-way trading. Theor. Comput. Sci. 607: 35-48 (2015) - [j79]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong
Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. 607: 455-470 (2015) - [c58]Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong
Machine Scheduling with a Maintenance Interval and Job Delivery Coordination. FAW 2015: 104-114 - 2014
- [j78]Guohui Lin:
Preface. J. Comb. Optim. 27(1): 1-2 (2014) - [j77]Zhixiang Chen, Bin Fu, Randy Goebel, Guohui Lin, Weitian Tong
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions. Theor. Comput. Sci. 550: 59-65 (2014) - [j76]Weitian Tong
Approximating the minimum independent dominating set in perturbed graphs. Theor. Comput. Sci. 554: 275-282 (2014) - [j75]Weitian Tong
Approximating the maximum multiple RNA interaction problem. Theor. Comput. Sci. 556: 63-70 (2014) - [c57]Wei Ding
Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights. AAIM 2014: 197-207 - [c56]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong
Algorithms for Cut Problems on Trees. COCOA 2014: 283-298 - [c55]Weitian Tong
On the Smoothed Heights of Trie and Patricia Index Trees. COCOON 2014: 94-103 - [c54]Weitian Tong
An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem. ISAAC 2014: 353-364 - [c53]Min Lu, Tian Liu, Weitian Tong
Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems. TAMC 2014: 248-258 - 2013
- [j74]Hadi Sabaa, Zhipeng Cai, Yining Wang
Whole genome Identity-by-Descent determination. J. Bioinform. Comput. Biol. 11(2) (2013) - [j73]Guangting Chen, Guohui Lin, Zhiyi Tan:
Preface. J. Comb. Optim. 26(3): 415 (2013) - [j72]Guohui Lin:
Preface. Theor. Comput. Sci. 507: 1 (2013) - [c52]Weitian Tong
Approximation Algorithms for the Maximum Multiple RNA Interaction Problem. COCOA 2013: 49-59 - [c51]Weitian Tong
Approximating the Minimum Independent Dominating Set in Perturbed Graphs. COCOON 2013: 257-267 - [c50]Yi Shi, Xinhua Zhang, Xiaoping Liao, Guohui Lin, Dale Schuurmans:
Protein-chemical Interaction Prediction via Kernelized Sparse Learning SVM. Pacific Symposium on Biocomputing 2013: 41-52 - [i2]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Algorithms for Cut Problems on Trees. CoRR abs/1304.3653 (2013) - [i1]Weitian Tong, Zhi-Zhong Chen, Lusheng Wang, Yinfeng Xu, Jiuping Xu, Randy Goebel, Guohui Lin:
An approximation algorithm for the Bandpass-2 problem. CoRR abs/1307.7089 (2013) - 2012
- [j71]Yi Shi, Maryam Hasan, Zhipeng Cai, Guohui Lin, Dale Schuurmans:
Linear Coherent Bi-Clustering via Beam Searching and Sample Set Clustering. Discret. Math. Algorithms Appl. 4(2) (2012) - [j70]Yongxi Cheng, Guohui Lin:
Solving haplotype inference problem with non-genotyped founders via integer linear programming. J. Comb. Optim. 23(1): 50-60 (2012) - [j69]Haitao Jiang, Zhong Li, Guohui Lin, Lusheng Wang
Exact and approximation algorithms for the complementary maximal strip recovery problem. J. Comb. Optim. 23(4): 493-506 (2012) - [j68]Guohui Lin, Randy Goebel, Zhong Li, Lusheng Wang
An improved approximation algorithm for the complementary maximal strip recovery problem. J. Comput. Syst. Sci. 78(3): 720-730 (2012) - [c49]Weitian Tong
An Improved Approximation Algorithm for the Bandpass Problem. FAW-AAIM 2012: 351-358 - [c48]Yi Shi, Xiaoping Liao, Xinhua Zhang, Guohui Lin, Dale Schuurmans:
Sparse Learning Based Linear Coherent Bi-clustering. WABI 2012: 346-364 - [e2]Guohui Lin:
Combinatorial Optimization and Applications - 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings. Lecture Notes in Computer Science 7402, Springer 2012, ISBN 978-3-642-31769-9 [contents] - 2011
- [j67]Zhi-Zhong Chen, Guohui Lin, Lusheng Wang
An Approximation Algorithm for the Minimum Co-Path Set Problem. Algorithmica 60(4): 969-986 (2011) - [j66]Wei Ding
Diameter-Constrained Steiner Trees. Discret. Math. Algorithms Appl. 3(4): 491-502 (2011) - [j65]Guohui Lin:
On the Bandpass problem. J. Comb. Optim. 22(1): 71-77 (2011) - [j64]Zhipeng Cai, Randy Goebel, Guohui Lin:
Size-constrained tree partitioning: Approximating the multicast k-tree routing problem. Theor. Comput. Sci. 412(3): 240-245 (2011) - [j63]Zhong Li, Guohui Lin:
The three column Bandpass problem is solvable in linear time. Theor. Comput. Sci. 412(4-5): 281-299 (2011) - [c47]Zhong Li, Randy Goebel, Lusheng Wang
An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem. FAW-AAIM 2011: 46-57 - [c46]Xiaoyu Shi, Dahua Zeng, Yu Hu, Guohui Lin, Osmar R. Zaïane:
Enhancement of incremental design for FPGAs using circuit similarity. ISQED 2011: 243-250 - 2010
- [j62]William S. Kennedy, Hui Kong, Guohui Lin, Guiying Yan:
Linear time construction of 5-phylogenetic roots for tree chordal graphs. J. Comb. Optim. 19(1): 94-106 (2010) - [j61]Mark V. Berjanskii, Yongjie Liang, Jianjun Zhou, Peter Tang, Paul Stothard, You Zhou, Joseph A. Cruz, Cam Macdonell, Guohui Lin, Paul Lu, David S. Wishart
PROSESS: a protein structure evaluation suite and server. Nucleic Acids Res. 38(Web-Server-Issue): 633-640 (2010) - [j60]Jianjun Zhou, Jörg Sander
Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations. IEEE ACM Trans. Comput. Biol. Bioinform. 7(4): 669-680 (2010) - [c45]Lusheng Wang
Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive. AAIM 2010: 243-252 - [c44]Yi Shi, Maryam Hasan, Zhipeng Cai, Guohui Lin, Dale Schuurmans:
Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering. COCOA (1) 2010: 85-103 - [c43]Wei Ding
Diameter-Constrained Steiner Tree. COCOA (2) 2010: 243-253 - [c42]Xiaoyu Shi, Dahua Zeng, Yu Hu, Guohui Lin, Osmar R. Zaïane:
Accelerating FPGA design space exploration using circuit similarity-based placement. FPT 2010: 373-376
2000 – 2009
- 2009
- [j59]Guohui Lin, Zhipeng Cai:
Editorial, COCOON 2007 Special Issue. Algorithmica 54(4): 471 (2009) - [j58]Zhipeng Cai, Hadi Sabaa, Yining Wang, Randy Goebel, Zhiquan Wang, Jiaofen Xu, Paul Stothard, Guohui Lin:
Most parsimonious haplotype allele sharing determination. BMC Bioinform. 10 (2009) - [j57]Guan Ning Lin, Zhipeng Cai, Guohui Lin, Sounak Chakraborty, Dong Xu:
ComPhy: prokaryotic composite distance phylogenies inferred from whole-genome gene sets. BMC Bioinform. 10(S-1) (2009) - [j56]Yongxi Cheng, Ding-Zhu Du, Ker-I Ko, Guohui Lin:
On the Parameterized Complexity of Pooling Design. J. Comput. Biol. 16(11): 1529-1537 (2009) - [j55]Mark V. Berjanskii, Peter Tang, Jack Liang, Joseph A. Cruz, Jianjun Zhou, You Zhou, Edward Bassett, Cam Macdonell, Paul Lu, Guohui Lin, David S. Wishart
GeNMR: a web server for rapid NMR-based protein structure determination. Nucleic Acids Res. 37(Web-Server-Issue): 670-677 (2009) - [j54]Yongxi Cheng, Ding-Zhu Du, Guohui Lin:
On the upper bounds of the minimum number of rows of disjunct matrices. Optim. Lett. 3(2): 297-302 (2009) - [j53]Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin:
A 3.4713-approximation algorithm for the capacitated multicast tree routing problem. Theor. Comput. Sci. 410(52): 5415-5424 (2009) - [c41]Yi Shi, Zhipeng Cai, Guohui Lin, Dale Schuurmans:
Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting. COCOA 2009: 73-84 - [c40]Zhipeng Cai, Randy Goebel, Guohui Lin:
Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem. COCOA 2009: 363-374 - 2008
- [j52]Gang Wu, Ming-Yang Kao, Guohui Lin, Jia-Huai You:
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability. Algorithms Mol. Biol. 3 (2008) - [j51]Guohui Lin, Zhanyong Wang, Lusheng Wang
Identification of linked regions using high-density SNP genotype data in linkage analysis. Bioinform. 24(1): 86-93 (2008) - [j50]Guohui Lin, Zhipeng Cai, Junfeng Wu, Xiu-Feng Wan, Lizhe Xu, Randy Goebel:
Identifying a few foot-and-mouth disease virus signature nucleotide strings for computational genotyping. BMC Bioinform. 9 (2008) - [j49]Yi Shi, Jianjun Zhou, David Arndt, David S. Wishart
Protein contact order prediction from primary sequences. BMC Bioinform. 9 (2008) - [j48]Xiu-Feng Wan, Mufit Ozden, Guohui Lin:
Ubiquitous Reassortments in influenza a viruses. J. Bioinform. Comput. Biol. 6(5): 981-999 (2008) - [j47]Guohui Lin, Zhipeng Cai:
Editorial, COCOON 2007 special issue. J. Comb. Optim. 16(3): 197 (2008) - [j46]David S. Wishart
PPT-DB: the protein property prediction and testing database. Nucleic Acids Res. 36(Database-Issue): 222-229 (2008) - [j45]David S. Wishart
CS23D: a web server for rapid protein structure generation using NMR chemical shifts and sequence data. Nucleic Acids Res. 36(Web-Server-Issue): 496-502 (2008) - [c39]Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem. COCOA 2008: 286-295 - [c38]Wei Ren, Guiying Yan, Guohui Lin, Caifeng Du, Xiaofeng Han:
Detecting Community Structure by Network Vectorization. COCOON 2008: 245-254 - 2007
- [j44]Xiaomeng Wu, Zhipeng Cai, Xiu-Feng Wan, Tin Hoang, Randy Goebel, Guohui Lin:
Nucleotide composition string selection in HIV-1 subtyping using whole genomes. Bioinform. 23(14): 1744-1752 (2007) - [j43]Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipour, Guohui Lin:
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping. BMC Bioinform. 8 (2007) - [j42]Jianjun Zhou, Jörg Sander
Efficient composite pattern finding from monad patterns. Int. J. Bioinform. Res. Appl. 3(1): 86-99 (2007) - [j41]Xiang Wan, Guohui Lin:
Gasa: a Graph-Based Automated NMR Backbone Resonance Sequential Assignment Program. J. Bioinform. Comput. Biol. 5(2a): 313-333 (2007) - [j40]Gang Wu, Jia-Huai You, Guohui Lin:
Quartet-Based Phylogeny Reconstruction with Answer Set Programming. IEEE ACM Trans. Comput. Biol. Bioinform. 4(1): 139-152 (2007) - [j39]Xiang Wan, Guohui Lin:
CISA: Combined NMR Resonance Connectivity Information Determination and Sequential Assignment. IEEE ACM Trans. Comput. Biol. Bioinform. 4(3): 336-348 (2007) - [c37]Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipour, Yi Shi, Lizhe Xu, Guohui Lin:
Selecting Genes with Dissimilar Discrimination Strength for Sample Class Prediction. APBC 2007: 81-90 - [e1]Guohui Lin:
Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings. Lecture Notes in Computer Science 4598, Springer 2007, ISBN 978-3-540-73544-1 [contents] - 2006
- [j38]Kun Yang
A stable gene selection in microarray data analysis. BMC Bioinform. 7: 228 (2006) - [j37]Guohui Lin, Xiang Wan, Theodore Tegos, Yingshu Li:
Statistical evaluation of NMR backbone resonance assignment. Int. J. Bioinform. Res. Appl. 2(2): 147-160 (2006) - [j36]Xiaomeng Wu, Xiu-Feng Wan, Gang Wu, Dong Xu, Guohui Lin:
Phylogenetic analysis using complete signature information of whole genomes and clustered Neighbour-Joining method. Int. J. Bioinform. Res. Appl. 2(3): 219-248 (2006) - [j35]Guohui Lin, Zhipeng Cai, Dekang Lin:
Vertex covering by paths on trees with its applications in machine translation. Inf. Process. Lett. 97(2): 73-81 (2006) - [j34]Gang Wu, Jia-Huai You, Guohui Lin:
A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors. Inf. Process. Lett. 100(4): 167-171 (2006) - [j33]Zhipeng Cai, Maysam Heydari, Guohui Lin:
Iterated Local Least Squares Microarray Missing Value Imputation. J. Bioinform. Comput. Biol. 4(5): 935-958 (2006) - [j32]Xiu-Feng Wan, Guohui Lin, Dong Xu:
Rnall: an Efficient Algorithm for Predicting Rna Local Secondary Structural Landscape in Genomes. J. Bioinform. Comput. Biol. 4(5): 1015-1032 (2006) - [j31]Guohui Lin, Zhiyi Tan:
Editorial: In memoriam: Yong He (1969-2005). J. Comb. Optim. 12(4): 325-326 (2006) - [j30]William S. Kennedy, Guohui Lin, Guiying Yan:
Strictly chordal graphs are leaf powers. J. Discrete Algorithms 4(4): 511-525 (2006) - [c36]Zhipeng Cai, Maysam Heydari, Guohui Lin:
Microarray Missing Value Imputation by Iterated Local Least Squares. APBC 2006: 159-168 - [c35]Rimon Mikhaiel, Guohui Lin, Eleni Stroulia
Simplicity in RNA Secondary Structure Alignment: Towards biologically plausible alignments. BIBE 2006: 149-158 - [c34]Zhipeng Cai, Lizhe Xu, Yi Shi, Mohammad R. Salavatipour, Randy Goebel, Guohui Lin:
Using Gene Clustering to Identify Discriminatory Genes with Higher Classification Accuracy. BIBE 2006: 235-242 - [c33]Yi Shi, Zhipeng Cai, Lizhe Xu, Wei Ren, Randy Goebel, Guohui Lin:
A Model-Free Greedy Gene Selection for Microarray Sample Class Prediction. CIBCB 2006: 1-8 - [p1]Ilya Levner, Vadim Bulitko, Guohui Lin:
Feature Extraction for Classification of Proteomic Mass Spectra: A Comparative Study. Feature Extraction 2006: 607-624 - 2005
- [j29]Guohui Lin, Theodore Tegos, Zhi-Zhong Chen:
Heuristic Search in Constrained Bipartite Matching with Applications to Protein Nmr Backbone Resonance Assignment. J. Bioinform. Comput. Biol. 3(6): 1331-1350 (2005) - [j28]Zhi-Zhong Chen, Guohui Lin, Romeo Rizzi
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. J. Comput. Biol. 12(2): 129-146 (2005) - [j27]Zhipeng Cai, Maysam Heydari, Guohui Lin:
Clustering Binary Oligonucleotide Fingerprint Vectors for DNA Clone Classification Analysis. J. Comb. Optim. 9(2): 199-211 (2005) - [j26]Guohui Lin:
An Improved Approximation Algorithm for Multicast k-Tree Routing. J. Comb. Optim. 9(4): 349-356 (2005) - [c32]Gang Wu, Guohui Lin, Jia-Huai You, Xiaomeng Wu:
Faster solution to the maximum quartet consistency problem with constraint programming. APBC 2005: 329-338 - [c31]Kun Yang
A Model-Free and Stable Gene Selection in Microarray Data Analysis. BIBE 2005: 3-10 - [c30]Xiaomeng Wu, Guohui Lin:
Selected String Representation for Whole Genomes. CIBCB 2005: 105-112 - [c29]Zhipeng Cai, Guohui Lin, Guoliang Xue:
Improved Approximation Algorithms for the Capacitated Multicast Routing Problem. COCOON 2005: 136-145 - [c28]Xiaomeng Wu, Guohui Lin, Xiu-Feng Wan, Dong Xu:
Whole Genome Phylogeny Based on Clustered Signature String Composition. CSB Workshops 2005: 53-54 - [c27]Gang Wu, Jia-Huai You, Guohui Lin:
A Polynomial Algorithm for the Minimum Quartet Inconsistency Problem with O(n) Quartet Errors. CSB Workshops 2005: 55-56 - [c26]William S. Kennedy, Guohui Lin:
5-th Phylogenetic Root Construction for Strictly Chordal Graphs. ISAAC 2005: 738-747 - [c25]Gang Wu, Jia-Huai You, Guohui Lin:
Application of Smodels in Quartet Based Phylogeny Construction. LPNMR 2005: 369-373 - [c24]Gang Wu, Jia-Huai You, Guohui Lin:
A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem. WABI 2005: 65-76 - 2004
- [j25]Xiang Wan, Theodore Tegos, Guohui Lin:
Histogram-based Scoring Schemes for Protein Nmr Resonance Assignment. J. Bioinform. Comput. Biol. 2(4): 747-764 (2004) - [j24]Guohui Lin, Tao Jiang
A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition. J. Comb. Optim. 8(2): 183-194 (2004) - [j23]Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang:
The longest common subsequence problem for arc-annotated sequences. J. Discrete Algorithms 2(2): 257-270 (2004) - [j22]Zhi-Zhong Chen, Yong Gao, Guohui Lin, Robert Niewiadomski, Yang Wang, Junfeng Wu:
A space-efficient algorithm for sequence alignment with inversions and reversals. Theor. Comput. Sci. 325(3): 361-372 (2004) - [c23]Gang Wu, Guohui Lin, Jia-Huai You:
Quartet Based Phylogeny Reconstruction with Answer Set Programming. ICTAI 2004: 612-619 - 2003
- [j21]Guohui Lin, Dong Xu, Zhi-Zhong Chen, Tao Jiang
Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering. J. Bioinform. Comput. Biol. 1(2): 387-410 (2003) - [j20]Eric Bach, Joan Boyar
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. J. Sched. 6(2): 131-147 (2003) - [j19]Zhi-Zhong Chen, Tao Jiang
Computing Phylogenetic Roots with Bounded Degrees and Errors. SIAM J. Comput. 32(4): 864-879 (2003) - [j18]Zhi-Zhong Chen, Tao Jiang
Approximation algorithms for NMR spectral peak assignment. Theor. Comput. Sci. 299(1-3): 211-229 (2003) - [c22]Yong Gao, Junfeng Wu, Robert Niewiadomski, Yang Wang, Zhi-Zhong Chen, Guohui Lin:
A Space Efficient Algorithm for Sequence Alignment with Inversions. COCOON 2003: 57-67 - [c21]Xiang Wan, Dong Xu, Carolyn M. Slupsky, Guohui Lin:
Automated Protein NMR Resonance Assignments. CSB 2003: 197-208 - [c20]Zhi-Zhong Chen, Tao Jiang, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu:
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. ESA 2003: 580-592 - [c19]Jinbo Xu, Ming Li, Guo-Hui Lin, Dongsup Kim, Ying Xu:
Protein Threading by Linear Programming. Pacific Symposium on Biocomputing 2003: 264-275 - 2002
- [j17]Guo-Hui Lin, Guoliang Xue:
On the terminal Steiner tree problem. Inf. Process. Lett. 84(2): 103-107 (2002) - [j16]Tao Jiang
A General Edit Distance between RNA Structures. J. Comput. Biol. 9(2): 371-388 (2002) - [j15]Shi Ping Chen, Yong He, Guo-Hui Lin:
3-Partitioning Problems for Maximizing the Minimum Load. J. Comb. Optim. 6(1): 67-80 (2002) - [j14]Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang
The longest common subsequence problem for sequences with nested arc annotations. J. Comput. Syst. Sci. 65(3): 465-480 (2002) - [j13]Deep Jaitly, Paul E. Kearney, Guo-Hui Lin, Bin Ma:
Methods for reconstructing the history of tandem repeats and their application to the human genome. J. Comput. Syst. Sci. 65(3): 494-507 (2002) - [c18]Guo-Hui Lin, Dong Xu, Zhi-Zhong Chen, Tao Jiang
An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks. CSB 2002: 165-174 - [c17]Arunabha Sen, Bin Hao, Bao Hong Shen, Guohui Lin:
Survivable routing in WDM networks - logical ring in arbitrary physical topology. ICC 2002: 2771-2775 - [c16]Zhi-Zhong Chen, Tao Jiang
Improved Approximation Algorithms for NMR Spectral Peak Assignment. WABI 2002: 82-96 - 2001
- [j12]Guoliang Xue, Guo-Hui Lin, Ding-Zhu Du:
Grade of Service Steiner Minimum Trees in the Euclidean Plane. Algorithmica 31(4): 479-500 (2001) - [j11]Guo-Hui Lin, Guoliang Xue:
Signed genome rearrangement by reversals and transpositions: models and approximations. Theor. Comput. Sci. 259(1-2): 513-531 (2001) - [j10]Donghui Chen, Ding-Zhu Du, Xiao-Dong Hu, Guo-Hui Lin, Lusheng Wang
Approximations for Steiner trees with minimum number of Steiner points. Theor. Comput. Sci. 262(1): 83-99 (2001) - [c15]Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen:
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. ICALP 2001: 444-455 - [c14]Guohui Lin, Bin Ma, Kaizhong Zhang:
Edit distance between two RNA structures. RECOMB 2001: 211-220 - [c13]Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin:
Computing Phylogenetic Roots with Bounded Degrees and Errors. WADS 2001: 377-388 - 2000
- [j9]D. Frank Hsu, Xiao-Dong Hu, Guo-Hui Lin:
On Minimum-Weight k-Edge Connected Steiner Networks on Metric Spaces. Graphs Comb. 16(3): 275-284 (2000) - [j8]Sui-Xiang Gao, Guo-Hui Lin:
Decision Tree Complexity of Graph Properties with Dimension at Most 5. J. Comput. Sci. Technol. 15(5): 416-422 (2000) - [j7]Donghui Chen, Ding-Zhu Du, Xiao-Dong Hu, Guohui Lin, Lusheng Wang, Guoliang Xue:
Approximations for Steiner Trees with Minimum Number of Steiner Points. J. Glob. Optim. 18(1): 17-33 (2000) - [j6]Guo-Hui Lin, Guoliang Xue:
Reducing the Steiner problem in four uniform orientations. Networks 35(4): 287-301 (2000) - [c12]Eric Bach, Joan Boyar
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. COCOON 2000: 221-231 - [c11]Tao Jiang
The Longest Common Subsequence Problem for Arc-Annotated Sequences. CPM 2000: 154-165 - [c10]Guo-Hui Lin, Tao Jiang
Phylogenetic k-Root and Steiner k-Root. ISAAC 2000: 539-551 - [c9]Guo-Hui Lin, Guoliang Xue:
A linear time algorithm for computing hexagonal Steiner minimum trees for terminals on the boundary of a regular hexagon. ISCAS 2000: 196-199 - [c8]Guo-Hui Lin, Guoliang Xue:
Optimal layout of hexagonal minimum spanning trees in linear time [VLSI]. ISCAS 2000: 633-636
1990 – 1999
- 1999
- [j5]Guo-Hui Lin, Guoliang Xue:
Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length. Inf. Process. Lett. 69(2): 53-57 (1999) - [j4]Guo-Hui Lin, Ding-Zhu Du, Xiao-Dong Hu, Guoliang Xue:
On Rearrangeability of Multirate Clos Networks. SIAM J. Comput. 28(4): 1225-1231 (1999) - [c7]Guo-Hui Lin, Guoliang Xue:
Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations. COCOON 1999: 71-80 - [c6]Guo-Hui Lin, Guoliang Xue, Defang Zhou:
Approximating Hexagonal Steiner Minimal Trees by Fast Optimal Layout of Minimum Spanning Trees. ICCD 1999: 392- - [c5]Guo-Hui Lin, Guoliang Xue:
Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane. ISCAS (6) 1999: 117-120 - [c4]Guo-Hui Lin, Andrew P. Thurber, Guoliang Xue:
The 1-Steiner tree problem in lambda-3 geometry plane. ISCAS (6) 1999: 125-128 - [c3]Guoliang Xue, Guo-Hui Lin, Ding-Zhu Du:
Grade of service Euclidean Steiner minimum trees. ISCAS (6) 1999: 182-185 - 1998
- [j3]Guo-Hui Lin:
The Exact Bound of Lee's MLPT. Discret. Appl. Math. 85(3): 251-254 (1998) - [j2]Guo-Hui Lin, En-Yu Yao, Yong He:
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times. Oper. Res. Lett. 22(2-3): 75-81 (1998) - [j1]Guo-Hui Lin, Guoliang Xue:
K-Center and K-Median Problems in Graded Distances. Theor. Comput. Sci. 207(1): 181-192 (1998) - [c2]Guo-Hui Lin, Guoliang Xue:
The Steiner Tree Problem in Lambda4-geometry Plane. ISAAC 1998: 327-336 - 1997
- [c1]Guo-Hui Lin, Ding-Zhu Du, Weili Wu, Kyeongah Yoo:
On 3-rate rearrangeability of Clos networks. Advances in Switching Networks 1997: 315-333
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: