Recent Publications

 

 

Map Labeling

  1. Zhongping Qin, Alex Wolff, Yinfeng Xu and Binhai Zhu, New Algorithms for two-label point labeling, Proc. 8th European Symp. on Algorithms (ESA'00), pages 368-379, Germany, Sep 5-8, 2000 (Springer-Verlag, LNCS series, 1879).

  2. Rob Duncan, Jianbo Qian and Binhai Zhu, Polynomial time algorithms for three-label point labeling, Proc. 7th International Computing and Combinatorics Conf (COCOON'01), pages 191-200, Guilin, China, Aug 20-23, 2001 (Springer-Verlag, LNCS series, 2108).

  3. Zhongping Qin and Binhai Zhu, A factor-2 approximation for labeling points with maximum sliding labels, Proc. 8th Scandinavian Workshop on Algorithm Theory (SWAT'02), pages 100-109, Finland, July 3-5, 2002 (Springer-Verlag, LNCS series, 2368).

  4. Binhai Zhu and C.K. Poon, Efficient approximation algorithms for two-label point labeling. International Journal of Computational Geometry and Applications, 11(4):455-464, Aug, 2001.

  5. Binhai Zhu and Zhongping Qin, New approximation algorithms for map labeling with sliding labels, Journal of Combinatorial Optimization, 6(1):99-110, March, 2002.

  6. Rob Duncan, Jianbo Qian, Antoine Vigneron and Binhai Zhu, Polynomial time algorithms for three-label point labeling, Theoretical Computer Science, special issue for COCOON'01, 296(1):75-87, March, 2003.

  7. Minghui Jiang, Jianbo Qian, Zhongping Qin, Binhai Zhu and Robert Cimikowski, A simple factor-3 approximation for labeling points with circles, Information Processing Letters, 87(2):101-105, July, 2003.

  8. Minghui Jiang, Sergey Bereg, Zhongping Qin and Binhai Zhu, New bounds on labeling points with circular labels. Proc. 15th International Symp. on Algorithms and Computation (ISAAC'04), pages 606-617, Hong Kong, China, Dec 20-22, 2004 (Springer-Verlag, LNCS series 3341).

  9. Binhai Zhu and Minghui Jiang, A combinatorial theorem for labeling squares with points and its application. Journal of Combinatorial Optimization, 11(4):411-420, June, 2006.

    Intelligent Web Searching

  10. Zhixiang Chen, Xiannong Meng, Binhai Zhu and Richard Fowler, Websail: from on-line learning to web-searching. Proc. 1st International Conf. on Web Information Systems Engineering (WISE'00), pages 206-213, Hong Kong, June, 2000 (IEEE). [Also, Knowledge and Information Systems, special issue for WISE'00, 4(2):219-227, March, 2002]

  11. Zhixiang Chen, Xiannong Meng, Richard Fowler and Binhai Zhu, Features: real-time adaptive feature and document learning for web search. Journal of the American Society for Information Science and Technology, 52(8):655-665, April, 2001 (John Wiley & Sons).

  12. Zhixiang Chen and Binhai Zhu, Some formal analysis of Rocchio's similarity-based relevance feedback algorithm, Proc. 11th International Symp. on Algorithms and Computation (ISAAC'00), pages 108-119, Taipei, Taiwan, Dec 18-20, 2000 (Springer-Verlag, LNCS series, 1969). [Also, Information Retrieval, 5(1):61-86, Jan, 2002.]

    Computational Biology and Bioinformatics

  13. Wenfeng Lai, Adiesha Liyanage, Binhai Zhu and Peng Zou, Beyond the longest letter-duplicated subsequence problem, Proc. CPM'22, paper 7, June, 2022.

  14. Manuel Lafond, Adiesha Liyanage, Binhai Zhu and Peng Zou, The complexity of finding common partitions of genomes with predefined block sizes, Proc. RECOMB-CG'22, pages 105-123, LNCS 13234, May, 2022.

  15. Manuel Lafond, Binhai Zhu and Peng Zou, Computing the tandem duplication distance is NP-hard, SIAM J. Discrete Mathematics, 36(1), Pages 64-91, 2022.

  16. Manuel Lafond and Binhai Zhu, Permutation-constrained common string partitions with applications. Proc. SPIRE'21, Pages 47-60, LNCS 12944, Oct, 2021.

  17. Manuel Lafond, Binhai Zhu and Peng Zou, Genomic problems involving copy number profiles: complexity and algorithms. Proc. CPM'20, paper 22, June, 2020.

  18. Manuel Lafond, Binhai Zhu and Peng Zou, The tandem duplication distance is NP-hard, Proc. STACS'20, paper 15, March, 2020. (We resolved a 16-year old open problem in formal languages and computational biology: for unbounded alphabet \Sigma, using the minimum number of tandem duplications to convert a sequence A to B is in fact NP-hard! In the journal version (accepted by SIAM J. Discrete Mathematics in Sep, 2021), we improved the result by showing that the problem remains NP-hard when the alphabet \Sigma is of size at least 4, e.g., even for the case of \Sigma={a,c,g,t}.)

  19. Haitao Jiang, Jiong Guo, Daming Zhu and Binhai Zhu, A 2-approximation algorithm for the complementary maximal strip recovery problem. Proc. CPM'19, Paper 5, June, 2019.

  20. Haitao Jiang, Letu Qingge, Daming Zhu and Binhai Zhu, A 2-approximation algorithm for the contig-based genomic scaffold filling problem. JBCB'18, 16(6):1850022, Dec, 2018. (This paper revises the 2-approximation in the CPM'16 paper, where some details are missing.)

  21. Haitao Jiang, Lianrong Pu, Letu Qingge, David Sankoff and Binhai Zhu, A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications. COCOON'18, Pages 26-38, LNCS 10976, July, 2018.

  22. Letu Qingge, Killian Smith, Sean Jungst and Binhai Zhu, On approaching the one-sided exemplar adjacency number problem. Proc. ISBRA'18, June, 2018. (Full version in TCBB.)

  23. Haitao Jiang, Chenglin Fan, Boting Yang, Farong Zhong, Daming Zhu and Binhai Zhu, Genomic scaffold filling revisited. Proc. CPM'16, paper 15, June, 2016.

  24. Letu Qingge, Xiaowen Liu, Farong Zhong and Binhai Zhu, Filling a protein scaffold with a reference. IEEE Trans. on NanoBioscience, 16(2), March, 2017 (early version: Proc. ISBRA'16, June, 2016).

  25. Qiang Kou, Binhai Zhu, Si Wu, Charles Ansong, Nikola Tolic, Ljiljana Pasa-Tolic, and Xiaowen Liu, Characterization of proteoforms with unknown post-translational modifications using the MIScore. J. of Proteome Research, 15(8):2422-2432, 2016.

  26. Haitao Jiang, Lusheng Wang, Binhai Zhu and Daming Zhu, A factor-(1.408+$\epsilon$) approximation for sorting unsigned genomes by reciprocal translocations. TCS, 607, special issue for FAW'2014, Dec, 2015.

  27. Nan Liu, Daming Zhu, Haitao Jiang and Binhai Zhu, A 1.5-approximation algorithm for two-sided scaffold filling. Algorithmica, 74(1), Jan, 2016. paper.

  28. Zhixiang Chen, Bin Fu, Randy Goebel, Guohui Lin, Weitian Tong, Jinhui Xu, Boting Yang, Zhiyu Zhao and Binhai Zhu, On the approximability of the exemplar adjacency number problem for genomes with gene repetitions. Theoretical Computer Science, 550:59-65, Sep, 2014. new version (replaces the early CPM'07 paper).

  29. Haitao Jiang, Guohui Lin, Weitian Tong, Daming Zhu and Binhai Zhu, Isomorphism and similarity for 2-generation pedigrees. ISBRA'14, Page 407, LNBI 8492, June, 2014. (Full version in BMC Bioinformatics, special issue for ISBRA'14, 16(Suppl 5):S7, March, 2015.)

  30. Nan Liu, Haitao Jiang, Daming Zhu and Binhai Zhu, An improved approximation algorithm for scaffold filling to maximize the common adjacencies. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10(4):905-913, July/August, 2013. (Conf version presented at COCOON'2013.)

  31. Tim Wylie and Binhai Zhu, Protein chain pair simplification under the discrete Frechet distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10(6):1372-1383, Nov/Dec, 2013.

  32. Haitao Jiang and Binhai Zhu, A linear kernel for the complementary maximal strip recovery problem. CPM'2012, LNCS 7354, Pages 349-359, July, 2012. Revised full version (Journal of Computer and System Sciences, 80(7):1350-1358, Nov, 2014).

  33. Bonnie Kirkpatrick, Yakir Reshef, Hilary Finucane, Haitao Jiang, Binhai Zhu and Richard Karp, Comparing pedigree graphs. J. of Computational Biology, 19(9):998-1014, Sep, 2012.

  34. Liang Ding, Bin Fu and Binhai Zhu, Minimum paired-end interval cover and its application. This paper revises the COCOA'11 paper. May, 2012 Version.

  35. Haitao Jiang, Chunfang Zheng, David Sankoff and Binhai Zhu, Scaffold filling under the breakpoint and related distances. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 9(4):1220-1229, July/Aug, 2012 (this paper combines and revises the most important parts in our RECOMB-CG'10 and CPM'11 papers. Mar, 2012 Version).

  36. Bin Fu, Haitao Jiang, Boting Yang and Binhai Zhu, Exponential and polynomial time algorithms for the minimum common string partition problem. COCOA'11, LNCS 6831, Pages 299-310, 2011.

  37. Liang Ding, Bin Fu and Binhai Zhu, Minimum interval cover and its application to genome sequencing. COCOA'11, LNCS 6831, Pages 287-298, 2011.

  38. Haitao Jiang, Farong Zhong and Binhai Zhu, Filling scaffolds with gene repetitions: maximizing the number of adjacencies. CPM'2011, LNCS 6661, Pages 55-64, 2011.

  39. Haitao Jiang, Binhai Zhu and Daming Zhu, Algorithms for sorting unsigned linear genomes by the DCJ operations. Bioinformatics, 27(3), Pages 311-316, Feb, 2011. Dec 1, 2010 Version.

  40. Haitao Jiang, Chunfang Zheng, David Sankoff and Binhai Zhu, Scaffold filling under the breakpoint distance. Proc. RECOMB-CG'10, pages 83-92, Ottawa, Canada, Oct 2010 (Springer-Verlag, LNBI series 6398). Slightly expanded version.

  41. Haitao Jiang, Binhai Zhu, Daming Zhu and Hong Zhu, Minimum common string partition revisited. Proc. 4th Intl. Frontiers of Algorithmics Workshop (FAW'10), pages 45-52, Wuhan, China, Aug, 2010 (Springer-Verlag, LNCS series 6213). (Revised full version in J. of Combinatorial Optimization, 23(4):519-527, May, 2012.)

  42. Haitao Jiang, Cedric Chauve and Binhai Zhu, Breakpoint distance and PQ-trees (or: Comparing the similarity of PQ-trees under the breakpoint distance). Proc. 21st Annual Combinatorial Pattern Matching Symposium (CPM'10), pages 112-124, New York, NY, June 21-23, 2010 (Springer-Verlag, LNCS series 6129).

  43. Haitao Jiang, Zhong Li, Guohui Lin, Lusheng Wang and Binhai Zhu, Exact and approximation algorithms for the complementary maximal strip recovery problem. Journal of Combinatorial Optimization, 23(4):493-506, 2012. (DOI 10.1007/s10878-010-9366-y, published on-lin in Nov, 2010.) Oct 23, 2010 Version. This paper revises greatly the conf version presented at AAIM'10.

  44. Lusheng Wang and Binhai Zhu, Efficient algorithms for the closest string and distinguishing string selection problems. Proc. 3rd Intl. Frontiers of Algorithmics Workshop (FAW'09), pages 261-270, Hefei, China, June, 2009 (Springer-Verlag, LNCS series 5598).

  45. Lusheng Wang and Binhai Zhu, On the tractability of maximal strip recovery. Proc. 6th Annual Conf. on Theory and Applications of Models of Computation (TAMC'09), pages 400-409, Changsha, China, May, 2009 (Springer-Verlag, LNCS series 5532). J. Computational Biology, 17(7):907-914, 2010. The short algorithm on page 912-913 has some problem, an improved and revised FPT algorithm can be found in AAIM'10 revision, and a 1-page correction appears as 18(1):129, Jan, 2011.

  46. John Abraham, Zhixiang Chen, Richard Fowler, Bin Fu and Binhai Zhu, On the approximability of some haplotyping problems. Proc. 5th International Conf. on Algorithmic Aspects in Information and Management (AAIM'09), pages 3-14, San Francisco, June, 2009 (Springer-Verlag, LNCS series 5564).

  47. Zhixiang Chen, Bin Fu, Minghui Jiang and Binhai Zhu, On recovering syntenic blocks in comparative maps. Proc. 2nd Intl. Conf. on Combinatorial Optimization and Applications (COCOA'08), pages 319-327, St. John's, Canada, Aug, 2008 (Springer-Verlag, LNCS series 5165).

  48. Zhixiang Chen, Bin Fu, Robert Schweller, Boting Yang, Zhiyu Zhao and Binhai Zhu, Linear Time Probablistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. Proc. 6th Asia-Pacific Bioinformatics Conference (APBC'08), pages 333-342, Imperial College Press, Jan, 2008.

    A revised version is in J. of Computational Biology, 15(5):535-546, June, 2008.

  49. Binhai Zhu, Protein local structure alignment under the discrete Frechet distance. Journal of Computational Biology, 14(10), Pages 1343-1351, Dec, 2007.

  50. Zhixiang Chen, Bin Fu, Jinhui Xu, Boting Yang, Zhiyu Zhao and Binhai Zhu, Non-breaking similarity of genomes with gene repetitions. Proc. 18th Annual Combinatorial Pattern Matching Symposium (CPM'07), pages 119-130, London, Ontario, Canada, July 7-9, 2007 (Springer-Verlag, LNCS series 4580).

  51. Minghui Jiang, Ying Xu and Binhai Zhu, Protein structure-structure alignment with the discrete Frechet distance. Proc. 5th Asia-Pacific Bioinformatics Conference (APBC'07), pages 131-141, Imperial College Press, Jan, 2007.

    A revised version is in J. of Bioinformatics and Computational Biology, 6(1):51-64, Feb, 2008.

  52. Zhixiang Chen, Richard Fowler, Bin Fu and Binhai Zhu, Lower bounds on the approximation of the exemplar conserved interval distance problem of genomes. Proc. 12th Intl. Conf. on Computing and Combinatorics (COCOON'06), pages 245-254, Taipei, Taiwan, Aug, 2006 (LNCS series 4112).

    A revised and stronger version is in J. of Combinatorial Optimization, 15(2):201-221, Feb, 2008.

  53. Zhixiang Chen, Bin Fu and Binhai Zhu, The approximability of the exemplar breakpoint distance problem. Proc. 2nd Intl. Conf. on Algorithmic Aspects in Information and Management (AAIM'06), pages 291-302, Hong Kong, China, June, 2006 (LNCS series 4041). Erratum

  54. Sergey Bereg and Binhai Zhu, RNA multiple structural alignment with longest common subsequences. Proc. 11th Intl. Conf. on Computing and Combinatorics (COCOON'05), pages 32-41, Kunmin, China, Aug, 2005.

    Errata and Revised Version (J. of Combinatorial Optimization, 13(2):179-188, Feb, 2007)

  55. Minghui Jiang and Binhai Zhu, Protein folding on the hexagonal lattice in the HP model. J. of Bioinformatics and Computational Biology, 3(1):19-34, 2005.

  56. Guojun Li, Xingqin Qi, Xiaoli Wang and Binhai Zhu, A linear-time algorithm for computing translocation distance between signed genomes. Proc. 15th Annual Combinatorial Pattern Matching Symposium (CPM'04), pages 323-332, Istanbul, Turkey, July 5-7, 2004 (Springer-Verlag, LNCS series 3109).

    Biological and Geometric Modeling

  57. Russell Tempero, Sergey Bereg, Xiangxu Meng, Changhe Tu, Chenglei Yang and Binhai Zhu, Automatically approximating 3D points with co-axisal objects.
    Proc. ICCSA'2008, 8th International Workshop on Computational Geometry and Applications (CGA'08), pages 373-381, Perugia, Italy, July 2008 (IEEE).

  58. Binhai Zhu, Approximating 3D points with cylindrical segments. Proc. 8th International Computing and Combinatorics Conf (COCOON'02), pages 420-429, Singapore, Aug 15-17, 2002 (Springer-Verlag, LNCS series, 2387). (Also, IJCGA, vol 14(3), 2004.)

  59. Minghui Jiang, Brendan Mumey, Zhongping Qin, Andrew Tomascak and Binhai Zhu,
    Approximations for two decomposition-based geometric optimization problems
    Proc. ICCSA'2004, 4th International Workshop on Computational Geometry and Applications (CGA'04), pages 90-98, Perugia, Italy, May 2004 (Springer-Verlag, LNCS series, 3045).

  60. Wenhao Lin, Binhai Zhu, Gwen Jacobs and Gary Orser,
    Cylindrical Approximation of a Neuron from Reconstructed Polyhedron
    Proc. ICCSA'2004, 4th International Workshop on Computational Geometry and Applications (CGA'04), pages 257-266, Perugia, Italy, May 2004 (Springer-Verlag, LNCS series, 3045).

  61. Sergey Bereg, Minghui Jiang and Binhai Zhu, Contour Interpolation with bounded dihedral angles. Proc. 9th ACM Symposium on Solid Modeling and Applications, pages 303-308, Genova, Italy, June 2004.

    Computational Topology (Bottleneck and Wasserstein Distances)

  62. Binhai Zhu, Computational Geometry Column 70: Processing Persistence Diagrams as Purely Geometric Objects, To appear in SIGACT News, March, 2020. (We review the most recent results on processing persistence diagrams and pose several open problems.)

  63. Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama and Binhai Zhu, On computing a center persistence diagram. CoRR abs/1910.01753, Oct, 2019. (The main result is that computing a center persistence diagram under the bottleneck distance is NP-hard to approximate below the factor 2 and a tight 2-approximation is also given.)

  64. Brittany Fasy, Xiaozhou He, Zhihui Liu, Samuel Micka, David Millman and Binhai Zhu, Approximate nearest neighbors in the space of persistence diagrams. CoRR abs/1812.11257, Dec, 2018.

    Discrete Frechet Distance

  65. Chenglin Fan, Omrit Filtser, Matthew Katz, and Binhai Zhu, On the general chain pair simplification problem. Proc. MFCS'16, paper 28, Aug, 2016.

  66. Chenglin Fan, Omrit Filtser, Matthew Katz, Tim Wylie and Binhai Zhu, On the chain pair simplification problem. Proc. WADS'15, Pages 351-362, LNCS 9214, Aug, 2015.

  67. Tim Wylie and Binhai Zhu, Following a curve with the discrete Frechet distance. Theoretical Computer Science, special issue for COCOA'13, 556, Pages 34-44, Oct, 2014.

  68. Tim Wylie and Binhai Zhu, Protein chain pair simplification under the discrete Frechet distance. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10(6):1372-1383, Nov/Dec, 2013. (This paper extends the conference version greatly, Proc. of ISBRA'2012, Pages 287-298, LNBI 7292, May, 2012).

  69. Chenglin Fan, Jun Luo and Binhai Zhu, Frechet distance on road networks. Proc. of CGGA'2010, Pages 61-72, LNCS 7033, Sep, 2011.

  70. Tim Wylie, Jun Luo and Binhai Zhu, A practical solution for aligning and simplifying pairs of protein backbones under the discrete Frechet distance. Proc. of ICCSA'11, Pages 74-83, LNCS 6784, June, 2011.

  71. Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang and Binhai Zhu, Simplifying 3D polygonal chains under the discrete Frechet distance. Proc. 8th Latin American Theoretical Informatics Symposium (LATIN'08), pages 630-641, Rio de Janeiro, Brazil, April 7-11, 2008 (Springer-Verlag, LNCS series 4957).

  72. Sergey Bereg, Kevin Buchin, Maike Buchin, Marina Gavrilova and Binhai Zhu, Voronoi diagram of polygonal chains under the discrete Frechet distance. Proc. 14th Intl. Conf. on Computing and Combinatorics (COCOON'08), pages 352-362, Dalian, China, June, 2008 (Springer-Verlag, LNCS series 5092). (Also, in IJCGA, 20(4):471-484, 2010.)

  73. Binhai Zhu, Protein local structure alignment under the discrete Frechet distance. Journal of Computational Biology, 14(10), Pages 1343-1351, Dec, 2007.

  74. Minghui Jiang, Ying Xu and Binhai Zhu, Protein structure-structure alignment with the discrete Frechet distance. Proc. 5th Asia-Pacific Bioinformatics Conference (APBC'07), pages 131-141, Imperial College Press, Jan, 2007.

    Unit Ball Covering and Packing

  75. Binhai Zhu, On the 1-density of Unit Ball Covering. (Early version as arXiv:0711.2092.)

  76. Chung Keung Poon and Binhai Zhu, Streaming with minimum space: an algorithm for covering by two congruent balls. COCOA'2012, LNCS 7402, Pages 269-280, Aug, 2012. (Full and revised version in TCS, Oct, 2013.)

    Fixed-Parameter Algorithms

  77. Sergey Bereg, Feifei Ma, Wencheng Wang, Jian Zhang and Binhai Zhu, On some matching problems under the color-spanning model. TCS, 2018. (This paper revises and extends the FAW'17 paper, the new result being showing that LCPCS is W[1]-hard.)

  78. Wenjun Li and Binhai Zhu, A 2k-kernelization algorithm for vertex cover based on crown decomposition. TCS, 739, Pages 80-85, Aug, 2018.

  79. Haitao Jiang, Lianrong Pu, Letu Qingge, David Sankoff and Binhai Zhu, A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications. COCOON'18, Pages 26-38, LNCS 10976, July, 2018.

  80. Iyad Kanj, Guohui Lin, Tian Liu, Weitian Tong, Ge Xia, Jinhui Xu, Boting Yang, Fenghui Zhang, Peng Zhang and Binhai Zhu, Improved parameterized and exact algorithms for cut problems on trees. TCS, 607, special issue for COCOA'2014, Dec, 2015.

  81. Haitao Jiang, Guohui Lin, Weitian Tong, Daming Zhu and Binhai Zhu, Isomorphism and similarity for 2-generation pedigrees. ISBRA'14, Page 407, LNBI 8492, June, 2014. (Full version in BMC Bioinformatics, special issue for ISBRA'14, 16(Suppl 5):S7, March, 2015.)

  82. Iyad Kanj, Ge Xia and Binhai Zhu, The radiation hybrid map construction problem is FPT. ISBRA'2013, Pages 5-16, LNBI 7875, May, 2013.

  83. Chihao Zhang, Haitao Jiang and Binhai Zhu, Radiation hybrid map construction problem parameterized. COCOA'2012, LNCS 7402, Pages 127-137, Aug, 2012.

  84. Haitao Jiang and Binhai Zhu, A linear kernel for the complementary maximal strip recovery problem. CPM'2012, LNCS 7354, Pages 349-359, July, 2012. Revised full version (Journal of Computer and System Sciences, 80(7):1350-1358, Nov, 2014).

  85. Haitao Jiang, Binhai Zhu and Daming Zhu, Algorithms for sorting unsigned linear genomes by the DCJ operations. Bioinformatics, 27(3), Pages 311-316, Feb, 2011. Dec 1, 2010 Version.

  86. Haitao Jiang, Chihao Zhang and Binhai Zhu, Weak Kernels. Nov 18th, 2010 version (a slightly earlier Oct 9th version is also posted in ECCC) .

  87. Haitao Jiang, Binhai Zhu, Daming Zhu and Hong Zhu, Minimum common string partition revisited. Proc. 4th Intl. Frontiers of Algorithmics Workshop (FAW'10), pages 45-52, Wuhan, China, Aug, 2010 (Springer-Verlag, LNCS series 6213). (Revised full version in J. of Combinatorial Optimization, 23(4):519-527, May, 2012.)

  88. Zhi-Zhong Chen, Michael Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang and Binhai Zhu, A linear kernel for co-path/cycle packing. Proc. 6th International Conf. on Algorithmic Aspects in Information and Management (AAIM'10), pages 90-102, Weihai, July, 2010 (Springer-Verlag, LNCS series 6124).

  89. Haitao Jiang, Zhong Li, Guohui Lin, Lusheng Wang and Binhai Zhu, Exact and approximation algorithms for the complementary maximal strip recovery problem. Journal of Combinatorial Optimization, 23(4):493-506, 2012. (DOI 10.1007/s10878-010-9366-y, published on-lin in Nov, 2010.) Oct 23, 2010 Version. This paper revises greatly the conf version presented at AAIM'10.

  90. Lusheng Wang and Binhai Zhu, Efficient algorithms for the closest string and distinguishing string selection problems. Proc. 3rd Intl. Frontiers of Algorithmics Workshop (FAW'09), pages 261-270, Hefei, China, June, 2009 (Springer-Verlag, LNCS series 5598).

  91. Lusheng Wang and Binhai Zhu, On the tractability of maximal strip recovery. Proc. 6th Annual Conf. on Theory and Applications of Models of Computation (TAMC'09), pages 400-409, Changsha, China, May, 2009 (Springer-Verlag, LNCS series 5532). J. Computational Biology, 17(7):907-914, 2010. The short algorithm on page 912-913 has some problem, an improved and revised FPT algorithm can be found in AAIM'10 revision, and a 1-page correction appears as 18(1):129, Jan, 2011.

    Sensor/Social/Vehicular Networks

  92. Peng Zou, Letu Qingge, Qing Yang and Binhai Zhu, Trajectory Comparison in a Vehicular Network I: Computing a Consensus Trajectory. WASA'19, Honolulu, HI, USA, June 24-26, 2019.

  93. Letu Qingge, Peng Zou, Lihui Dai, Qing Yang and Binhai Zhu, Trajectory Comparison in a Vehicular Network II: Eliminating the Redundancy. WASA'19, Honolulu, HI, USA, June 24-26, 2019.

  94. Guangchi Liu, Qi Chen, Qing Yang, Binhai Zhu, Honggang Wang and Wei Wang, OpinionWalk: An efficient solution to massive trust assessment in on-line social networks. INFOCOM'17, Atlanta, Georgia, May 1-4, 2017.

  95. Chenglin Fan, Qing Yang and Binhai Zhu, Computing an optimal path with the minimum number of distinct sensors. WASA'15, Qufu, Shandong, China, August 10-12, 2015.

  96. Brendan Mumey, Kelly Spendlove and Binhai Zhu, Extending the lifetime of a WSN by partial covers. IEEE ICC'13, June 9-13, 2013.

  97. Jian Tang, Binhai Zhu, Li Zhang and Roberto Hincapie, Wakeup scheduling in roadside directional sensor networks. IEEE GLOBECOM'2011, Houston, Dec, 2011.

    Computational Geometry with Imprecise Data

  98. Chenglin Fan, Jun Luo, Wencheng Wang, Farong Zhong and Binhai Zhu, On some proximity problems of colored sets. J. of Computer Science and Technology, special issue on Current Advances in the Research of the NSFC Joint Research Fund for Overseas Chinese Scholars and Scholars in Hong Kong and Macao, 29(5):879-886, Sep, 2014. Slightly expanded version over the COCOA'13 paper.

  99. Chenglin Fan, Jun Luo and Binhai Zhu, Tight approximation bounds for connectivity with a color-spanning set. Proc. of ISAAC'13, pp. 590-600, Dec, 2013.

  100. Chao Li, Chenglin Fan, Jun Luo, Farong Zhong and Binhai Zhu, Expected computations on color spanning sets. J. of Combinatorial Optimization, 29(3), 2015. (Early version appears in FAW-AAIM'13, pp. 130-141, LNCS 7924, June, 2013.)

  101. Wenqi Ju, Jun Luo, Binhai Zhu and Ovidiu Daescu, Largest area convex hull of imprecise data based on axis-aligned squares. J. of Combinatorial Optimization, Nov, 2013.

  102. Wenqi Ju, Chenglin Fan, Jun Luo, Binhai Zhu and Ovidiu Daescu, On some geometric problems of color-spanning sets. J. of Combinatorial Optimization, August, 2013.

    Others

  103. Franz Aurenhammer, Bing Su, Yinfeng Xu and Binhai Zhu, A note on visibility-constrained Voronoi diagrams. Discrete Applied Mathematics, 174, 2014.

  104. Bing Su, Yinfeng Xu and Binhai Zhu, Baseline bounded half-plane Voronoi diagram. Discrete Mathematics, Algorithms and Applications, Vol 5, No. 35, September, 2013.

  105. Binhai Zhu, Adaptive point location with almost no preprocessing in Delaunay triangulations, Proc. 9th Intl. Symp. on Voronoi Diagram in Science and Engineering (ISVD'12), pages 84-89, Piscataway, NJ, June, 2012 (IEEE).

  106. Chenglin Fan, Jun Luo, Wencheng Wang and Binhai Zhu, Voronoi diagram with visual restriction. Proc. of FAW-AAIM'2012, pp. 36-46, LNCS 7285, May, 2012. (Full version: TCS, 532:31-39, May, 2014.)

  107. Sergey Bereg, Chenglei Yang and Binhai Zhu, On visibility queries in polygons with holes. Submitted for publication, 2010.

  108. Chenglin Fan, Jianbiao He, Jun Luo and Binhai Zhu, Moving network Voronoi diagram. Proc. 7th Intl. Symp. on Voronoi Diagram in Science and Engineering (ISVD'10), pages 142-150, Quebec City, Canada, June, 2010 (IEEE).

  109. Naoki Katoh, Wencheng Wang, Yinfeng Xu and Binhai Zhu, Parametric search: three new applications. Frontiers of Mathematics in China, special issue on Combinatorial Optimization, 5(1), Pages 65-73, 2010.

  110. Sergey Bereg, Minghui Jiang, Boting Yang and Binhai Zhu, On the red/blue spanning tree problem. Proc. 6th Annual Conf. on Theory and Applications of Models of Computation (TAMC'09), pages 118-127, Changsha, China, May, 2009 (Springer-Verlag, LNCS series 5532). (Revised full version appeared in TCS, May, 2011.)

  111. Sheng Liu, Jian Zhang and Binhai Zhu, Volume computation using a direct Monte Carlo method. Proc. 13th Intl. Conf. on Computing and Combinatorics (COCOON'07), pages 198-209, Banff, Alberta, Canada, July, 2007 (LNCS series 4598).

  112. P. Agarwal, S. Bereg, O. Daescu, H. Kaplan, S. Ntafos and B. Zhu, Guarding a terrain by two watchtowers. Proc. 21st ACM Symp on Computational Geometry (SoCG'05), pages 346-355, Pisa, Italy, June, 2005. (Full version appears in Algorithmica, 58(2):352-390, Oct 2010, with Micha Sharir being an additional author.)

  113. Zhongping Qin, Yinfeng Xu and Binhai Zhu, On some optimization problems in obnoxious facility location. Proc. 6th International Computing and Combinatorics Conf (COCOON'00), pages 320-329, Sydney, Australia, July 26-28, 2000 (Springer-Verlag, LNCS series, 1858).

  114. Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang and Binhai Zhu, On the planar two-watchtower problem, Proc. 7th International Computing and Combinatorics Conf (COCOON'01), pages 121-130, Guilin, China, Aug 20-23, 2001 (Springer-Verlag, LNCS series, 2108).