| 2008 |
|---|
| 82 | EE | Sergey Bereg,
Minghui Jiang,
Wencheng Wang,
Boting Yang,
Binhai Zhu:
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.
LATIN 2008: 630-641 |
| 81 | EE | Zhixiang Chen,
Richard H. Fowler,
Bin Fu,
Binhai Zhu:
On the inapproximability of the exemplar conserved interval distance problem of genomes.
J. Comb. Optim. 15(2): 201-221 (2008) |
| 2007 |
|---|
| 80 | | Andreas W. M. Dress,
Yinfeng Xu,
Binhai Zhu:
Combinatorial Optimization and Applications, First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings
Springer 2007 |
| 79 | EE | Minghui Jiang,
Ying Xu,
Binhai Zhu:
Protein Structure-Structure Alignment with Discrete Fr'echet Distance.
APBC 2007: 131-141 |
| 78 | EE | Sheng Liu,
Jian Zhang,
Binhai Zhu:
Volume Computation Using a Direct Monte Carlo Method.
COCOON 2007: 198-209 |
| 77 | EE | Zhixiang Chen,
Bin Fu,
Jinhui Xu,
Bo-Ting Yang,
Zhiyu Zhao,
Binhai Zhu:
Non-breaking Similarity of Genomes with Gene Repetitions.
CPM 2007: 119-130 |
| 76 | EE | Sergey Bereg,
Marina L. Gavrilova,
Binhai Zhu:
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
CoRR abs/0705.2835: (2007) |
| 75 | EE | Binhai Zhu:
On the Complexity of Protein Local Structure Alignment Under the Discrete Fréchet Distance
CoRR abs/0709.0677: (2007) |
| 74 | EE | Sergey Bereg,
Marcin Kubica,
Tomasz Walen,
Binhai Zhu:
RNA multiple structural alignment with longest common subsequences.
J. Comb. Optim. 13(2): 179-188 (2007) |
| 73 | EE | Binhai Zhu:
Editorial, special issue on bioinformatics.
J. Comb. Optim. 13(3): 205-206 (2007) |
| 2006 |
|---|
| 72 | EE | Zhixiang Chen,
Bin Fu,
Binhai Zhu:
The Approximability of the Exemplar Breakpoint Distance Problem.
AAIM 2006: 291-302 |
| 71 | EE | Zhixiang Chen,
Richard H. Fowler,
Bin Fu,
Binhai Zhu:
Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes.
COCOON 2006: 245-254 |
| 70 | EE | Zhixiang Chen,
Bin Fu,
Yong Tang,
Binhai Zhu:
A PTAS for a disc covering problem using width-bounded separators.
J. Comb. Optim. 11(2): 203-217 (2006) |
| 69 | EE | Binhai Zhu,
Minghui Jiang:
A combinatorial theorem on labeling squares with points and its application.
J. Comb. Optim. 11(4): 411-420 (2006) |
| 68 | EE | Nimrod Megiddo,
Yinfeng Xu,
Binhai Zhu:
Preface.
Theor. Comput. Sci. 363(3): 247 (2006) |
| 67 | EE | Wenqiang Dai,
Yinfeng Xu,
Binhai Zhu:
On the edge linfinitf radius of Saitou and Nei's method for phylogenetic reconstruction.
Theor. Comput. Sci. 369(1-3): 448-455 (2006) |
| 2005 |
|---|
| 66 | | Nimrod Megiddo,
Yinfeng Xu,
Binhai Zhu:
Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings
Springer 2005 |
| 65 | EE | Sergey Bereg,
Binhai Zhu:
RNA Multiple Structural Alignment with Longest Common Subsequences.
COCOON 2005: 32-41 |
| 64 | EE | Zhixiang Chen,
Bin Fu,
Yong Tang,
Binhai Zhu:
A PTAS for a Disc Covering Problem Using Width-Bounded Separators.
COCOON 2005: 490-503 |
| 63 | EE | Pankaj K. Agarwal,
Sergey Bereg,
Ovidiu Daescu,
Haim Kaplan,
Simeon C. Ntafos,
Binhai Zhu:
Guarding a terrain by two watchtowers.
Symposium on Computational Geometry 2005: 346-355 |
| 62 | EE | Yinfeng Xu,
Wenqiang Dai,
Binhai Zhu:
A lower bound on the edge linfinitely radius of Saitou and Nei's method for phylogenetic reconstruction.
Inf. Process. Lett. 94(5): 225-230 (2005) |
| 61 | EE | Minghui Jiang,
Binhai Zhu:
Protein Folding on the Hexagonal Lattice in the Hp Model.
J. Bioinformatics and Computational Biology 3(1): 19-34 (2005) |
| 2004 |
|---|
| 60 | EE | Guojun Li,
Xingqin Qi,
Xiaoli Wang,
Binhai Zhu:
A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes.
CPM 2004: 323-332 |
| 59 | EE | Wenhao Lin,
Binhai Zhu,
Gwen Jacobs,
Gary Orser:
Cylindrical Approximation of a Neuron from Reconstructed Polyhedron.
ICCSA (3) 2004: 257-266 |
| 58 | EE | Minghui Jiang,
Brendan Mumey,
Zhongping Qin,
Andrew Tomascak,
Binhai Zhu:
Approximations for Two Decomposition-Based Geometric Optimization Problems.
ICCSA (3) 2004: 90-98 |
| 57 | EE | Minghui Jiang,
Sergey Bereg,
Zhongping Qin,
Binhai Zhu:
New Bounds on Map Labeling with Circular Labels.
ISAAC 2004: 606-617 |
| 56 | EE | Binhai Zhu:
Guest editor's foreword.
Int. J. Comput. Geometry Appl. 14(1-2): 1-2 (2004) |
| 55 | EE | Binhai Zhu:
Approximating 3D Points With Cylindrical Segments.
Int. J. Comput. Geometry Appl. 14(3): 189-201 (2004) |
| 54 | EE | Tandy Warnow,
Binhai Zhu:
Preface.
Theor. Comput. Sci. 325(3): 345-346 (2004) |
| 2003 |
|---|
| 53 | | Tandy Warnow,
Binhai Zhu:
Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings
Springer 2003 |
| 52 | EE | Binhai Zhu:
On Lawson's Oriented Walk in Random Delaunay Triangulations.
FCT 2003: 222-233 |
| 51 | EE | Guizhen Liu,
Binhai Zhu:
Some Problems on Factorizations with Constraints in Bipartite Graphs.
Discrete Applied Mathematics 128(2-3): 421-434 (2003) |
| 50 | EE | Minghui Jiang,
Jianbo Qian,
Zhongping Qin,
Binhai Zhu,
Robert J. Cimikowski:
A simple factor-3 approximation for labeling points with circles.
Inf. Process. Lett. 87(2): 101-105 (2003) |
| 49 | EE | Rob Duncan,
Jianbo Qian,
Antoine Vigneron,
Binhai Zhu:
Polynomial time algorithms for three-label point labeling.
Theor. Comput. Sci. 296(1): 75-87 (2003) |
| 2002 |
|---|
| 48 | EE | Binhai Zhu:
Approximating 3D Points with Cylindrical Segments.
COCOON 2002: 420-429 |
| 47 | EE | Zhongping Qin,
Binhai Zhu:
A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels.
SWAT 2002: 100-109 |
| 46 | | Guojun Li,
Binhai Zhu,
Chuanping Chen:
On Connected [k, k+1]-Factors in Claw-Free Graphs.
Ars Comb. 62: (2002) |
| 45 | | Zhixiang Chen,
Binhai Zhu:
Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm.
Inf. Retr. 5(1): 61-86 (2002) |
| 44 | | Binhai Zhu,
Zhongping Qin:
New Approximation Algorithms for Map Labeling with Sliding Labels.
J. Comb. Optim. 6(1): 99-110 (2002) |
| 43 | EE | Zhixiang Chen,
Xiannong Meng,
Binhai Zhu,
Richard H. Fowler:
WebSail: From On-line Learning to Web Search.
Knowl. Inf. Syst. 4(2): 219-227 (2002) |
| 2001 |
|---|
| 42 | EE | Sergei Bespamyatnikh,
Zhixiang Chen,
Kanliang Wang,
Binhai Zhu:
On the Planar Two-Watchtower Problem.
COCOON 2001: 121-130 |
| 41 | EE | Rob Duncan,
Jianbo Qian,
Binhai Zhu:
Polynomial Time Algorithms for Three-Label Point Labeling.
COCOON 2001: 191-200 |
| 40 | | Binhai Zhu,
Chung Keung Poon:
Efficient Approximation Algorithms for Two-Label Point Labeling.
Int. J. Comput. Geometry Appl. 11(4): 455-464 (2001) |
| 39 | | Zhixiang Chen,
Xiannong Meng,
Richard H. Fowler,
Binhai Zhu:
FEATURES: Real-time adaptive feature and document learning for web search.
JASIST 52(8): 655-665 (2001) |
| 2000 |
|---|
| 38 | EE | Zhongping Qin,
Yin-Feng Xu,
Binhai Zhu:
On Some Optimization Problems in Obnoxious Facility Location.
COCOON 2000: 320-329 |
| 37 | | Zhongping Qin,
Alexander Wolff,
Yin-Feng Xu,
Binhai Zhu:
New Algorithms for Two-Label Point Labeling.
ESA 2000: 368-379 |
| 36 | EE | Zhixiang Chen,
Binhai Zhu:
Some Formal Analysis of Roccio's Similarity-Based Relvance Feedback Algorithm.
ISAAC 2000: 108-119 |
| 35 | | Zhixiang Chen,
Xiannong Meng,
Binhai Zhu,
Richard H. Fowler:
WebSail: From On-Line Learning to Web Search.
WISE 2000: 206-213 |
| 34 | EE | Yin-Feng Xu,
Jichang Ye,
Binhai Zhu:
Computing the Degree-4 Shortest Network under a Given Topology.
Discrete & Computational Geometry 23(3): 437-448 (2000) |
| 33 | | Binhai Zhu:
Fast Range Searching with Delaunay Triangulations.
GeoInformatica 4(3): 317-334 (2000) |
| 32 | | Cao An Wang,
Bo-Ting Yang,
Binhai Zhu:
On Some Polyhedra Covering Problems.
J. Comb. Optim. 4(4): 437-447 (2000) |
| 31 | EE | Cao An Wang,
Binhai Zhu:
Three-dimensional weak visibility: Complexity and applications.
Theor. Comput. Sci. 234(1-2): 219-232 (2000) |
| 1999 |
|---|
| 30 | EE | Binhai Zhu:
A simple probablistic algorithm for approximating two and three-dimensional objects.
CCCG 1999 |
| 29 | EE | Binhai Zhu,
Chung Keung Poon:
Efficient Approximation Algorithms for Multi-label Map Labeling.
ISAAC 1999: 143-152 |
| 28 | EE | Xiaotie Deng,
Binhai Zhu:
A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors.
Algorithmica 24(3-4): 270-286 (1999) |
| 27 | | Ernst P. Mücke,
Isaac Saias,
Binhai Zhu:
Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations.
Comput. Geom. 12(1-2): 63-83 (1999) |
| 26 | EE | Leizhen Cai,
Yin-Feng Xu,
Binhai Zhu:
Computing the Optimal Bridge Between Two Convex Polygons.
Inf. Process. Lett. 69(3): 127-130 (1999) |
| 1998 |
|---|
| 25 | EE | Binhai Zhu,
Xiaotie Deng:
On Computing and Drawing Maxmin-Height Covering Triangulation.
Graph Drawing 1998: 464-466 |
| 24 | EE | Luc Devroye,
Ernst P. Mücke,
Binhai Zhu:
A Note on Point Location in Delaunay Triangulations of Random Points.
Algorithmica 22(4): 477-482 (1998) |
| 23 | EE | Chung Keung Poon,
Binhai Zhu,
Francis Y. L. Chin:
A Polynomial Time Solution for Labeling a Rectlinear Map.
Inf. Process. Lett. 65(4): 201-207 (1998) |
| 22 | | David Avis,
Bryan Beresford-Smith,
Luc Devroye,
Hossam A. ElGindy,
Eric Guévremont,
Ferran Hurtado,
Binhai Zhu:
Unoriented Theta-Maxima in the Plane: Complexity and Algorithms.
SIAM J. Comput. 28(1): 278-296 (1998) |
| 1997 |
|---|
| 21 | | Cao An Wang,
Binhai Zhu:
Shooter location problems revisited.
CCCG 1997 |
| 20 | | Binhai Zhu:
Fast Range Searching with Delaunay Triangulations.
COCOON 1997: 52-61 |
| 19 | | Srinivas Doddi,
Madhav V. Marathe,
Andy Mirzaian,
Bernard M. E. Moret,
Binhai Zhu:
Map Labeling and Its Generalizations.
SODA 1997: 148-157 |
| 18 | EE | Chung Keung Poon,
Binhai Zhu,
Franis Chin:
A Polynomial Time Solution for Labeling a Rectilinear Map.
Symposium on Computational Geometry 1997: 451-453 |
| 17 | | Boudewijn Asberg,
Gregoria Blanco,
Prosenjit Bose,
Jesus Garcia-Lopez,
Mark H. Overmars,
Godfried T. Toussaint,
Gordon T. Wilfong,
Binhai Zhu:
Feasibility of Design in Stereolithography.
Algorithmica 19(1/2): 61-83 (1997) |
| 16 | | Prosenjit Bose,
Thomas C. Shermer,
Godfried T. Toussaint,
Binhai Zhu:
Guarding Polyhedral Terrains.
Comput. Geom. 7: 173-185 (1997) |
| 15 | | Binhai Zhu:
Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time.
Comput. Geom. 8: 181-193 (1997) |
| 14 | | Binhai Zhu:
Approximating Convex Polyhedra with Axis-Parallel Boxes.
Int. J. Comput. Geometry Appl. 7(3): 253-267 (1997) |
| 1996 |
|---|
| 13 | | Binhai Zhu:
On the omega(n4/3) Weak Lower Bounds for Some 3D Geometric Problems.
CCCG 1996: 270-275 |
| 12 | | Xuehou Tan,
Binhai Zhu:
Two-Guarding a Rectilinear Polygon.
COCOON 1996: 391-400 |
| 11 | EE | Xiaotie Deng,
Binhai Zhu:
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors.
IPPS 1996: 192-198 |
| 10 | EE | Ernst P. Mücke,
Isaac Saias,
Binhai Zhu:
Fast Randomized Point Location Without Preprocessing in Two- and Three-dimensional Delaunay Triangulations.
Symposium on Computational Geometry 1996: 274-283 |
| 9 | EE | David Avis,
Prosenjit Bose,
Godfried T. Toussaint,
Thomas C. Shermer,
Binhai Zhu,
Jack Snoeyink:
On the Sectional Area of Convex Polytopes.
Symposium on Computational Geometry 1996: C-11-C-12 |
| 1995 |
|---|
| 8 | | Cao An Wang,
Binhai Zhu:
Three Dimensional Weak Visibility: Complexity and Applications.
COCOON 1995: 51-60 |
| 1994 |
|---|
| 7 | | Binhai Zhu:
Intersection Detection and Computation of Manhattan Terrains.
CCCG 1994: 256-262 |
| 6 | | Binhai Zhu:
Further Computational Geometry in Secondary Memory.
ISAAC 1994: 514-522 |
| 5 | | Luc Devroye,
Binhai Zhu:
Intersections of random line segments.
Int. J. Comput. Geometry Appl. 4(3): 261-274 (1994) |
| 1993 |
|---|
| 4 | | Godfried T. Toussaint,
Clark Verbrugge,
Cao An Wang,
Binhai Zhu:
Tetrahedralization of Simple and Non-Simple Polyhedra.
CCCG 1993: 24-29 |
| 3 | | Boudewijn Asberg,
Gregoria Blanco,
Prosenjit Bose,
Jesus Garcia-Lopez,
Mark H. Overmars,
Godfried T. Toussaint,
Gordon T. Wilfong,
Binhai Zhu:
Feasability of Design in Stereolithography.
FSTTCS 1993: 228-237 |
| 1992 |
|---|
| 2 | | Binhai Zhu:
Computing the Shortest Diagonal of a Monotone Polygon in Linear Time.
Inf. Process. Lett. 42(6): 303-307 (1992) |
| 1991 |
|---|
| 1 | | Günter Rote,
Gerhard J. Woeginger,
Binhai Zhu,
Zhengyan Wang:
Counting k-Subsets and Convex k-gons in the Plane.
Inf. Process. Lett. 38(3): 149-151 (1991) |
