Guohui Lin
Orcid: 0000-0003-4283-3396Affiliations:
- University of Alberta, Edmonton, Canada
According to our database1,
Guohui Lin
authored at least 208 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Algorithmica, August, 2024
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops.
Ann. Oper. Res., April, 2024
Bi-objective carbon-efficient distributed flow-shop scheduling with multistep electricity pricing.
Int. J. Prod. Res., 2024
Polynomial-time equivalences and refined algorithms for longest common subsequence variants.
Discret. Appl. Math., 2024
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024
2023
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144].
Theor. Comput. Sci., October, 2023
CoRR, 2023
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023
Proceedings of the Combinatorial Optimization and Applications, 2023
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023
2022
A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling.
J. Comb. Optim., 2022
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing.
J. Comb. Optim., 2022
J. Comb. Optim., 2022
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph.
J. Comb. Optim., 2022
Approximation algorithms for the maximally balanced connected graph tripartition problem.
J. Comb. Optim., 2022
An efficient polynomial-time approximation scheme for parallel multi-stage open shops.
CoRR, 2022
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
2021
Improved hardness and approximation results for single allocation hub location problems.
Theor. Comput. Sci., 2021
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles.
Theor. Comput. Sci., 2021
J. Comb. Optim., 2021
An improved approximation algorithm for the minimum common integer partition problem.
Inf. Comput., 2021
Comput. Ind. Eng., 2021
Algorithmica, 2021
Proceedings of the Frontiers of Algorithmics - International Joint Conference, 2021
Proceedings of the Frontiers of Algorithmics - International Joint Conference, 2021
2020
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
Theor. Comput. Sci., 2020
Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments.
J. Sched., 2020
J. Comb. Optim., 2020
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles.
CoRR, 2020
Comput. Ind. Eng., 2020
Algorithmica, 2020
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020
Proceedings of the Algorithmic Aspects in Information and Management, 2020
2019
An approximation algorithm for genome sorting by reversals to recover all adjacencies.
J. Comb. Optim., 2019
A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops.
J. Comb. Optim., 2019
J. Comb. Optim., 2019
An Approximation Algorithm for the Maximum Induced Matching Problem on <i>C</i><sub>5</sub>-Free Regular Graphs.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019
Algorithmica, 2019
Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement).
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019
Proceedings of the Combinatorial Optimization and Applications, 2019
2018
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops.
Theor. Comput. Sci., 2018
Rescheduling due to machine disruption to minimize the total weighted completion time.
J. Sched., 2018
Communication scheduling in data gathering networks of heterogeneous sensors with data compression: Algorithms and empirical experiments.
Eur. J. Oper. Res., 2018
CoRR, 2018
Algorithmica, 2018
Algorithms for Communication Scheduling in Data Gathering Network with Data Compression.
Algorithmica, 2018
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018
Proceedings of the Combinatorial Optimization and Applications, 2018
Approximation Algorithms and a Hardness Result for the Three-Machine Proportionate Mixed Shop.
Proceedings of the Algorithmic Aspects in Information and Management, 2018
2017
Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72].
Theor. Comput. Sci., 2017
CoRR, 2017
On rescheduling due to machine disruption while to minimize the total weighted completion time.
CoRR, 2017
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017
2016
Optim. Lett., 2016
A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines.
Optim. Lett., 2016
J. Comb. Optim., 2016
CoRR, 2016
Comput. Oper. Res., 2016
A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016
2015
Theor. Comput. Sci., 2015
Eur. J. Oper. Res., 2015
2014
Theor. Comput. Sci., 2014
Theor. Comput. Sci., 2014
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions.
Theor. Comput. Sci., 2014
Proceedings of the Theory and Applications of Models of Computation, 2014
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014
Proceedings of the Combinatorial Optimization and Applications, 2014
Proceedings of the Algorithmic Aspects in Information and Management, 2014
2013
Proceedings of the Biocomputing 2013: Proceedings of the Pacific Symposium, 2013
Proceedings of the Combinatorial Optimization and Applications, 2013
2012
An improved approximation algorithm for the complementary maximal strip recovery problem.
J. Comput. Syst. Sci., 2012
Exact and approximation algorithms for the complementary maximal strip recovery problem.
J. Comb. Optim., 2012
Solving haplotype inference problem with non-genotyped founders via integer linear programming.
J. Comb. Optim., 2012
Discret. Math. Algorithms Appl., 2012
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012
2011
Theor. Comput. Sci., 2011
Size-constrained tree partitioning: Approximating the multicast k-tree routing problem.
Theor. Comput. Sci., 2011
Proceedings of the 12th International Symposium on Quality Electronic Design, 2011
2010
Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010
J. Comb. Optim., 2010
Proceedings of the International Conference on Field-Programmable Technology, 2010
Proceedings of the Combinatorial Optimization and Applications, 2010
Proceedings of the Combinatorial Optimization and Applications, 2010
Randomized Approaches for Nearest Neighbor Search in Metric Space When Computing the Pairwise Distance Is Extremely Expensive.
Proceedings of the Algorithmic Aspects in Information and Management, 2010
2009
Theor. Comput. Sci., 2009
Optim. Lett., 2009
Nucleic Acids Res., 2009
ComPhy: prokaryotic composite distance phylogenies inferred from whole-genome gene sets.
BMC Bioinform., 2009
Proceedings of the Combinatorial Optimization and Applications, 2009
Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem.
Proceedings of the Combinatorial Optimization and Applications, 2009
2008
CS23D: a web server for rapid protein structure generation using NMR chemical shifts and sequence data.
Nucleic Acids Res., 2008
Nucleic Acids Res., 2008
Identifying a few foot-and-mouth disease virus signature nucleotide strings for computational genotyping.
BMC Bioinform., 2008
Identification of linked regions using high-density SNP genotype data in linkage analysis.
Bioinform., 2008
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability.
Algorithms Mol. Biol., 2008
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem.
Proceedings of the Combinatorial Optimization and Applications, 2008
2007
IEEE ACM Trans. Comput. Biol. Bioinform., 2007
CISA: Combined NMR Resonance Connectivity Information Determination and Sequential Assignment.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007
J. Bioinform. Comput. Biol., 2007
Int. J. Bioinform. Res. Appl., 2007
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping.
BMC Bioinform., 2007
Bioinform., 2007
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007
2006
Rnall: an Efficient Algorithm for Predicting Rna Local Secondary Structural Landscape in Genomes.
J. Bioinform. Comput. Biol., 2006
J. Bioinform. Comput. Biol., 2006
A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors.
Inf. Process. Lett., 2006
Inf. Process. Lett., 2006
Phylogenetic analysis using complete signature information of whole genomes and clustered Neighbour-Joining method.
Int. J. Bioinform. Res. Appl., 2006
Int. J. Bioinform. Res. Appl., 2006
Proceedings of the 2006 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2006
Simplicity in RNA Secondary Structure Alignment: Towards biologically plausible alignments.
Proceedings of the Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 2006
Using Gene Clustering to Identify Discriminatory Genes with Higher Classification Accuracy.
Proceedings of the Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 2006
Proceedings of 4th Asia-Pacific Bioinformatics Conference. 13-16 February 2006, 2006
Feature Extraction for Classification of Proteomic Mass Spectra: A Comparative Study.
Proceedings of the Feature Extraction - Foundations and Applications, 2006
2005
J. Comb. Optim., 2005
Clustering Binary Oligonucleotide Fingerprint Vectors for DNA Clone Classification Analysis.
J. Comb. Optim., 2005
J. Comput. Biol., 2005
Heuristic Search in Constrained Bipartite Matching with Applications to Protein Nmr Backbone Resonance Assignment.
J. Bioinform. Comput. Biol., 2005
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
A Polynomial Algorithm for the Minimum Quartet Inconsistency Problem with O(n) Quartet Errors.
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference Workshops & Poster Abstracts, 2005
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference Workshops & Poster Abstracts, 2005
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005
Selected String Representation for Whole Genomes.
Proceedings of the 2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2005
Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005
Faster solution to the maximum quartet consistency problem with constraint programming.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005
2004
Theor. Comput. Sci., 2004
J. Discrete Algorithms, 2004
J. Comb. Optim., 2004
J. Bioinform. Comput. Biol., 2004
2003
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Sched., 2003
Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering.
J. Bioinform. Comput. Biol., 2003
Proceedings of the 8th Pacific Symposium on Biocomputing, 2003
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
2002
J. Comput. Syst. Sci., 2002
Methods for reconstructing the history of tandem repeats and their application to the human genome.
J. Comput. Syst. Sci., 2002
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002
Proceedings of the IEEE International Conference on Communications, 2002
An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks.
Proceedings of the 1st IEEE Computer Society Bioinformatics Conference, 2002
2001
Signed genome rearrangement by reversals and transpositions: models and approximations.
Theor. Comput. Sci., 2001
Theor. Comput. Sci., 2001
Proceedings of the Fifth Annual International Conference on Computational Biology, 2001
2000
J. Comput. Sci. Technol., 2000
Graphs Comb., 2000
Proceedings of the IEEE International Symposium on Circuits and Systems, 2000
A linear time algorithm for computing hexagonal Steiner minimum trees for terminals on the boundary of a regular hexagon.
Proceedings of the IEEE International Symposium on Circuits and Systems, 2000
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000
1999
Inf. Process. Lett., 1999
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999
Approximating Hexagonal Steiner Minimal Trees by Fast Optimal Layout of Minimum Spanning Trees.
Proceedings of the IEEE International Conference On Computer Design, 1999
1998
Theor. Comput. Sci., 1998
Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times.
Oper. Res. Lett., 1998
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998
1997
Proceedings of the Advances in Switching Networks, 1997