default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBinhai Zhu
Person information
- affiliation: Montana State University, School of Computing, Bozeman, MT, USA
- affiliation (PhD 1994): McGill University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j105]Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou:
The longest letter-duplicated subsequence and related problems. Acta Informatica 61(3): 315-329 (2024)- [j104]Manuel Lafond
, Binhai Zhu:
Permutation-constrained Common String Partitions with Applications. Algorithmica 86(12): 3684-3718 (2024) - [j103]Tiantian Li, Haitao Jiang, Binhai Zhu, Lusheng Wang, Daming Zhu:
Flanked Block-Interchange Distance on Strings. IEEE ACM Trans. Comput. Biol. Bioinform. 21(2): 301-311 (2024) - [j102]Aizhong Zhou, Haodi Feng, Jiong Guo, Haitao Jiang, Nan Liu, Binhai Zhu, Daming Zhu:
New approximation algorithms for RNA secondary structures prediction problems by local search. Theor. Comput. Sci. 988: 114354 (2024) - [c120]Zhidan Feng, Henning Fernau, Binhai Zhu:
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters. AAIM (1) 2024: 94-108 - [c119]Muzhou Chen, Haitao Jiang, Nan Liu, Lusheng Wang, Binhai Zhu:
On the Existence of Parameterized Algorithms for the Shortest Common Supersequence and Related Problems. AAIM (2) 2024: 209-219 - [c118]Kushal Badal, Letu Qingge, Xiaowen Liu, Binhai Zhu:
Probabilistic and Machine Learning Models for the Protein Scaffold Gap Filling Problem. ISBRA (3) 2024: 28-39 - [i19]Zhidan Feng, Henning Fernau, Binhai Zhu:
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters. CoRR abs/2404.19164 (2024) - 2023
- [c117]Bradley McCoy, Binhai Zhu, Aakash Dutt:
Guarding Precise and Imprecise Polyhedral Terrains with Segments. COCOA (2) 2023: 323-336 - [c116]Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu:
The Longest Subsequence-Repeated Subsequence Problem. COCOA (1) 2023: 446-458 - [c115]Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu:
Red-Black Spanners for Mixed-Charging Vehicular Networks. COCOON (1) 2023: 220-231 - [c114]Xin Tong, Yixiao Yu, Ziyi Fang, Haitao Jiang, Lusheng Wang, Binhai Zhu, Daming Zhu:
Cabbage Can't Always Be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals. COCOON (2) 2023: 279-294 - [c113]Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. FCT 2023: 262-275 - [c112]Huixiu Xu, Xin Tong, Haitao Jiang, Lusheng Wang, Binhai Zhu, Daming Zhu:
On Sorting by Flanked Transpositions. ISBRA 2023: 292-311 - [c111]Jordan Sturtz, Richard Annan, Binhai Zhu, Xiaowen Liu, Letu Qingge:
A Convolutional Denoising Autoencoder for Protein Scaffold Filling. ISBRA 2023: 518-529 - [c110]Lusheng Wang, Binhai Zhu:
Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems. SPIRE 2023: 367-380 - [i18]Xin Tong, Yixiao Yu, Ziyi Fang, Haitao Jiang, Lusheng Wang, Binhai Zhu, Daming Zhu:
Men Can't Always be Transformed into Mice: Decision Algorithms and Complexity for Sorting by Symmetric Reversals. CoRR abs/2302.03797 (2023) - [i17]Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Manuel Lafond, Yuki Tokuni, Binhai Zhu:
The Two-Squirrel Problem and Its Relatives. CoRR abs/2302.05937 (2023) - [i16]Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu:
The Longest Subsequence-Repeated Subsequence Problem. CoRR abs/2304.06862 (2023) - 2022
- [j101]Peng Zou, Letu Qingge, Qing Yang, Binhai Zhu:
Computing a consensus trajectory in a vehicular network. J. Comb. Optim. 44(5): 3575-3594 (2022) - [j100]Manuel Lafond, Binhai Zhu, Peng Zou:
Computing the Tandem Duplication Distance is NP-Hard. SIAM J. Discret. Math. 36(1): 64-91 (2022) - [c109]Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou:
Beyond the Longest Letter-Duplicated Subsequence Problem. CPM 2022: 7:1-7:12 - [c108]Binhai Zhu, Jordan Sturtz, Xiaowen Liu, Letu Qingge, Xiaohong Yuan, Xingang Fu:
Deep Learning Approaches for the Protein Scaffold Filling Problem. ICTAI 2022: 1055-1061 - [c107]Manuel Lafond, Adiesha Liyanage, Binhai Zhu, Peng Zou:
The Complexity of Finding Common Partitions of Genomes with Predefined Block Sizes. RECOMB-CG 2022: 105-123 - 2021
- [j99]Letu Qingge, Peng Zou, Lihui Dai, Qing Yang, Binhai Zhu:
On Comparing the Similarity and Dissimilarity Between Two Distinct Vehicular Trajectories. IEEE Access 9: 34415-34422 (2021) - [j98]Jingjing Ma, Daming Zhu, Haitao Jiang, Binhai Zhu:
On the solution bound of two-sided scaffold filling. Theor. Comput. Sci. 873: 47-63 (2021) - [j97]Xiaozhou He, Wenfeng Lai, Binhai Zhu, Peng Zou:
Dispersing and grouping points on planar segments. Theor. Comput. Sci. 886: 169-177 (2021) - [j96]Peiyan Zhou, Haitao Jiang, Daming Zhu, Binhai Zhu:
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs. Theor. Comput. Sci. 888: 22-30 (2021) - [c106]Manuel Lafond, Binhai Zhu:
Permutation-Constrained Common String Partitions with Applications. SPIRE 2021: 47-60 - [i15]Wenfeng Lai, Adiesha Liyange, Binhai Zhu, Peng Zou:
Beyond the Longest Letter-duplicated Subsequence Problem. CoRR abs/2112.05725 (2021) - [i14]Md Asaduzzaman Noor, Sean Yaw, Binhai Zhu, John W. Sheppard:
Optimal Grain Mixing is NP-Complete. CoRR abs/2112.08501 (2021) - 2020
- [j95]Haitao Jiang, Hong Liu, Cédric Chauve, Binhai Zhu:
Breakpoint distance and PQ-trees. Inf. Comput. 275: 104584 (2020) - [j94]Lixin Liu, Haitao Jiang, Peiqiang Liu, Binhai Zhu, Daming Zhu:
Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear Linear Programming-Rounding. J. Comput. Biol. 27(2): 200-211 (2020) - [j93]Binhai Zhu:
Computational Geometry Column 70: Processing Persistence Diagrams as Purely Geometric Objects. SIGACT News 51(1): 105-117 (2020) - [j92]Letu Qingge, Killian Smith, Sean Jungst, Baihui Wang, Qing Yang, Binhai Zhu:
Approaching the One-Sided Exemplar Adjacency Number Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 17(6): 1946-1954 (2020) - [c105]Manuel Lafond, Binhai Zhu, Peng Zou:
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. CPM 2020: 22:1-22:15 - [c104]Binhai Zhu:
Tandem Duplications, Segmental Duplications and Deletions, and Their Applications. CSR 2020: 79-102 - [c103]Manuel Lafond, Binhai Zhu, Peng Zou:
The Tandem Duplication Distance Is NP-Hard. STACS 2020: 15:1-15:15 - [c102]Xiaozhou He, Wenfeng Lai, Binhai Zhu, Peng Zou:
Dispersing and Grouping Points on Segments in the Plane. TAMC 2020: 340-351 - [i13]Manuel Lafond, Binhai Zhu, Peng Zou:
Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms. CoRR abs/2002.04778 (2020)
2010 – 2019
- 2019
- [j91]Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu:
Efficient algorithms for computing one or two discrete centers hitting a set of line segments. J. Comb. Optim. 37(4): 1408-1423 (2019) - [j90]Yi Xu, Jigen Peng, Yinfeng Xu, Binhai Zhu:
The discrete and mixed minimax 2-center problems. Theor. Comput. Sci. 774: 95-102 (2019) - [j89]Sergey Bereg, Feifei Ma, Wencheng Wang, Jian Zhang, Binhai Zhu:
On some matching problems under the color-spanning model. Theor. Comput. Sci. 786: 26-31 (2019) - [c101]Haitao Jiang, Jiong Guo, Daming Zhu, Binhai Zhu:
A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem. CPM 2019: 5:1-5:13 - [c100]Lixin Liu, Haitao Jiang, Peiqiang Liu, Binhai Zhu, Daming Zhu:
Maximum Stacking Base Pairs: Hardness and Approximation by Nonlinear LP-Rounding. ISBRA 2019: 244-256 - [c99]Letu Qingge, Peng Zou, Lihui Dai, Qing Yang, Binhai Zhu:
Trajectory Comparison in a Vehicular Network II: Eliminating the Redundancy. WASA 2019: 260-271 - [c98]Peng Zou, Letu Qingge, Qing Yang, Binhai Zhu:
Trajectory Comparison in a Vehicular Network I: Computing a Consensus Trajectory. WASA 2019: 533-544 - [i12]Manuel Lafond, Binhai Zhu, Peng Zou:
The Tandem Duplication Distance is NP-hard. CoRR abs/1906.05266 (2019) - [i11]Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. CoRR abs/1910.01753 (2019) - 2018
- [j88]Haitao Jiang, Letu Qingge, Daming Zhu, Binhai Zhu:
A 2-approximation algorithm for the contig-based genomic scaffold filling problem. J. Bioinform. Comput. Biol. 16(6): 1850022:1-1850022:15 (2018) - [j87]Yi Xu, Jigen Peng, Wencheng Wang, Binhai Zhu:
The connected disk covering problem. J. Comb. Optim. 35(2): 538-554 (2018) - [j86]Peng Zou, Hui Li, Wencheng Wang, Chunlin Xin, Binhai Zhu:
Finding disjoint dense clubs in a social network. Theor. Comput. Sci. 734: 15-23 (2018) - [j85]Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
Solving the maximum internal spanning tree problem on interval graphs in polynomial time. Theor. Comput. Sci. 734: 32-37 (2018) - [j84]Wenjun Li, Binhai Zhu:
A 2k-kernelization algorithm for vertex cover based on crown decomposition. Theor. Comput. Sci. 739: 80-85 (2018) - [c97]Letu Qingge, Xiaozhou He, Zhihui Liu, Binhai Zhu:
On the Minimum Copy Number Generation Problem in Cancer Genomics. BCB 2018: 260-269 - [c96]Xiaozhou He, Zhihui Liu, Bing Su, Yinfeng Xu, Feifeng Zheng, Binhai Zhu:
Hitting a Set of Line Segments with One or Two Discrete Centers. CCCG 2018: 85-90 - [c95]Haitao Jiang, Lianrong Pu, Letu Qingge, David Sankoff, Binhai Zhu:
A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications. COCOON 2018: 26-38 - [c94]Letu Qingge, Killian Smith, Sean Jungst, Binhai Zhu:
On Approaching the One-Sided Exemplar Adjacency Number Problem. ISBRA 2018: 275-286 - [e7]Gonzalo Navarro, David Sankoff, Binhai Zhu:
Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China. LIPIcs 105, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-074-3 [contents] - [i10]Sergey Bereg, Feifei Ma, Wencheng Wang, Jian Zhang, Binhai Zhu:
On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. CoRR abs/1805.05448 (2018) - [i9]Brittany Terese Fasy, Xiaozhou He, Zhihui Liu, Samuel Micka, David L. Millman, Binhai Zhu:
Approximate Nearest Neighbors in the Space of Persistence Diagrams. CoRR abs/1812.11257 (2018) - 2017
- [j83]Jie Cheng, Daming Zhu, Binhai Zhu:
Improved algorithms for intermediate dataset storage in a cloud-based dataflow. Theor. Comput. Sci. 657: 48-53 (2017) - [c93]Aizhong Zhou, Haitao Jiang, Jiong Guo, Haodi Feng, Nan Liu, Binhai Zhu:
Improved Approximation Algorithm for the Maximum Base Pair Stackings Problem in RNA Secondary Structures Prediction. COCOON 2017: 575-587 - [c92]Sergey Bereg, Feifei Ma, Wencheng Wang, Jian Zhang, Binhai Zhu:
On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. FAW 2017: 13-21 - [c91]Guangchi Liu, Qi Chen, Qing Yang, Binhai Zhu, Honggang Wang, Wei Wang:
OpinionWalk: An efficient solution to massive trust assessment in online social networks. INFOCOM 2017: 1-9 - 2016
- [j82]Qing Yang, Binhai Zhu, Shaoen Wu:
An Architecture of Cloud-Assisted Information Dissemination in Vehicular Networks. IEEE Access 4: 2764-2770 (2016) - [j81]Nan Liu, Daming Zhu, Haitao Jiang, Binhai Zhu:
A 1.5-Approximation Algorithm for Two-Sided Scaffold Filling. Algorithmica 74(1): 91-116 (2016) - [c90]Nan Liu, Peng Zou, Binhai Zhu:
A Polynomial Time Solution for Permutation Scaffold Filling. COCOA 2016: 782-789 - [c89]Haitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu, Binhai Zhu:
Genomic Scaffold Filling Revisited. CPM 2016: 15:1-15:13 - [c88]Binhai Zhu:
Genomic Scaffold Filling: A Progress Report. FAW 2016: 8-16 - [c87]Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu:
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs. FAW 2016: 92-101 - [c86]Peng Zou, Hui Li, Chunlin Xin, Wencheng Wang, Binhai Zhu:
Finding Disjoint Dense Clubs in an Undirected Graph. FAW 2016: 279-288 - [c85]Letu Qingge, Xiaowen Liu, Farong Zhong, Binhai Zhu:
Filling a Protein Scaffold with a Reference. ISBRA 2016: 175-186 - [c84]Chenglin Fan, Omrit Filtser, Matthew J. Katz, Binhai Zhu:
On the General Chain Pair Simplification Problem. MFCS 2016: 37:1-37:14 - 2015
- [j80]Haitao Jiang, Guohui Lin, Weitian Tong, Daming Zhu, Binhai Zhu:
Isomorphism and similarity for 2-generation pedigrees. BMC Bioinform. 16(S-5): S7 (2015) - [j79]Chao Peng, Jie Zhou, Binhai Zhu, Hong Zhu:
Complexity analysis and algorithms for the Program Download Problem. J. Comb. Optim. 29(1): 216-227 (2015) - [j78]Chao Li, Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu:
Expected computations on color spanning sets. J. Comb. Optim. 29(3): 589-604 (2015) - [j77]Chunlin Xin, Letu Qingge, Jiamin Wang, Binhai Zhu:
Robust optimization for the hazardous materials transportation network design problem. J. Comb. Optim. 30(2): 320-334 (2015) - [j76]Hai Du, Yinfeng Xu, Binhai Zhu:
An incremental version of the k-center problem on boundary of a convex polygon. J. Comb. Optim. 30(4): 1219-1227 (2015) - [j75]Haitao Jiang, Lusheng Wang, Binhai Zhu, Daming Zhu:
A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations. Theor. Comput. Sci. 607: 166-180 (2015) - [j74]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: 455-470 (2015) - [c83]Yi Xu, Jigen Peng, Yinfeng Xu, Binhai Zhu:
The Discrete and Mixed Minimax 2-Center Problem. COCOA 2015: 101-109 - [c82]Jie Cheng, Daming Zhu, Binhai Zhu:
A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow. FAW 2015: 33-44 - [c81]Chenglin Fan, Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu:
On the Chain Pair Simplification Problem. WADS 2015: 351-362 - [c80]Chenglin Fan, Qing Yang, Binhai Zhu:
Computing an Optimal Path with the Minimum Number of Distinct Sensors. WASA 2015: 104-113 - [i8]Chenglin Fan, Binhai Zhu:
Complexity and Algorithms for the Discrete Fréchet Distance Upper Bound with Imprecise Input. CoRR abs/1509.02576 (2015) - 2014
- [j73]Franz Aurenhammer, Bing Su, Yin-Feng Xu, Binhai Zhu:
A note on visibility-constrained Voronoi diagrams. Discret. Appl. Math. 174: 52-56 (2014) - [j72]Chenglei Yang, Weizhen Wang, Yi-Jun Yang, Lin Lu, Zhi-Jie Zhu, Binhai Zhu, Wei Zeng:
Weak visibility polygons of NURBS curves inside simple polygons. J. Comput. Appl. Math. 256: 1-15 (2014) - [j71]Chihao Zhang, Haitao Jiang, Binhai Zhu:
Radiation hybrid map construction problem parameterized. J. Comb. Optim. 27(1): 3-13 (2014) - [j70]Haitao Jiang, Binhai Zhu:
A linear kernel for the complementary maximal strip recovery problem. J. Comput. Syst. Sci. 80(7): 1350-1358 (2014) - [j69]Chenglin Fan, Jun Luo, Wencheng Wang, Farong Zhong, Binhai Zhu:
On Some Proximity Problems of Colored Sets. J. Comput. Sci. Technol. 29(5): 879-886 (2014) - [j68]Chenglin Fan, Jun Luo, Wencheng Wang, Binhai Zhu:
Voronoi diagram with visual restriction. Theor. Comput. Sci. 532: 31-39 (2014) - [j67]Zhixiang Chen, Bin Fu, Randy Goebel, Guohui Lin, Weitian Tong, Jinhui Xu, Boting Yang, Zhiyu Zhao, Binhai Zhu:
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions. Theor. Comput. Sci. 550: 59-65 (2014) - [j66]Peter Widmayer, Yin-Feng Xu, Binhai Zhu:
Combinatorial Optimization and Applications. Theor. Comput. Sci. 556: 1 (2014) - [j65]Tim Wylie, Binhai Zhu:
Following a curve with the discrete Fréchet distance. Theor. Comput. Sci. 556: 34-44 (2014) - [c79]Haitao Jiang, Bing Su, Mingyu Xiao, Yinfeng Xu, Farong Zhong, Binhai Zhu:
On the Exact Block Cover Problem. AAIM 2014: 13-22 - [c78]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Algorithms for Cut Problems on Trees. COCOA 2014: 283-298 - [c77]Haitao Jiang, Lusheng Wang, Binhai Zhu, Daming Zhu:
A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations. FAW 2014: 128-140 - [i7]Tim Wylie, Binhai Zhu:
Intermittent Map Matching with the Discrete Fréchet Distance. CoRR abs/1409.2456 (2014) - [i6]Omrit Filtser, Matthew J. Katz, Tim Wylie, Binhai Zhu:
On the Chain Pair Simplification Problem. CoRR abs/1409.2457 (2014) - 2013
- [j64]Bing Su, Yinfeng Xu, Binhai Zhu:
Baseline Bounded half-Plane Voronoi Diagram. Discret. Math. Algorithms Appl. 5(3) (2013) - [j63]Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu, Ovidiu Daescu:
On some geometric problems of color-spanning sets. J. Comb. Optim. 26(2): 266-283 (2013) - [j62]Wenqi Ju, Jun Luo, Binhai Zhu, Ovidiu Daescu:
Largest area convex hull of imprecise data based on axis-aligned squares. J. Comb. Optim. 26(4): 832-859 (2013) - [j61]Nan Liu, Haitao Jiang, Daming Zhu, Binhai Zhu:
An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies. IEEE ACM Trans. Comput. Biol. Bioinform. 10(4): 905-913 (2013) - [j60]Tim Wylie, Binhai Zhu:
Protein Chain Pair Simplification under the Discrete Fréchet Distance. IEEE ACM Trans. Comput. Biol. Bioinform. 10(6): 1372-1383 (2013) - [j59]Chung Keung Poon, Binhai Zhu:
Streaming with minimum space: An algorithm for covering by two congruent balls. Theor. Comput. Sci. 507: 72-82 (2013) - [j58]Binhai Zhu, Jun Luo:
Preface. Theor. Comput. Sci. 508: 1 (2013) - [c76]Chenglin Fan, Jun Luo, Farong Zhong, Binhai Zhu:
Expected Computations on Color Spanning Sets. FAW-AAIM 2013: 130-141 - [c75]Nan Liu, Haitao Jiang, Daming Zhu, Binhai Zhu:
An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies. COCOON 2013: 397-408 - [c74]Chao Peng, Jie Zhou, Binhai Zhu, Hong Zhu:
The Program Download Problem: Complexity and Algorithms. COCOON 2013: 688-696 - [c73]Brendan Mumey, Kelly Spendlove, Binhai Zhu:
Extending the lifetime of a WSN by partial covers. ICC 2013: 1779-1783 - [c72]Chenglin Fan, Jun Luo, Binhai Zhu:
Tight Approximation Bounds for Connectivity with a Color-Spanning Set. ISAAC 2013: 590-600 - [c71]Iyad A. Kanj, Ge Xia, Binhai Zhu:
The Radiation Hybrid Map Construction Problem Is FPT. ISBRA 2013: 5-16 - [p1]Binhai Zhu:
A Retrospective on Genomic Preprocessing for Comparative Genomics. Models and Algorithms for Genome Evolution 2013: 183-206 - [e6]Michael R. Fellows, Xuehou Tan, Binhai Zhu:
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Third Joint International Conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013. Proceedings. Lecture Notes in Computer Science 7924, Springer 2013, ISBN 978-3-642-38755-5 [contents] - [e5]Peter Widmayer, Yinfeng Xu, Binhai Zhu:
Combinatorial Optimization and Applications - 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings. Lecture Notes in Computer Science 8287, Springer 2013, ISBN 978-3-319-03779-0 [contents] - [i5]Iyad A. Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang, Binhai Zhu:
Algorithms for Cut Problems on Trees. CoRR abs/1304.3653 (2013) - 2012
- [j57]Bonnie Kirkpatrick, Yakir Reshef, Hilary K. Finucane, Haitao Jiang, Binhai Zhu, Richard M. Karp:
Comparing Pedigree Graphs. J. Comput. Biol. 19(9): 998-1014 (2012) - [j56]Haitao Jiang, Zhong Li, Guohui Lin, Lusheng Wang, Binhai Zhu:
Exact and approximation algorithms for the complementary maximal strip recovery problem. J. Comb. Optim. 23(4): 493-506 (2012) - [j55]Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu:
Minimum common string partition revisited. J. Comb. Optim. 23(4): 519-527 (2012) - [j54]Haitao Jiang, Chunfang Zheng, David Sankoff, Binhai Zhu:
Scaffold Filling under the Breakpoint and Related Distances. IEEE ACM Trans. Comput. Biol. Bioinform. 9(4): 1220-1229 (2012) - [j53]Haitao Jiang, Daming Zhu, Binhai Zhu:
A (1+ε)-approximation algorithm for sorting by short block-moves. Theor. Comput. Sci. 439: 1-8 (2012) - [c70]Chenglin Fan, Jun Luo, Wencheng Wang, Binhai Zhu:
Voronoi Diagram with Visual Restriction. FAW-AAIM 2012: 36-46 - [c69]Zhixiang Chen, Bin Fu, Binhai Zhu:
Erratum: The Approximability of the Exemplar Breakpoint Distance Problem. FAW-AAIM 2012: 368 - [c68]Chihao Zhang, Haitao Jiang, Binhai Zhu:
Radiation Hybrid Map Construction Problem Parameterized. COCOA 2012: 127-137 - [c67]Chung Keung Poon, Binhai Zhu:
Streaming with Minimum Space: An Algorithm for Covering by Two Congruent Balls. COCOA 2012: 269-280 - [c66]Haitao Jiang, Binhai Zhu:
A Linear Kernel for the Complementary Maximal Strip Recovery Problem. CPM 2012: 349-359 - [c65]Tim Wylie, Binhai Zhu:
A Polynomial Time Solution for Protein Chain Pair Simplification under the Discrete Fréchet Distance. ISBRA 2012: 287-298 - 2011
- [j52]Haitao Jiang, Binhai Zhu, Daming Zhu:
Algorithms for sorting unsigned linear genomes by the DCJ operations. Bioinform. 27(3): 311-316 (2011) - [j51]Chenglin Fan, Jun Luo, Binhai Zhu:
Continuous-Time Moving Network Voronoi Diagram. Trans. Comput. Sci. 14: 129-150 (2011) - [j50]Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu:
On the red/blue spanning tree problem. Theor. Comput. Sci. 412(23): 2459-2467 (2011) - [c64]Chenglin Fan, Wenqi Ju, Jun Luo, Binhai Zhu:
On Some Geometric Problems of Color-Spanning Sets. FAW-AAIM 2011: 113-124 - [c63]Liang Ding, Bin Fu, Binhai Zhu:
Minimum Interval Cover and Its Application to Genome Sequencing. COCOA 2011: 287-298 - [c62]Bin Fu, Haitao Jiang, Boting Yang, Binhai Zhu:
Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem. COCOA 2011: 299-310 - [c61]Ovidiu Daescu, Wenqi Ju, Jun Luo, Binhai Zhu:
Largest Area Convex Hull of Axis-Aligned Squares Based on Imprecise Data. COCOON 2011: 192-203 - [c60]Haitao Jiang, Farong Zhong, Binhai Zhu:
Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies. CPM 2011: 55-64 - [c59]Jian Tang, Binhai Zhu, Li Zhang, Roberto C. Hincapié:
Wakeup Scheduling in Roadside Directional Sensor Networks. GLOBECOM 2011: 1-6 - [c58]Tim Wylie, Jun Luo, Binhai Zhu:
A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Fréchet Distance. ICCSA (3) 2011: 74-83 - [e4]Mikhail J. Atallah, Xiang-Yang Li, Binhai Zhu:
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management - Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011. Proceedings. Lecture Notes in Computer Science 6681, Springer 2011, ISBN 978-3-642-21203-1 [contents] - 2010
- [j49]Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu:
Guarding a Terrain by Two Watchtowers. Algorithmica 58(2): 352-390 (2010) - [j48]Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu:
Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance. Int. J. Comput. Geom. Appl. 20(4): 471-484 (2010) - [j47]Lusheng Wang, Binhai Zhu:
On the Tractability of Maximal Strip Recovery. J. Comput. Biol. 17(7): 907-914 (2010) - [c57]Zhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu:
A Linear Kernel for Co-Path/Cycle Packing. AAIM 2010: 90-102 - [c56]Binhai Zhu:
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery. AAIM 2010: 325-333 - [c55]Chenglin Fan, Jun Luo, Binhai Zhu:
Fréchet-Distance on Road Networks. CGGA 2010: 61-72 - [c54]Haitao Jiang, Cédric Chauve, Binhai Zhu:
Breakpoint Distance and PQ-Trees. CPM 2010: 112-124 - [c53]Haitao Jiang, Binhai Zhu, Daming Zhu, Hong Zhu:
Minimum Common String Partition Revisited. FAW 2010: 45-52 - [c52]Chenglin Fan, Jianbiao He, Jun Luo, Binhai Zhu:
Moving Network Voronoi Diagram. ISVD 2010: 142-150 - [c51]Haitao Jiang, Chunfang Zheng, David Sankoff, Binhai Zhu:
Scaffold Filling under the Breakpoint Distance. RECOMB-CG 2010: 83-92 - [i4]Bonnie Kirkpatrick, Yakir Reshef, Hilary K. Finucane, Haitao Jiang, Binhai Zhu, Richard M. Karp:
Algorithms for Comparing Pedigree Graphs. CoRR abs/1009.0909 (2010) - [i3]Haitao Jiang, Binhai Zhu:
Weak Kernels. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j46]Yinfeng Xu, Maolin Hu, Bing Su, Binhai Zhu, Zhijun Zhu:
The canadian traveller problem and its competitive analysis. J. Comb. Optim. 18(2): 195-205 (2009) - [j45]Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu:
On recovering syntenic blocks from comparative maps. J. Comb. Optim. 18(3): 307-318 (2009) - [c50]John Abraham, Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu:
On the Approximability of Some Haplotyping Problems. AAIM 2009: 3-14 - [c49]Lusheng Wang, Binhai Zhu:
Efficient Algorithms for the Closest String and Distinguishing String Selection Problems. FAW 2009: 261-270 - [c48]Binhai Zhu:
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems. TAMC 2009: 71-80 - [c47]Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu:
On the Red/Blue Spanning Tree Problem. TAMC 2009: 118-127 - [c46]Lusheng Wang, Binhai Zhu:
On the Tractability of Maximal Strip Recovery. TAMC 2009: 400-409 - 2008
- [j44]Minghui Jiang, Ying Xu, Binhai Zhu:
Protein Structure-structure Alignment with Discrete FrÉchet Distance. J. Bioinform. Comput. Biol. 6(1): 51-64 (2008) - [j43]Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu:
Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. J. Comput. Biol. 15(5): 535-546 (2008) - [j42]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) - [j41]Andreas W. M. Dress, Yinfeng Xu, Binhai Zhu:
Preface. J. Comb. Optim. 16(2): 97-98 (2008) - [c45]Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu:
Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. APBC 2008: 333-342 - [c44]Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu:
On Recovering Syntenic Blocks from Comparative Maps. COCOA 2008: 319-327 - [c43]Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu:
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. COCOON 2008: 352-362 - [c42]Russell Tempero, Sergey Bereg, Xiangxu Meng, Changhe Tu, Chenglei Yang, Binhai Zhu:
Automatically Approximating 3D Points with Co-Axisal Objects. ICCSA Workshops 2008: 373-381 - [c41]Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu:
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641 - 2007
- [j40]Binhai Zhu:
Protein Local Structure Alignment Under the Discrete Fréchet Distance. J. Comput. Biol. 14(10): 1343-1351 (2007) - [j39]Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu:
RNA multiple structural alignment with longest common subsequences. J. Comb. Optim. 13(2): 179-188 (2007) - [j38]Binhai Zhu:
Editorial, special issue on bioinformatics. J. Comb. Optim. 13(3): 205-206 (2007) - [c40]Minghui Jiang, Ying Xu, Binhai Zhu:
Protein Structure-Structure Alignment with Discrete Fr'echet Distance. APBC 2007: 131-141 - [c39]Sheng Liu, Jian Zhang, Binhai Zhu:
Volume Computation Using a Direct Monte Carlo Method. COCOON 2007: 198-209 - [c38]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 - [e3]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. Lecture Notes in Computer Science 4616, Springer 2007, ISBN 978-3-540-73555-7 [contents] - [i2]Sergey Bereg, Marina L. Gavrilova, Binhai Zhu:
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. CoRR abs/0705.2835 (2007) - [i1]Binhai Zhu:
On the Complexity of Protein Local Structure Alignment Under the Discrete Fréchet Distance. CoRR abs/0709.0677 (2007) - 2006
- [j37]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) - [j36]Binhai Zhu, Minghui Jiang:
A combinatorial theorem on labeling squares with points and its application. J. Comb. Optim. 11(4): 411-420 (2006) - [j35]Bing Lu, Hongwei Du, Xiaohua Jia, Yinfeng Xu, Binhai Zhu:
On a Minimum Linear Classification Problem. J. Glob. Optim. 35(1): 103-109 (2006) - [j34]Nimrod Megiddo, Yinfeng Xu, Binhai Zhu:
Preface. Theor. Comput. Sci. 363(3): 247 (2006) - [j33]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) - [c37]Zhixiang Chen, Bin Fu, Binhai Zhu:
The Approximability of the Exemplar Breakpoint Distance Problem. AAIM 2006: 291-302 - [c36]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 - [c35]Binhai Zhu:
Voronoi Diagram and Delaunay Triangulation: Applications and Challenges in Bioinformatics. ISVD 2006: 2-3 - 2005
- [j32]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) - [j31]Minghui Jiang, Binhai Zhu:
Protein Folding on the Hexagonal Lattice in the Hp Model. J. Bioinform. Comput. Biol. 3(1): 19-34 (2005) - [c34]Sergey Bereg, Binhai Zhu:
RNA Multiple Structural Alignment with Longest Common Subsequences. COCOON 2005: 32-41 - [c33]Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu:
A PTAS for a Disc Covering Problem Using Width-Bounded Separators. COCOON 2005: 490-503 - [c32]Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu:
Guarding a terrain by two watchtowers. SCG 2005: 346-355 - [e2]Nimrod Megiddo, Yinfeng Xu, Binhai Zhu:
Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings. Lecture Notes in Computer Science 3521, Springer 2005, ISBN 3-540-26224-5 [contents] - 2004
- [j30]Binhai Zhu:
Guest editor's foreword. Int. J. Comput. Geom. Appl. 14(1-2): 1-2 (2004) - [j29]Binhai Zhu:
Approximating 3D Points With Cylindrical Segments. Int. J. Comput. Geom. Appl. 14(3): 189-201 (2004) - [j28]Tandy J. Warnow, Binhai Zhu:
Preface. Theor. Comput. Sci. 325(3): 345-346 (2004) - [c31]Guojun Li, Xingqin Qi, Xiaoli Wang, Binhai Zhu:
A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes. CPM 2004: 323-332 - [c30]Minghui Jiang, Brendan Mumey, Zhongping Qin, Andrew Tomascak, Binhai Zhu:
Approximations for Two Decomposition-Based Geometric Optimization Problems. ICCSA (3) 2004: 90-98 - [c29]Wenhao Lin, Binhai Zhu, Gwen A. Jacobs, Gary Orser:
Cylindrical Approximation of a Neuron from Reconstructed Polyhedron. ICCSA (3) 2004: 257-266 - [c28]Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu:
New Bounds on Map Labeling with Circular Labels. ISAAC 2004: 606-617 - [c27]Sergey Bereg, Minghui Jiang, Binhai Zhu:
Contour interpolation with bounded dihedral angles. Symposium on Solid Modeling and Applications 2004: 303-308 - 2003
- [j27]Guizhen Liu, Binhai Zhu:
Some Problems on Factorizations with Constraints in Bipartite Graphs. Discret. Appl. Math. 128(2-3): 421-434 (2003) - [j26]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) - [j25]Bing Lu, Yinfeng Xu, Binhai Zhu, Ding-Zhu Du:
On a Minimum Linear Classification Problem. J. Glob. Optim. 26(4): 435-441 (2003) - [j24]Rob Duncan, Jianbo Qian, Antoine Vigneron, Binhai Zhu:
Polynomial time algorithms for three-label point labeling. Theor. Comput. Sci. 296(1): 75-87 (2003) - [c26]Binhai Zhu:
On Lawson's Oriented Walk in Random Delaunay Triangulations. FCT 2003: 222-233 - [e1]Tandy J. Warnow, Binhai Zhu:
Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings. Lecture Notes in Computer Science 2697, Springer 2003, ISBN 3-540-40534-8 [contents] - 2002
- [j23]Guojun Li, Binhai Zhu, Chuanping Chen:
On Connected [k, k+1]-Factors in Claw-Free Graphs. Ars Comb. 62 (2002) - [j22]Zhixiang Chen, Binhai Zhu:
Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm. Inf. Retr. 5(1): 61-86 (2002) - [j21]Binhai Zhu, Zhongping Qin:
New Approximation Algorithms for Map Labeling with Sliding Labels. J. Comb. Optim. 6(1): 99-110 (2002) - [j20]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) - [c25]Binhai Zhu:
Approximating 3D Points with Cylindrical Segments. COCOON 2002: 420-429 - [c24]Zhongping Qin, Binhai Zhu:
A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels. SWAT 2002: 100-109 - 2001
- [j19]Binhai Zhu, Chung Keung Poon:
Efficient Approximation Algorithms for Two-Label Point Labeling. Int. J. Comput. Geom. Appl. 11(4): 455-464 (2001) - [j18]Zhixiang Chen, Xiannong Meng, Richard H. Fowler, Binhai Zhu:
FEATURES: Real-time adaptive feature and document learning for web search. J. Assoc. Inf. Sci. Technol. 52(8): 655-665 (2001) - [c23]Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu:
On the Planar Two-Watchtower Problem. COCOON 2001: 121-130 - [c22]Rob Duncan, Jianbo Qian, Binhai Zhu:
Polynomial Time Algorithms for Three-Label Point Labeling. COCOON 2001: 191-200 - 2000
- [j17]Yin-Feng Xu, Jichang Ye, Binhai Zhu:
Computing the Degree-4 Shortest Network under a Given Topology. Discret. Comput. Geom. 23(3): 437-448 (2000) - [j16]Binhai Zhu:
Fast Range Searching with Delaunay Triangulations. GeoInformatica 4(3): 317-334 (2000) - [j15]Cao An Wang, Bo-Ting Yang, Binhai Zhu:
On Some Polyhedra Covering Problems. J. Comb. Optim. 4(4): 437-447 (2000) - [j14]Cao An Wang, Binhai Zhu:
Three-dimensional weak visibility: Complexity and applications. Theor. Comput. Sci. 234(1-2): 219-232 (2000) - [c21]Zhongping Qin, Yin-Feng Xu, Binhai Zhu:
On Some Optimization Problems in Obnoxious Facility Location. COCOON 2000: 320-329 - [c20]Zhongping Qin, Alexander Wolff, Yin-Feng Xu, Binhai Zhu:
New Algorithms for Two-Label Point Labeling. ESA 2000: 368-379 - [c19]Zhixiang Chen, Binhai Zhu:
Some Formal Analysis of Roccio's Similarity-Based Relvance Feedback Algorithm. ISAAC 2000: 108-119 - [c18]Zhixiang Chen, Xiannong Meng, Binhai Zhu, Richard H. Fowler:
WebSail: From On-Line Learning to Web Search. WISE 2000: 206-213
1990 – 1999
- 1999
- [j13]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) - [j12]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) - [j11]Leizhen Cai, Yin-Feng Xu, Binhai Zhu:
Computing the Optimal Bridge Between Two Convex Polygons. Inf. Process. Lett. 69(3): 127-130 (1999) - [c17]Binhai Zhu:
A simple probablistic algorithm for approximating two and three-dimensional objects. CCCG 1999 - [c16]Binhai Zhu, Chung Keung Poon:
Efficient Approximation Algorithms for Multi-label Map Labeling. ISAAC 1999: 143-152 - 1998
- [j10]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) - [j9]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) - [j8]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) - [c15]Binhai Zhu, Xiaotie Deng:
On Computing and Drawing Maxmin-Height Covering Triangulation. GD 1998: 464-466 - 1997
- [j7]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) - [j6]Prosenjit Bose, Thomas C. Shermer, Godfried T. Toussaint, Binhai Zhu:
Guarding Polyhedral Terrains. Comput. Geom. 7: 173-185 (1997) - [j5]Binhai Zhu:
Computing the Shortest Watchtower of a Polyhedral Terrain in O(n Log N) Time. Comput. Geom. 8: 181-193 (1997) - [j4]Binhai Zhu:
Approximating Convex Polyhedra with Axis-Parallel Boxes. Int. J. Comput. Geom. Appl. 7(3): 253-267 (1997) - [c14]Cao An Wang, Binhai Zhu:
Shooter location problems revisited. CCCG 1997 - [c13]Binhai Zhu:
Fast Range Searching with Delaunay Triangulations. COCOON 1997: 52-61 - [c12]Chung Keung Poon, Binhai Zhu, Francis Y. L. Chin:
A Polynomial Time Solution for Labeling a Rectilinear Map. SCG 1997: 451-453 - [c11]Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M. E. Moret, Binhai Zhu:
Map Labeling and Its Generalizations. SODA 1997: 148-157 - 1996
- [c10]Binhai Zhu:
On the omega(n4/3) Weak Lower Bounds for Some 3D Geometric Problems. CCCG 1996: 270-275 - [c9]Xuehou Tan, Binhai Zhu:
Two-Guarding a Rectilinear Polygon. COCOON 1996: 391-400 - [c8]Ernst P. Mücke, Isaac Saias, Binhai Zhu:
Fast Randomized Point Location Without Preprocessing in Two- and Three-dimensional Delaunay Triangulations. SCG 1996: 274-283 - [c7]David Avis, Prosenjit Bose, Godfried T. Toussaint, Thomas C. Shermer, Binhai Zhu, Jack Snoeyink:
On the Sectional Area of Convex Polytopes. SCG 1996: C-11-C-12 - [c6]Xiaotie Deng, Binhai Zhu:
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors. IPPS 1996: 192-198 - 1995
- [c5]Cao An Wang, Binhai Zhu:
Three Dimensional Weak Visibility: Complexity and Applications. COCOON 1995: 51-60 - 1994
- [j3]Luc Devroye, Binhai Zhu:
Intersections of random line segments. Int. J. Comput. Geom. Appl. 4(3): 261-274 (1994) - [c4]Binhai Zhu:
Intersection Detection and Computation of Manhattan Terrains. CCCG 1994: 256-262 - [c3]Binhai Zhu:
Further Computational Geometry in Secondary Memory. ISAAC 1994: 514-522 - 1993
- [c2]Godfried T. Toussaint, Clark Verbrugge, Cao An Wang, Binhai Zhu:
Tetrahedralization of Simple and Non-Simple Polyhedra. CCCG 1993: 24-29 - [c1]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
- [j2]Binhai Zhu:
Computing the Shortest Diagonal of a Monotone Polygon in Linear Time. Inf. Process. Lett. 42(6): 303-307 (1992) - 1991
- [j1]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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-09 14:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
