# Binhai Zhu

According to our database

Collaborative distances:

^{1}, Binhai Zhu authored at least 195 papers between 1991 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2019

Efficient algorithms for computing one or two discrete centers hitting a set of line segments.

J. Comb. Optim., 2019

2018

Finding disjoint dense clubs in a social network.

Theor. Comput. Sci., 2018

A 2

*k*-kernelization algorithm for vertex cover based on crown decomposition.
Theor. Comput. Sci., 2018

Solving the maximum internal spanning tree problem on interval graphs in polynomial time.

Theor. Comput. Sci., 2018

The connected disk covering problem.

J. Comb. Optim., 2018

A 2-approximation algorithm for the contig-based genomic scaffold filling problem.

J. Bioinformatics and Computational Biology, 2018

Approximate Nearest Neighbors in the Space of Persistence Diagrams.

CoRR, 2018

On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model.

CoRR, 2018

On Approaching the One-Sided Exemplar Adjacency Number Problem.

Proceedings of the Bioinformatics Research and Applications - 14th International Symposium, 2018

A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications.

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

Hitting a Set of Line Segments with One or Two Discrete Centers.

Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

On the Minimum Copy Number Generation Problem in Cancer Genomics.

Proceedings of the 2018 ACM International Conference on Bioinformatics, 2018

2017

Improved algorithms for intermediate dataset storage in a cloud-based dataflow.

Theor. Comput. Sci., 2017

OpinionWalk: An efficient solution to massive trust assessment in online social networks.

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model.

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction.

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

2016

A 1.5-Approximation Algorithm for Two-Sided Scaffold Filling.

Algorithmica, 2016

On the General Chain Pair Simplification Problem.

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Filling a Protein Scaffold with a Reference.

Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016

Finding Disjoint Dense Clubs in an Undirected Graph.

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Genomic Scaffold Filling: A Progress Report.

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs.

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Genomic Scaffold Filling Revisited.

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

A Polynomial Time Solution for Permutation Scaffold Filling.

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Improved parameterized and exact algorithms for cut problems on trees.

Theor. Comput. Sci., 2015

A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations.

Theor. Comput. Sci., 2015

Robust optimization for the hazardous materials transportation network design problem.

J. Comb. Optim., 2015

Complexity analysis and algorithms for the Program Download Problem.

J. Comb. Optim., 2015

Expected computations on color spanning sets.

J. Comb. Optim., 2015

An incremental version of the k-center problem on boundary of a convex polygon.

J. Comb. Optim., 2015

Complexity and Algorithms for the Discrete Fréchet Distance Upper Bound with Imprecise Input.

CoRR, 2015

Isomorphism and similarity for 2-generation pedigrees.

BMC Bioinformatics, 2015

Computing an Optimal Path with the Minimum Number of Distinct Sensors.

Proceedings of the Wireless Algorithms, Systems, and Applications, 2015

On the Chain Pair Simplification Problem.

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow.

Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015

The Discrete and Mixed Minimax 2-Center Problem.

Proceedings of the Combinatorial Optimization and Applications, 2015

2014

Following a curve with the discrete Fréchet distance.

Theor. Comput. Sci., 2014

Combinatorial Optimization and Applications.

Theor. Comput. Sci., 2014

Voronoi diagram with visual restriction.

Theor. Comput. Sci., 2014

On the approximability of the exemplar adjacency number problem for genomes with gene repetitions.

Theor. Comput. Sci., 2014

On Some Proximity Problems of Colored Sets.

J. Comput. Sci. Technol., 2014

A linear kernel for the complementary maximal strip recovery problem.

J. Comput. Syst. Sci., 2014

Radiation hybrid map construction problem parameterized.

J. Comb. Optim., 2014

Weak visibility polygons of NURBS curves inside simple polygons.

J. Computational Applied Mathematics, 2014

A note on visibility-constrained Voronoi diagrams.

Discrete Applied Mathematics, 2014

Intermittent Map Matching with the Discrete Fréchet Distance.

CoRR, 2014

On the Chain Pair Simplification Problem.

CoRR, 2014

A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations.

Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

Algorithms for Cut Problems on Trees.

Proceedings of the Combinatorial Optimization and Applications, 2014

On the Exact Block Cover Problem.

Proceedings of the Algorithmic Aspects in Information and Management, 2014

2013

Preface.

Theor. Comput. Sci., 2013

Streaming with minimum space: An algorithm for covering by two congruent balls.

Theor. Comput. Sci., 2013

Protein Chain Pair Simplification under the Discrete Fréchet Distance.

IEEE/ACM Trans. Comput. Biology Bioinform., 2013

An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies.

IEEE/ACM Trans. Comput. Biology Bioinform., 2013

Largest area convex hull of imprecise data based on axis-aligned squares.

J. Comb. Optim., 2013

On some geometric problems of color-spanning sets.

J. Comb. Optim., 2013

Baseline Bounded half-Plane Voronoi Diagram.

Discrete Math., Alg. and Appl., 2013

Algorithms for Cut Problems on Trees

CoRR, 2013

The Radiation Hybrid Map Construction Problem Is FPT.

Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

Tight Approximation Bounds for Connectivity with a Color-Spanning Set.

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Extending the lifetime of a WSN by partial covers.

Proceedings of IEEE International Conference on Communications, 2013

The Program Download Problem: Complexity and Algorithms.

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies.

Proceedings of the Computing and Combinatorics, 19th International Conference, 2013

Expected Computations on Color Spanning Sets.

Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

A Retrospective on Genomic Preprocessing for Comparative Genomics.

Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012

A (1+ε)-approximation algorithm for sorting by short block-moves.

Theor. Comput. Sci., 2012

Scaffold Filling under the Breakpoint and Related Distances.

IEEE/ACM Trans. Comput. Biology Bioinform., 2012

Minimum common string partition revisited.

J. Comb. Optim., 2012

Exact and approximation algorithms for the complementary maximal strip recovery problem.

J. Comb. Optim., 2012

Comparing Pedigree Graphs.

Journal of Computational Biology, 2012

A Polynomial Time Solution for Protein Chain Pair Simplification under the Discrete Fréchet Distance.

Proceedings of the Bioinformatics Research and Applications - 8th International Symposium, 2012

A Linear Kernel for the Complementary Maximal Strip Recovery Problem.

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

Radiation Hybrid Map Construction Problem Parameterized.

Proceedings of the Combinatorial Optimization and Applications, 2012

Streaming with Minimum Space: An Algorithm for Covering by Two Congruent Balls.

Proceedings of the Combinatorial Optimization and Applications, 2012

Voronoi Diagram with Visual Restriction.

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

Erratum: The Approximability of the Exemplar Breakpoint Distance Problem.

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011

On the red/blue spanning tree problem.

Theor. Comput. Sci., 2011

Continuous-Time Moving Network Voronoi Diagram.

Trans. Computational Science, 2011

Algorithms for sorting unsigned linear genomes by the DCJ operations.

Bioinformatics, 2011

A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Fréchet Distance.

Proceedings of the Computational Science and Its Applications - ICCSA 2011, 2011

Wakeup Scheduling in Roadside Directional Sensor Networks.

Proceedings of the Global Communications Conference, 2011

Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies.

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data.

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem.

Proceedings of the Combinatorial Optimization and Applications, 2011

Minimum Interval Cover and Its Application to Genome Sequencing.

Proceedings of the Combinatorial Optimization and Applications, 2011

On Some Geometric Problems of Color-Spanning Sets.

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

On the Tractability of Maximal Strip Recovery.

Journal of Computational Biology, 2010

Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance.

Int. J. Comput. Geometry Appl., 2010

Weak Kernels.

Electronic Colloquium on Computational Complexity (ECCC), 2010

Algorithms for Comparing Pedigree Graphs

CoRR, 2010

Guarding a Terrain by Two Watchtowers.

Algorithmica, 2010

Scaffold Filling under the Breakpoint Distance.

Proceedings of the Comparative Genomics - International Workshop, 2010

Moving Network Voronoi Diagram.

Proceedings of the Seventh International Symposium on Voronoi Diagrams in Science and Engineering, 2010

Minimum Common String Partition Revisited.

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

Breakpoint Distance and PQ-Trees.

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Fréchet-Distance on Road Networks.

Proceedings of the Computational Geometry, Graphs and Applications, 2010

Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery.

Proceedings of the Algorithmic Aspects in Information and Management, 2010

A Linear Kernel for Co-Path/Cycle Packing.

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

The canadian traveller problem and its competitive analysis.

J. Comb. Optim., 2009

On recovering syntenic blocks from comparative maps.

J. Comb. Optim., 2009

Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems.

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

On the Tractability of Maximal Strip Recovery.

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

On the Red/Blue Spanning Tree Problem.

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Efficient Algorithms for the Closest String and Distinguishing String Selection Problems.

Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

On the Approximability of Some Haplotyping Problems.

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Preface.

J. Comb. Optim., 2008

On the inapproximability of the exemplar conserved interval distance problem of genomes.

J. Comb. Optim., 2008

Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments.

Journal of Computational Biology, 2008

Protein Structure-structure Alignment with Discrete FrÉchet Distance.

J. Bioinformatics and Computational Biology, 2008

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Automatically Approximating 3D Points with Co-Axisal Objects.

Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008

Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance.

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

On Recovering Syntenic Blocks from Comparative Maps.

Proceedings of the Combinatorial Optimization and Applications, 2008

Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments.

Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007

Editorial, special issue on bioinformatics.

J. Comb. Optim., 2007

RNA multiple structural alignment with longest common subsequences.

J. Comb. Optim., 2007

Protein Local Structure Alignment Under the Discrete Fréchet Distance.

Journal of Computational Biology, 2007

On the Complexity of Protein Local Structure Alignment Under the Discrete Fréchet Distance

CoRR, 2007

Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance

CoRR, 2007

Non-breaking Similarity of Genomes with Gene Repetitions.

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Volume Computation Using a Direct Monte Carlo Method.

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Protein Structure-Structure Alignment with Discrete Fr'echet Distance.

Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006

Preface.

Theor. Comput. Sci., 2006

On the edge l

_{infinitf}radius of Saitou and Nei's method for phylogenetic reconstruction.
Theor. Comput. Sci., 2006

On a Minimum Linear Classification Problem.

J. Global Optimization, 2006

A combinatorial theorem on labeling squares with points and its application.

J. Comb. Optim., 2006

A PTAS for a disc covering problem using width-bounded separators.

J. Comb. Optim., 2006

Voronoi Diagram and Delaunay Triangulation: Applications and Challenges in Bioinformatics.

Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes.

Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

The Approximability of the Exemplar Breakpoint Distance Problem.

Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005

Protein Folding on the Hexagonal Lattice in the Hp Model.

J. Bioinformatics and Computational Biology, 2005

A lower bound on the edge l

_{infinitely}radius of Saitou and Nei's method for phylogenetic reconstruction.
Inf. Process. Lett., 2005

Guarding a terrain by two watchtowers.

Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

A PTAS for a Disc Covering Problem Using Width-Bounded Separators.

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

RNA Multiple Structural Alignment with Longest Common Subsequences.

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Preface.

Theor. Comput. Sci., 2004

Approximating 3D Points With Cylindrical Segments.

Int. J. Comput. Geometry Appl., 2004

Guest editor's foreword.

Int. J. Comput. Geometry Appl., 2004

New Bounds on Map Labeling with Circular Labels.

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Cylindrical Approximation of a Neuron from Reconstructed Polyhedron.

Proceedings of the Computational Science and Its Applications, 2004

Approximations for Two Decomposition-Based Geometric Optimization Problems.

Proceedings of the Computational Science and Its Applications, 2004

A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes.

Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003

Polynomial time algorithms for three-label point labeling.

Theor. Comput. Sci., 2003

On a Minimum Linear Classification Problem.

J. Global Optimization, 2003

A simple factor-3 approximation for labeling points with circles.

Inf. Process. Lett., 2003

Some Problems on Factorizations with Constraints in Bipartite Graphs.

Discrete Applied Mathematics, 2003

On Lawson's Oriented Walk in Random Delaunay Triangulations.

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

WebSail: From On-line Learning to Web Search.

Knowl. Inf. Syst., 2002

New Approximation Algorithms for Map Labeling with Sliding Labels.

J. Comb. Optim., 2002

Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm.

Inf. Retr., 2002

On Connected [k, k+1]-Factors in Claw-Free Graphs.

Ars Comb., 2002

A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels.

Proceedings of the Algorithm Theory, 2002

Approximating 3D Points with Cylindrical Segments.

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

FEATURES: Real-time adaptive feature and document learning for web search.

JASIST, 2001

Efficient Approximation Algorithms for Two-Label Point Labeling.

Int. J. Comput. Geometry Appl., 2001

Polynomial Time Algorithms for Three-Label Point Labeling.

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

On the Planar Two-Watchtower Problem.

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Three-dimensional weak visibility: Complexity and applications.

Theor. Comput. Sci., 2000

On Some Polyhedra Covering Problems.

J. Comb. Optim., 2000

Fast Range Searching with Delaunay Triangulations.

GeoInformatica, 2000

Computing the Degree-4 Shortest Network under a Given Topology.

Discrete & Computational Geometry, 2000

WebSail: From On-Line Learning to Web Search.

Proceedings of the WISE 2000, 2000

Some Formal Analysis of Roccio's Similarity-Based Relvance Feedback Algorithm.

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

New Algorithms for Two-Label Point Labeling.

Proceedings of the Algorithms, 2000

On Some Optimization Problems in Obnoxious Facility Location.

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

Computing the Optimal Bridge Between Two Convex Polygons.

Inf. Process. Lett., 1999

Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations.

Comput. Geom., 1999

A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors.

Algorithmica, 1999

Efficient Approximation Algorithms for Multi-label Map Labeling.

Proceedings of the Algorithms and Computation, 10th International Symposium, 1999

A simple probablistic algorithm for approximating two and three-dimensional objects.

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

Unoriented Theta-Maxima in the Plane: Complexity and Algorithms.

SIAM J. Comput., 1998

A Polynomial Time Solution for Labeling a Rectlinear Map.

Inf. Process. Lett., 1998

A Note on Point Location in Delaunay Triangulations of Random Points.

Algorithmica, 1998

On Computing and Drawing Maxmin-Height Covering Triangulation.

Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997

Approximating Convex Polyhedra with Axis-Parallel Boxes.

Int. J. Comput. Geometry Appl., 1997

Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time.

Comput. Geom., 1997

Guarding Polyhedral Terrains.

Comput. Geom., 1997

Feasibility of Design in Stereolithography.

Algorithmica, 1997

Map Labeling and Its Generalizations.

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

A Polynomial Time Solution for Labeling a Rectilinear Map.

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Fast Range Searching with Delaunay Triangulations.

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

Shooter location problems revisited.

Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996

A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors.

Proceedings of IPPS '96, 1996

Fast Randomized Point Location Without Preprocessing in Two- and Three-dimensional Delaunay Triangulations.

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

On the Sectional Area of Convex Polytopes.

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Two-Guarding a Rectilinear Polygon.

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

On the omega(n

^{4/3}) Weak Lower Bounds for Some 3D Geometric Problems.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Three Dimensional Weak Visibility: Complexity and Applications.

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Intersections of random line segments.

Int. J. Comput. Geometry Appl., 1994

Further Computational Geometry in Secondary Memory.

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Intersection Detection and Computation of Manhattan Terrains.

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Feasability of Design in Stereolithography.

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993

Tetrahedralization of Simple and Non-Simple Polyhedra.

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Computing the Shortest Diagonal of a Monotone Polygon in Linear Time.

Inf. Process. Lett., 1992

1991

Counting k-Subsets and Convex k-gons in the Plane.

Inf. Process. Lett., 1991