Guohui Lin

ORCID

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 94

Top Venues

Publications

Mingyang Gong, Guohui Lin, Eiji Miyano, Bing Su, Weitian Tong
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. Ann. Oper. Res. 335 (1) (2024)
Hiroshi Eto, Shunsuke Kawaharada, Guohui Lin, Eiji Miyano, Tugce Ozdemir
Directed Path Partition Problem on Directed Acyclic Graphs. IWOCA (2024)
Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano
Approximation Algorithms for Covering Vertices by Long Paths. Algorithmica 86 (8) (2024)
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) (2024)
Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang
Approximating the directed path partition problem. Inf. Comput. 297 (2024)
Qiaojun Shu, Guohui Lin
Planar graphs are acyclically edge (Δ + 5)-colorable. J. Comb. Optim. 47 (4) (2024)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Polynomial-time equivalences and refined algorithms for longest common subsequence variants. Discret. Appl. Math. 353 (2024)
Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
On Computing a Center Persistence Diagram. FCT (2023)
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
Path Cover Problems with Length Cost. Algorithmica 85 (11) (2023)
Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Zhaohui Zhan
An Approximation Algorithm for Covering Vertices by 4^+-Paths. CoRR (2023)
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 (2023)
Yuichi Asahiro, Hiroshi Eto, Mingyang Gong, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Shunichi Tanaka
Approximation Algorithms for the Longest Run Subsequence Problem. CPM (2023)
Qiaojun Shu, Guohui Lin
Planar graphs are acyclically edge (Δ+ 5)-colorable. CoRR (2023)
Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang
-Paths. COCOA (1) (2023)
Mingyang Gong, Zhi-Zhong Chen, Guohui Lin
Randomized algorithms for fully online multiprocessor scheduling with testing. CoRR (2023)
Yuichi Asahiro, Hiroshi Eto, Kana Korenaga, Guohui Lin, Eiji Miyano, Reo Nonoue
Independent Set Under a Change Constraint from an Initial Solution. CIAC (2023)
Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu, An Zhang
Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim. 44 (3) (2022)
Mingyang Gong, Randy Goebel, Guohui Lin, Eiji Miyano
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing. J. Comb. Optim. 44 (1) (2022)
Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano
Approximation algorithms for covering vertices by long paths. CoRR (2022)
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
Path Cover Problems with Length Cost. WALCOM (2022)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants. CPM (2022)
Mingyang Gong, Jing Fan, Guohui Lin, Eiji Miyano
Approximation Algorithms for Covering Vertices by Long Paths. MFCS (2022)
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. J. Comb. Optim. 44 (5) (2022)
Yong Chen, Yinhui Cai, Longcheng Liu, Guangting Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph. J. Comb. Optim. 43 (3) (2022)
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 (2022)
Wenchang Luo, Rylan Chin, Alexander Cai, Guohui Lin, Bing Su, An Zhang
A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling. J. Comb. Optim. 44 (1) (2022)
Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang
Approximation Algorithms for the Directed Path Partition Problems. IJTCS-FAW (2021)
Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang
Approximation algorithms for the directed path partition problems. CoRR (2021)
Guohui Lin, Weitian Tong
An improved approximation algorithm for the minimum common integer partition problem. Inf. Comput. 281 (2021)
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang
A randomized approximation algorithm for metric triangle packing. J. Comb. Optim. 41 (1) (2021)
Jianming Dong, Randy Goebel, Jueliang Hu, Guohui Lin, Bing Su
Minimizing total job completion time in MapReduce scheduling. Comput. Ind. Eng. 158 (2021)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Parameterized algorithms for the Happy Set problem. Discret. Appl. Math. 304 (2021)
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 (2021)
Mingyang Gong, Guohui Lin
Improved Approximation Algorithms for Multiprocessor Scheduling with Testing. IJTCS-FAW (2021)
Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Theor. Comput. Sci. 882 (2021)
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang
Approximation Algorithms for Maximally Balanced Connected Graph Partition. Algorithmica 83 (12) (2021)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Complexity and approximability of the happy set problem. Theor. Comput. Sci. 866 (2021)
Yong Chen, Guohui Lin, Tian Liu, Taibo Luo, Bing Su, Yao Xu, Peng Zhang
A (1.4 + ε )-approximation algorithm for the 2-Max-Duo problem. J. Comb. Optim. 40 (3) (2020)
Longcheng Liu, Yong Chen, Jianming Dong, Randy Goebel, Guohui Lin, Yue Luo, Guanqun Ni, Bing Su, Yao Xu, An Zhang
Approximation algorithms for the three-machine proportionate mixed shop scheduling. Theor. Comput. Sci. 803 (2020)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Graph Classes and Approximability of the Happy Set Problem. COCOON (2020)
Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru
Parameterized Algorithms for the Happy Set Problem. WALCOM (2020)
Wenchang Luo, Miaomiao Jin, Bing Su, Guohui Lin
An approximation scheme for rejection-allowed single-machine rescheduling. Comput. Ind. Eng. 146 (2020)
Qiaojun Shu, Guohui Lin, Eiji Miyano
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. CoRR (2020)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Exact algorithms for the repetition-bounded longest common subsequence problem. Theor. Comput. Sci. 838 (2020)
Yong Chen, Randy Goebel, Guohui Lin, Bing Su, An Zhang
Open-shop scheduling for unit jobs under precedence constraints. Theor. Comput. Sci. 803 (2020)
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) (2020)
An Zhang, Yong Chen, Zhi-Zhong Chen, Guohui Lin
Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs. Algorithmica 82 (10) (2020)
Qiaojun Shu, Yong Chen, Shuguang Han, Guohui Lin, Eiji Miyano, An Zhang
Acyclic Edge Coloring Conjecture Is True on Planar Graphs Without Intersecting Triangles. TAMC (2020)
Xing Wang, Guangting Chen, Yong Chen, Guohui Lin, Yonghao Wang, An Zhang
Improved Hardness and Approximation Results for Single Allocation Hub Location. AAIM (2020)
Yong Chen, Randy Goebel, Guohui Lin, Bing Su, Yao Xu, An Zhang
An improved approximation algorithm for the minimum 3-path partition problem. J. Comb. Optim. 38 (1) (2019)
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang
Approximation algorithms for maximally balanced connected graph partition. CoRR (2019)
Yuichi Asahiro, Jesper Jansson, Guohui Lin, Eiji Miyano, Hirotaka Ono, Tadatoshi Utashima
Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem. COCOA (2019)
Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. Algorithmica 81 (11-12) (2019)
Yuichi Asahiro, Guohui Lin, Zhilong Liu, Eiji Miyano
-Free Regular Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2019)
Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin
Single-machine scheduling with job-dependent machine deterioration. J. Sched. 22 (6) (2019)
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)
Shanshan Zhai, Peng Zhang, Daming Zhu, Weitian Tong, Yao Xu, Guohui Lin
An approximation algorithm for genome sorting by reversals to recover all adjacencies. J. Comb. Optim. 37 (4) (2019)
Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu
On Computing a Center Persistence Diagram. CoRR (2019)
Huili Zhang, Weitian Tong, Guohui Lin, Yinfeng Xu
Online minimum latency problem with edge uncertainty. Eur. J. Oper. Res. 273 (2) (2019)
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang
A Randomized Approximation Algorithm for Metric Triangle Packing. COCOA (2019)
Lin Chen, Minming Li, Guohui Lin, Kai Wang
Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement). SPAA (2019)
Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang
Approximation Algorithms for Maximally Balanced Connected Graph Partition. COCOA (2019)
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) (2019)
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)
Jianming Dong, Xueshi Wang, Jueliang Hu, Guohui Lin
Single machine scheduling with job delivery to multiple customers. J. Sched. 21 (3) (2018)
Wenchang Luo, Yao Xu, Boyuan Gu, Weitian Tong, Randy Goebel, Guohui Lin
Algorithms for Communication Scheduling in Data Gathering Network with Data Compression. Algorithmica 80 (11) (2018)
Wenchang Luo, Taibo Luo, Randy Goebel, Guohui Lin
Rescheduling due to machine disruption to minimize the total weighted completion time. J. Sched. 21 (5) (2018)
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 (2018)
An Zhang, Yong Chen, Zhi-Zhong Chen, Guohui Lin
Improved approximation algorithms for path vertex covers in regular graphs. CoRR (2018)
Wenchang Luo, Bing Su, Yao Xu, Guohui Lin
An Approximation Framework for Bounded Facility Location Problems. COCOON (2018)
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 (2018)
An Zhang, Yong Chen, Randy Goebel, Guohui Lin
Open-Shop Scheduling for Unit Jobs Under Precedence Constraints. COCOA (2018)
Peng Zhang, Yao Xu, Tao Jiang, Angsheng Li, Guohui Lin, Eiji Miyano
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. Algorithmica 80 (5) (2018)
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) (2018)
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 (2018)
Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops. Theor. Comput. Sci. 734 (2018)
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)
Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. COCOON (2017)
Jianming Dong, Weitian Tong, Taibo Luo, Xueshi Wang, Jueliang Hu, Yinfeng Xu, Guohui Lin
An FPTAS for the parallel two-stage flowshop problem. Theor. Comput. Sci. 657 (2017)
Yao Xu, Yong Chen, Taibo Luo, Guohui Lin
A (1.4 + ε)-approximation algorithm for the 2-{Max-Duo} problem. CoRR (2017)
Yao Xu, Yong Chen, Taibo Luo, Guohui Lin
A local search 2.917-approximation algorithm for duo-preservation string mapping. CoRR (2017)
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)
Wenchang Luo, Taibo Luo, Randy Goebel, Guohui Lin
On rescheduling due to machine disruption while to minimize the total weighted completion time. CoRR (2017)
Jianming Dong, Jueliang Hu, Mikhail Y. Kovalyov, Guohui Lin, Taibo Luo, Weitian Tong, Xueshi Wang, Yinfeng Xu
Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72]. Theor. Comput. Sci. 687 (2017)
Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong, Randy Goebel, Yinfeng Xu, Guohui Lin
Machine scheduling with a maintenance interval and job delivery coordination. Optim. Lett. 10 (8) (2016)
Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen
Approximation algorithms for the maximum weight internal spanning tree problem. CoRR (2016)
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) (2016)
Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin
Single machine scheduling with job-dependent machine deterioration. CoRR (2016)
Yao Xu, Randy Goebel, Guohui Lin
Submodular and supermodular multi-labeling, and vertex happiness. CoRR (2016)
Huili Zhang, Weitian Tong, Yinfeng Xu, Guohui Lin
The Steiner traveling salesman problem with online advanced edge blockages. Comput. Oper. Res. 70 (2016)
Weitian Tong, Randy Goebel, Guohui Lin
Smoothed heights of tries and patricia tries. Theor. Comput. Sci. 609 (2016)
Weitian Tong, Eiji Miyano, Randy Goebel, Guohui Lin
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan. FAW (2016)
Jianming Dong, Xueshi Wang, Jueliang Hu, Guohui Lin
An improved two-machine flowshop scheduling with intermediate transportation. J. Comb. Optim. 31 (3) (2016)
Wenchang Luo, Yao Xu, Weitian Tong, Guohui Lin
Single Machine Scheduling with Job-Dependent Machine Deterioration. ISAAC (2016)
Huili Zhang, Weitian Tong, Yinfeng Xu, Guohui Lin
The Steiner Traveling Salesman Problem with online edge blockages. Eur. J. Oper. Res. 243 (1) (2015)
Yining Wang, Tim Wylie, Paul Stothard, Guohui Lin
Whole genome SNP genotype piecemeal imputation. BMC Bioinform. 16 (2015)
Liqin Huang, Weitian Tong, Randy Goebel, Tian Liu, Guohui Lin
A 0.5358-approximation for Bandpass-2. J. Comb. Optim. 30 (3) (2015)
Jueliang Hu, Taibo Luo, Xiaotong Su, Jianming Dong, Weitian Tong, Randy Goebel, Yinfeng Xu, Guohui Lin
Machine Scheduling with a Maintenance Interval and Job Delivery Coordination. FAW (2015)
Francis Y. L. Chin, Bin Fu, Jiuling Guo, Shuguang Han, Jueliang Hu, Minghui Jiang, Guohui Lin, Hing-Fung Ting, Luping Zhang, Yong Zhang, Diwei Zhou
Competitive algorithms for unbounded one-way trading. Theor. Comput. Sci. 607 (2015)
Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu
Improved parameterized and exact algorithms for cut problems on trees. Theor. Comput. Sci. 607 (2015)

Guohui Lin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guohui Lin