Guohui Lin

According to our database1, Guohui Lin authored at least 182 papers between 1997 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

An improved approximation algorithm for the minimum 3-path partition problem.
J. Comb. Optim., 2019

Online minimum latency problem with edge uncertainty.
European Journal of Operational Research, 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

A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 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. Scheduling, 2018

Single machine scheduling with job delivery to multiple customers.
J. Scheduling, 2018

Communication scheduling in data gathering networks of heterogeneous sensors with data compression: Algorithms and empirical experiments.
European Journal of Operational Research, 2018

A local search 4/3-approximation algorithm for the minimum 3-path partition problem.
CoRR, 2018

Improved approximation algorithms for path vertex covers in regular graphs.
CoRR, 2018

Approximation algorithms for the three-machine proportionate mixed shop scheduling.
CoRR, 2018

Approximation algorithms for two-machine flow-shop scheduling with a conflict graph.
CoRR, 2018

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.
Algorithmica, 2018

Algorithms for Communication Scheduling in Data Gathering Network with Data Compression.
Algorithmica, 2018

An Approximation Framework for Bounded Facility Location Problems.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Open-Shop Scheduling for Unit Jobs Under Precedence Constraints.
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
An FPTAS for the parallel two-stage flowshop problem.
Theor. Comput. Sci., 2017

Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72].
Theor. Comput. Sci., 2017

A (1.4 + ε)-approximation algorithm for the 2-{Max-Duo} problem.
CoRR, 2017

A local search 2.917-approximation algorithm for duo-preservation string mapping.
CoRR, 2017

On rescheduling due to machine disruption while to minimize the total weighted completion time.
CoRR, 2017

A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016
Smoothed heights of tries and patricia tries.
Theor. Comput. Sci., 2016

Machine scheduling with a maintenance interval and job delivery coordination.
Optimization Letters, 2016

A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines.
Optimization Letters, 2016

An improved two-machine flowshop scheduling with intermediate transportation.
J. Comb. Optim., 2016

Submodular and supermodular multi-labeling, and vertex happiness.
CoRR, 2016

Single machine scheduling with job-dependent machine deterioration.
CoRR, 2016

Approximation algorithms for the maximum weight internal spanning tree problem.
CoRR, 2016

The Steiner traveling salesman problem with online advanced edge blockages.
Computers & OR, 2016

Single Machine Scheduling with Job-Dependent Machine Deterioration.
Proceedings of the 27th International Symposium on Algorithms and Computation, 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
Improved parameterized and exact algorithms for cut problems on trees.
Theor. Comput. Sci., 2015

Competitive algorithms for unbounded one-way trading.
Theor. Comput. Sci., 2015

A 0.5358-approximation for Bandpass-2.
J. Comb. Optim., 2015

The Steiner Traveling Salesman Problem with online edge blockages.
European Journal of Operational Research, 2015

Whole genome SNP genotype piecemeal imputation.
BMC Bioinformatics, 2015

Isomorphism and similarity for 2-generation pedigrees.
BMC Bioinformatics, 2015

Machine Scheduling with a Maintenance Interval and Job Delivery Coordination.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

2014
Approximating the maximum multiple RNA interaction problem.
Theor. Comput. Sci., 2014

Approximating the minimum independent dominating set in perturbed graphs.
Theor. Comput. Sci., 2014

On the approximability of the exemplar adjacency number problem for genomes with gene repetitions.
Theor. Comput. Sci., 2014

Preface.
J. Comb. Optim., 2014

Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems.
Proceedings of the Theory and Applications of Models of Computation, 2014

An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

On the Smoothed Heights of Trie and Patricia Index Trees.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

Algorithms for Cut Problems on Trees.
Proceedings of the Combinatorial Optimization and Applications, 2014

Partially Dynamic Single-Source Shortest Paths on Digraphs with Positive Weights.
Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013
Preface.
Theor. Comput. Sci., 2013

Preface.
J. Comb. Optim., 2013

Whole genome Identity-by-Descent determination.
J. Bioinformatics and Computational Biology, 2013

Algorithms for Cut Problems on Trees
CoRR, 2013

An approximation algorithm for the Bandpass-2 problem.
CoRR, 2013

Protein-chemical Interaction Prediction via Kernelized Sparse Learning SVM.
Proceedings of the Biocomputing 2013: Proceedings of the Pacific Symposium, 2013

Approximating the Minimum Independent Dominating Set in Perturbed Graphs.
Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Approximation Algorithms for the Maximum Multiple RNA Interaction Problem.
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

Linear Coherent Bi-Clustering via Beam Searching and Sample Set Clustering.
Discrete Math., Alg. and Appl., 2012

Sparse Learning Based Linear Coherent Bi-clustering.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

An Improved Approximation Algorithm for the Bandpass Problem.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
The three column Bandpass problem is solvable in linear time.
Theor. Comput. Sci., 2011

Size-constrained tree partitioning: Approximating the multicast k-tree routing problem.
Theor. Comput. Sci., 2011

On the Bandpass problem.
J. Comb. Optim., 2011

Diameter-Constrained Steiner Trees.
Discrete Math., Alg. and Appl., 2011

An Approximation Algorithm for the Minimum Co-Path Set Problem.
Algorithmica, 2011

Enhancement of incremental design for FPGAs using circuit similarity.
Proceedings of the 12th International Symposium on Quality Electronic Design, 2011

An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
Finding the Nearest Neighbors in Biological Databases Using Less Distance Computations.
IEEE/ACM Trans. Comput. Biology Bioinform., 2010

PROSESS: a protein structure evaluation suite and server.
Nucleic Acids Research, 2010

Linear time construction of 5-phylogenetic roots for tree chordal graphs.
J. Comb. Optim., 2010

Accelerating FPGA design space exploration using circuit similarity-based placement.
Proceedings of the International Conference on Field-Programmable Technology, 2010

Linear Coherent Bi-cluster Discovery via Beam Detection and Sample Set Clustering.
Proceedings of the Combinatorial Optimization and Applications, 2010

Diameter-Constrained Steiner Tree.
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
A 3.4713-approximation algorithm for the capacitated multicast tree routing problem.
Theor. Comput. Sci., 2009

On the upper bounds of the minimum number of rows of disjunct matrices.
Optimization Letters, 2009

GeNMR: a web server for rapid NMR-based protein structure determination.
Nucleic Acids Research, 2009

On the Parameterized Complexity of Pooling Design.
Journal of Computational Biology, 2009

ComPhy: prokaryotic composite distance phylogenies inferred from whole-genome gene sets.
BMC Bioinformatics, 2009

Most parsimonious haplotype allele sharing determination.
BMC Bioinformatics, 2009

Editorial, COCOON 2007 Special Issue.
Algorithmica, 2009

Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting.
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 Research, 2008

PPT-DB: the protein property prediction and testing database.
Nucleic Acids Research, 2008

Editorial, COCOON 2007 special issue.
J. Comb. Optim., 2008

Ubiquitous Reassortments in influenza a viruses.
J. Bioinformatics and Computational Biology, 2008

Protein contact order prediction from primary sequences.
BMC Bioinformatics, 2008

Identifying a few foot-and-mouth disease virus signature nucleotide strings for computational genotyping.
BMC Bioinformatics, 2008

Identification of linked regions using high-density SNP genotype data in linkage analysis.
Bioinformatics, 2008

Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability.
Algorithms for Molecular Biology, 2008

Detecting Community Structure by Network Vectorization.
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
Quartet-Based Phylogeny Reconstruction with Answer Set Programming.
IEEE/ACM Trans. Comput. Biology Bioinform., 2007

CISA: Combined NMR Resonance Connectivity Information Determination and Sequential Assignment.
IEEE/ACM Trans. Comput. Biology Bioinform., 2007

Gasa: a Graph-Based Automated NMR Backbone Resonance Sequential Assignment Program.
J. Bioinformatics and Computational Biology, 2007

Efficient composite pattern finding from monad patterns.
IJBRA, 2007

Selecting dissimilar genes for multi-class classification, an application in cancer subtyping.
BMC Bioinformatics, 2007

Nucleotide composition string selection in HIV-1 subtyping using whole genomes.
Bioinformatics, 2007

Selecting Genes with Dissimilar Discrimination Strength for Sample Class Prediction.
Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006
Strictly chordal graphs are leaf powers.
J. Discrete Algorithms, 2006

Editorial: In memoriam: Yong He (1969-2005).
J. Comb. Optim., 2006

Rnall: an Efficient Algorithm for Predicting Rna Local Secondary Structural Landscape in Genomes.
J. Bioinformatics and Computational Biology, 2006

Iterated Local Least Squares Microarray Missing Value Imputation.
J. Bioinformatics and Computational Biology, 2006

A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors.
Inf. Process. Lett., 2006

Vertex covering by paths on trees with its applications in machine translation.
Inf. Process. Lett., 2006

Phylogenetic analysis using complete signature information of whole genomes and clustered Neighbour-Joining method.
IJBRA, 2006

Statistical evaluation of NMR backbone resonance assignment.
IJBRA, 2006

A stable gene selection in microarray data analysis.
BMC Bioinformatics, 2006

A Model-Free Greedy Gene Selection for Microarray Sample Class Prediction.
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

Microarray Missing Value Imputation by Iterated Local Least Squares.
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
An Improved Approximation Algorithm for Multicast k-Tree Routing.
J. Comb. Optim., 2005

Clustering Binary Oligonucleotide Fingerprint Vectors for DNA Clone Classification Analysis.
J. Comb. Optim., 2005

More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling.
Journal of Computational Biology, 2005

Heuristic Search in Constrained Bipartite Matching with Applications to Protein Nmr Backbone Resonance Assignment.
J. Bioinformatics and Computational Biology, 2005

A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Application of Smodels in Quartet Based Phylogeny Construction.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005

5-th Phylogenetic Root Construction for Strictly Chordal Graphs.
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

Whole Genome Phylogeny Based on Clustered Signature String Composition.
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference Workshops & Poster Abstracts, 2005

Improved Approximation Algorithms for the Capacitated Multicast Routing Problem.
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

A Model-Free and Stable Gene Selection in Microarray Data Analysis.
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
A space-efficient algorithm for sequence alignment with inversions and reversals.
Theor. Comput. Sci., 2004

The longest common subsequence problem for arc-annotated sequences.
J. Discrete Algorithms, 2004

A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition.
J. Comb. Optim., 2004

Histogram-based Scoring Schemes for Protein Nmr Resonance Assignment.
J. Bioinformatics and Computational Biology, 2004

Quartet Based Phylogeny Reconstruction with Answer Set Programming.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004

2003
Approximation algorithms for NMR spectral peak assignment.
Theor. Comput. Sci., 2003

Computing Phylogenetic Roots with Bounded Degrees and Errors.
SIAM J. Comput., 2003

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Scheduling, 2003

Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering.
J. Bioinformatics and Computational Biology, 2003

Protein Threading by Linear Programming.
Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling.
Proceedings of the Algorithms, 2003

Automated Protein NMR Resonance Assignments.
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003

A Space Efficient Algorithm for Sequence Alignment with Inversions.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
The longest common subsequence problem for sequences with nested arc annotations.
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

3-Partitioning Problems for Maximizing the Minimum Load.
J. Comb. Optim., 2002

A General Edit Distance between RNA Structures.
Journal of Computational Biology, 2002

On the terminal Steiner tree problem.
Inf. Process. Lett., 2002

Improved Approximation Algorithms for NMR Spectral Peak Assignment.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Survivable routing in WDM networks - logical ring in arbitrary physical topology.
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

Approximations for Steiner trees with minimum number of Steiner points.
Theor. Comput. Sci., 2001

Grade of Service Steiner Minimum Trees in the Euclidean Plane.
Algorithmica, 2001

Computing Phylogenetic Roots with Bounded Degrees and Errors.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Edit distance between two RNA structures.
Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Reducing the Steiner problem in four uniform orientations.
Networks, 2000

Approximations for Steiner Trees with Minimum Number of Steiner Points.
J. Global Optimization, 2000

Decision Tree Complexity of Graph Properties with Dimension at Most 5.
J. Comput. Sci. Technol., 2000

On Minimum-Weight k-Edge Connected Steiner Networks on Metric Spaces.
Graphs and Combinatorics, 2000

Optimal layout of hexagonal minimum spanning trees in linear time [VLSI].
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

Phylogenetic k-Root and Steiner k-Root.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

The Longest Common Subsequence Problem for Arc-Annotated Sequences.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
On Rearrangeability of Multirate Clos Networks.
SIAM J. Comput., 1999

Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length.
Inf. Process. Lett., 1999

Grade of service Euclidean Steiner minimum trees.
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999

Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane.
Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30, 1999

The 1-Steiner tree problem in lambda-3 geometry plane.
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

Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
K-Center and K-Median Problems in Graded Distances.
Theor. Comput. Sci., 1998

Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times.
Oper. Res. Lett., 1998

The Exact Bound of Lee's MLPT.
Discrete Applied Mathematics, 1998

The Steiner Tree Problem in Lambda4-geometry Plane.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
On 3-rate rearrangeability of Clos networks.
Proceedings of the Advances in Switching Networks, 1997


  Loading...