Zhi-Zhong Chen's Publications

    International Journal Papers
  1. Zhi-Zhong Chen, Y. Harada, Y. Nakamura, and L. Wang. Faster Exact Computation of rSPR Distance via Better Approximation. IEEE/ACM Transactions on Computational Biology and Bioinformatics, to appear.
  2. S. Yuasa, Zhi-Zhong Chen, B. Ma, and L. Wang. Designing and Implementing Algorithms for the Closest String Problem. Theoretical Computer Science (special issue on FAW 2016, invited submission), to appear.
  3. M. Etemadi1, M. Bagherian1, Zhi-Zhong Chen, and L. Wang. Better ILP Models for Haplotype Assembly. BMC Bioinformatics, Vol. 19-S(1), pp. 11-21, 2018.
  4. Zhi-Zhong Chen, Y. Harada, and L. Wang. An Approximation Algorithm for Maximum Internal Spanning Tree. Journal of Combinatorial Optimization, Vol. 35, No. 3, pp. 955-979, 2018.
  5. Zhi-Zhong Chen, Y. Harada, E. Machida, F. Guo, and L. Wang. Approximation Algorithms for the Scaffolding Problem and Its Generalizations. Theoretical Computer Science (special issue on FAW 2016, invited submission), Vol. 734, pp. 131-141, 2018.
  6. Zhi-Zhong Chen, Q. Feng, C. Shen, J. Wang, and L. Wang. Algorithms for Pedigree Comparison. IEEE/ACM Transactions on Computational Biology and Bioinformatics , Vol. 15, No. 2, pp. 422-431, 2018.
  7. Zhi-Zhong Chen, F. Deng, C. Shen, Y. Wang, and L. Wang. Better ILP-Based Approaches to Haplotype Assembly. Journal of Computational Biology, Vol. 23, No. 7, pp. 537--552, 2016.
  8. Zhi-Zhong Chen, B. Ma, and L. Wang. Randomized Fixed-Parameter Algorithms for the Closest String Problem. Algorithmica , Vol. 74, No. 1, pp. 466--484, 2016.
  9. Zhi-Zhong Chen, Y. Fan, and L. Wang. Faster Exact Computation of rSPR Distance. Journal of Combinatorial Optimization (special issue on AAIM 2013, invited submission), Vol. 29, No. 3, pp. 605--635, 2015.
  10. Zhi-Zhong Chen, Y. Fan, and L. Wang. Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings. Theoretical Computer Science (special issue on COCOA 2013, invited submission), Vol. 556, pp. 85--93, 2014.
  11. Zhi-Zhong Chen, W. Ma, and L. Wang. The Parameterized Complexity of the Shared Center Problem. Algorithmica, Vol. 69, No. 2, pp. 269--293, 2014.
  12. Zhi-Zhong Chen, F. Deng, and L. Wang. Exact Algorithms for Haplotype Assembly from Whole-Genome Sequence Data. Bioinformatics, Vol. 29, No. 16, pp. 1938--1945, 2013.
  13. Zhi-Zhong Chen and L. Wang. An Ultrafast Tool for Minimum Reticulate Networks. Journal of Computational Biology, 20(1): 38--41, 2013.
  14. Zhi-Zhong Chen, L. Wang, and S. Yamanaka. A Fast Tool for Minimum Hybridization Networks. BMC Bioinformatics, 13:155, 2012.
  15. Zhi-Zhong Chen, F. Deng, and L. Wang. Simultaneous Identification of Duplications, Losses, and Lateral Gene Transfers. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 9, No. 5, pp. 1515--1528, 2012.
  16. Zhi-Zhong Chen and L. Wang. Algorithms for Reticulate Networks of Multiple Phylogenetic Trees. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 9, No. 2, pp. 372--384, 2012.
  17. W. Ma, Y. Yang, Zhi-Zhong Chen, and L. Wang. Mutation Region Detection for Closely Related Individuals without a Known Pedigree. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 9, No. 2, pp. 499--510, 2012.
  18. Zhi-Zhong Chen, B. Ma, and L. Wang. A Three-String Approach to the Closest String Problem. Journal of Computer and System Sciences, Vol. 78, No. 1, pp. 164--178, 2012.
  19. Zhi-Zhong Chen and L. Wang. Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (L,d)-Motif Model. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 8, No. 5, 1400--1410, 2011.
  20. Zhi-Zhong Chen, G. Lin, and L. Wang. An Approximation Algorithm for the Minimum Co-Path Set Problem. Algorithmica, Vol. 60, pp. 969--986, 2011.
  21. Zhi-Zhong Chen and L. Wang. HybridNET: a Tool for Constructing Hybridization Networks. Bioinformatics, Vol. 26, No. 22, pp. 2912--2913, 2010.
  22. Zhi-Zhong Chen, S. Konno, and Y. Matsushita. Approximating Maximum Edge 2-Coloring in Simple Graphs. Discrete Applied Mathematics, Vol. 158, pp. 1894--1901, 2010.
  23. Z. Cai, Zhi-Zhong Chen, and G. Lin. A 3.4713-Approximation Algorithm for the Capacitated Multicast Tree Routing Problem. Theoretical Computer Science (special issue on COCOA 2008, invited submission), Vol. 410, No. 52, pp. 5415--5424, 2009.
  24. Zhi-Zhong Chen and R. Tanahashi. Approximating Maximum Edge 2-Coloring in Simple Graphs via Local Improvement. Theoretical Computer Science (special issue on AAIM 2008, invited submission), Vol. 410, No. 45, pp. 4543--4553, 2009.
  25. Zhi-Zhong Chen and L. Wang. Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 6, No. 3, pp. 438--453, 2009.
  26. Zhi-Zhong Chen, L. Wang, and Z. Wang. Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. Algorithmica (special issue on COCOON 2007, invited submission), Vol. 54, No. 4, pp. 501--529, 2009.
  27. Zhi-Zhong Chen, R. Tanahashi, and L. Wang. An Improved Randomized Approximation Algorithm for Maximum Triangle Packing. Discrete Applied Mathematics, , Vol. 157, pp. 1640--1646, 2009.
  28. Zhi-Zhong Chen, Z. Feng, M. Li, and F. Yao. Optimizing Deletion Cost for Secure Multicast Key Management. Theoretical Computer Science, Vol. 401, No. 1-3, pp. 52--61, 2008.
  29. Zhi-Zhong Chen , R. Tanahashi, and L. Wang. An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs. Journal of Discrete Algorithms, Vol. 6, No. 2, pp. 205--215, 2008.
  30. Zhi-Zhong Chen. Approximation Algorithms for Bounded Degree Phylogenetic Roots. Algorithmica, Vol. 51, No. 1, pp. 1--23, 2008.
  31. Zhi-Zhong Chen. New Bounds on the Edge Number of a k-Map Graph. Journal of Graph Theory , Vol. 55, No. 4, pp. 267--290, 2007.
  32. Zhi-Zhong Chen and T. Nagoya. Improved Approximation Algorithms for Metric Max TSP. Journal of Combinatorial Optimization, Vol. 13, pp. 321--336, 2007.
  33. T. Tsukiji and Zhi-Zhong Chen. Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. Theoretical Computer Science, Vol. 363 (special issume on COCOON 2004, invited submission), No. 1, pp. 43--59, 2006.
  34. Zhi-Zhong Chen , M. Grigni, and C.H. Papadimitriou. Recognizing Hole-Free 4-Map Graphs in Cubic Time. Algorithmica, Vol. 45, pp. 227--262, 2006.
  35. Zhi-Zhong Chen and T. Tsukiji. Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. Journal of Algorithms, Vol. 59, No. 2, pp. 125--148, 2006.
  36. G. Lin, T. Tegos, and Zhi-Zhong Chen . Heuristic Search in Constrained Bipartite Matching with Applications to Protein NMR Backbone Resonance Assignment. Journal of Bioinformatics and Computational Biology, Vol. 3, No. 6, pp. 1331--1350, 2005.
  37. Zhi-Zhong Chen and M. Kouno. A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs. Algorithmica, Vol. 43, No. 3, pp. 147--177, 2005.
  38. Zhi-Zhong Chen and L. Wang. An Improved Randomized Approximation Algorithm for Max TSP. Journal of Combinatorial Optimization, Vol. 9, No. 4, pp. 401--432, 2005.
  39. Zhi-Zhong Chen , Y. Okamoto, and L. Wang. Improved Deterministic Approximation Algorithms for Max TSP. Information Processing Letters, Vol. 95, No. 2, pp. 333--342, 2005.
  40. Zhi-Zhong Chen, T. Jiang, G. Lin, R. Rizzi, J. Wen, D. Xu, and Y. Xu. More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. Journal of Computational Biology, Vol. 12, No. 2, pp. 129--146, 2005.
  41. Zhi-Zhong Chen, Y. Gao, G. Lin, R. Niewiadomski, Y. Wang, and J. Wu. A Space Efficient Algorithm for Sequence Alignment with Inversions and Reversals. Theoretical Computer Science, Vol. 325 (special issue on COCOON 2003, invited submission), pp. 361--372, 2004.
  42. Zhi-Zhong Chen and X. He. Disc Embeddings of Planar Graphs. Algorithmica, Vol. 38, No. 4, pp. 539--576, 2004.
  43. Zhi-Zhong Chen, T. Jiang, and G. Lin. Computing Phylogenetic Roots with Bounded Degrees and Errors. SIAM Journal on Computing, Vol. 32, No. 4, pp. 864--879, 2003.
  44. G. Lin, D. Xu, Zhi-Zhong Chen, T. Jiang, J. Wen, and Y. Xu. Computational Assignment of Protein Backbone NMR Peaks by Efficient Bounding and Filtering. Journal of Bioinformatics and Computational Biology, Vol. 1 (special issue on IEEE/CSB2002, invited submission), pp. 387--410, 2003.
  45. Zhi-Zhong Chen, T. Jiang, G. Lin, J. Wen, D. Xu, J. Xu, and Y. Xu. Approximation Algorithms for NMR Spectral Peak Assignment. Theoretical Computer Science, Vol. 299, pp. 211--229, 2003.
  46. Zhi-Zhong Chen, X. He, and M.-Y. Kao. Common-face Embeddings of Planar Graphs. SIAM Journal on Computing, Vol. 32, No. 2, pp. 408--434, 2003.
  47. G. Lin, Zhi-Zhong Chen, T. Jiang and J. Wen. The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. Journal of Computer and System Sciences (special issue on computational biology), Vol. 65, No. 3, pp. 465--480, 2002.
  48. Zhi-Zhong Chen and S. Zhang. Tight Upper Bound on the Number of Edges in a Bipartite K3,3-free or K5-free Graph with an Application. Information Processing Letters, Vol. 84, No. 3, pp. 141--145, 2002.
  49. Zhi-Zhong Chen, M. Grigni, and C.H. Papadimitriou. Map Graphs. Journal of the ACM, Vol. 49, No. 2, pp. 127--138, 2002.
  50. Zhi-Zhong Chen, X. He, and C.-H. Huang. Finding Double Euler Trails of Planar Graphs in Linear Time. SIAM Journal on Computing, Vol. 31, No. 4, pp. 1255--1285, 2002.
  51. Zhi-Zhong Chen. Approximating Unweighted Connectivity Problems in Parallel. Information and Computation, Vol. 171, pp. 125--136, 2001
  52. Zhi-Zhong Chen. Approximation Algorithms for Independent Sets in Map Graphs. Journal of Algorithms, Vol. 41, pp. 20--40, 2001.
  53. R. Uehara and Zhi-Zhong Chen. Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs. Information Processing Letters Vol. 76, pp. 13--17, 2000.
  54. Zhi-Zhong Chen and M.-Y. Kao. Reducing Randomness via Irrational Numbers. SIAM Journal on Computing, Vol. 29, No. 4, pp. 1247--1256, 2000.
  55. X. He and Zhi-Zhong Chen. An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications. SIAM Journal on Computing, Vol. 29, No. 1, pp. 65--80, 1999.
  56. Zhi-Zhong Chen. Efficient Algorithms for Acyclic Colorings of Graphs. Theoretical Computer Science, Vol. 230, pp. 75--95, 1999.
  57. R. Uehara, Zhi-Zhong Chen, and X. He. Fast RNC and NC Algorithms for Maximal Path Sets. Theoretical Computer Science, Vol. 215, pp. 89--98, 1999.
  58. Zhi-Zhong Chen. Efficient Approximation Schemes for Maximization Problems on K3,3-free or K5-free Graphs. Journal of Algorithms, Vol. 26, pp. 166--187, 1998.
  59. Zhi-Zhong Chen and X. He. Parallel Algorithms for Maximal Acylic Sets. Algorithmica, Vol. 19, pp. 354--368, 1997.
  60. Zhi-Zhong Chen and X. He. Parallel Complexity of Partitioning a Planar Graph into Vertex-Induced Forests. Discrete Applied Mathematics, Vol. 69, pp. 183--198, 1996.
  61. Zhi-Zhong Chen. Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings. Theoretical Computer Science, Vol. 161, pp. 1--21, 1996.
  62. Zhi-Zhong Chen. A Fast and Efficieint NC Algorithm for Maximal Matching. Information Processing Letters, Vol. 55, pp. 303--307, 1995.
  63. Zhi-Zhong Chen. The Maximal f-Dependent Set Problem for Planar Graphs Is in NC. Theoretical Computer Science, Vol. 143, pp. 309--318, 1995.
  64. Zhi-Zhong Chen and S. Toda. The Complexity of Selecting Maximal Solutions. Information and Computation, Vol. 119, pp. 231--239, 1995.
  65. Zhi-Zhong Chen. A Parallel Algorithm for Finding a Triconnected Component Separator with an Application. Information Processing Letters, Vol. 52, pp. 265--271, 1994.
  66. Zhi-Zhong Chen. A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Boolean Formula. Information Processing Letters, Vol. 43, pp. 191--193, 1992.
  67. Zhi-Zhong Chen. A Simple Parallel Algorithm for Computing the Diameters of All Vertices in a Tree and Its Application. Information Processing Letters, Vol. 42, pp. 243--248, 1992.
  68. Zhi-Zhong Chen and S. Toda. On the Complexity of Computing Optimal Solutions. International Journal of Fundations of Computer Science, Vol. 2, pp. 207--220, 1991.
  69. Zhi-Zhong Chen. A Randomized NC Algorithm for the Maximal Tree Cover Problem. Information Processing Letters, Vol. 40, pp. 241--246, 1991.
    Domestic Journal Papers
  1. Zhi-Zhong Chen, T. Tsukiji, and H. Yamada. Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications. IEICE Trans. Inf. & Syst., Vol. 99-A, No. 6, pp. 1050-1058, 2016.
  2. R. Tanahashi and Zhi-Zhong Chen. A Deterministic Approximation Algorithm for Maximum 2-Path Packing. IEICE Trans. Inf. & Syst., Vol. E93-D, No. 2, pp. 241--249, 2010.
  3. R. Uehara and Zhi-Zhong Chen. Parallel Algorithms for Maximal Linear Forests. IEICE Trans. Inf. & Syst., Vol. E80-A, pp. 627--634, 1997.
  4. Zhi-Zhong Chen and T. Kasai. Parallel Algorithms for the Maximal Tree Cover Problems. IEICE Trans. Inf. & Syst., Vol. E75-D, pp. 30--34, 1992.
  5. Zhi-Zhong Chen and S. Toda. Grammatical Characterizations of P and PSPACE. The Transactions of the IEICE, Vol. E73, No. 9, pp.1540--1548, 1990.
  6. Zhi-Zhong Chen and T. Kasai. On Probabilistic Pushdown Automata (in Japanese). The Transactions of the IEICE, Vol. J71-D, No. 5, pp.766--773, 1988.
    Refereed International Conference Papers
  1. M. Etemadi1, M. Bagherian1, Zhi-Zhong Chen, and L. Wang. Better ILP Models for Haplotype Assembly. Proceedings of 28th International Conference on Genome Informatics: bioinformatics (GIW 2017).
  2. Zhi-Zhong Chen, G. Lin, L. Wang, Y. Chen, D. Wang. Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. Proceedings of 23rd International Computing and Combinatorics Conference (COCOON 2017), Lecture Notes in Computer Science, Vol. 10392, pp. 124--136, 2017.
  3. S. Yuasa, Zhi-Zhong Chen, B. Ma, and L. Wang. Designing and Implementing Algorithms for the Closest String Problem. Proceedings of 11th International Frontiers of Algorithmics Workshop (FAW'2017), Lecture Notes in Computer Science, Vol. 10336, pp. 79--90, 2017.
  4. Zhi-Zhong Chen, Y. Harada, and L. Wang. A New 2-Approximation Algorithm for rSPR Distance. Proceedings of 13th International Symposium on Bioinformatics Research and Applications (ISBRA'2017), Lecture Notes in Computer Science, Vol. 10330, pp. 128--139, 2017.
  5. Zhi-Zhong Chen, Y. Harada, and L. Wang. An Approximation Algorithm for Maximum Internal Spanning Tree. Proceedings of 11th International Conference and Workshops on Algorithms and Computation (WALCOM'2017), Lecture Notes in Computer Science, Vol. 10167, pp. 385--396, 2017.
  6. Zhi-Zhong Chen, E. Machida, and L. Wang. An Approximation Algorithm for rSPR Distance. Proceedings of 22nd International Computing and Combinatorics Conference (COCOON'2016), Lecture Notes in Computer Science, Vol. 9797, pp. 468--479, 2016.
  7. Zhi-Zhong Chen, Y. Harada, E. Machida, F. Guo, and L. Wang. Better Approximation Algorithms for Scaffolding Problems. Proceedings of 10th International Frontiers of Algorithmics Workshop (FAW'2016), Lecture Notes in Computer Science, Vol. 9711, pp. 17--28, 2016.
  8. Zhi-Zhong Chen, Q. Feng, C. Shen, J. Wang, and L. Wang. Algorithms for Pedigree Comparison. Proceedings of 14th Asia Pacific Bioinformatics Conference (APBC'2016).
  9. Zhi-Zhong Chen, B. Ma, and L. Wang. Randomized and Parameterized Algorithms for the Closest String Problem. Proceedings of 25th Annual International Symposium on Combinatorial Pattern Matching, (CPM'2014), Lecture Notes in Computer Science, Vol. 8486, pp. 100--109, 2014.
  10. Zhi-Zhong Chen, Y. Fan, and L. Wang. Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings. Proceedings of 7th Annual International Conference on Combinatorial Optimization and Applications (COCOA'13), Lecture Notes in Computer Science, Vol. 8287, pp. 1--12, 2013.
  11. Zhi-Zhong Chen and L. Wang. Faster Exact Computation of rSPR Distance. Proceedings of 3rd Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (FAW-AAIM'13), Lecture Notes in Computer Science, Vol. 7924, pp. 36-47, 2013.
  12. Zhi-Zhong Chen, F. Deng, and L. Wang. Identifying Duplications and Lateral Gene Transfers Simultaneously and Rapidly. Proceedings of 2013 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB'13), pp. 128-135, 2013.
  13. Zhi-Zhong Chen and L. Wang. An Improved Approximation Algorithm for the Bandpass-2 Problem. Proceedings of the 6th Annual International Conference on Combinatorial Optimization and Applications, (COCOA'12), Lecture Notes in Computer Science, Vol. 7402, pp. 188--199, 2012.
  14. Zhi-Zhong Chen, L. Wang, and W. Ma. The Parameterized Complexity of the Shared Center String Problem. Proceedings of 23rd Annual International Symposium on Combinatorial Pattern Matching, (CPM'2012), Lecture Notes in Computer Science, Vol. 7354, pp. 439--452, 2012.
  15. Zhi-Zhong Chen, B. Ma, and L. Wang. A Three-String Approach to the Closest String Problem. Proceedings of 16th Annual International Computing and Combinatorics Conference (COCOON'2010), Lecture Notes in Computer Science, Vol. 6196, pp. 449--458, 2010.
  16. Zhi-Zhong Chen, S. Konno, and Y. Matsushita. Approximating Maximum Edge 2-Coloring in Simple Graphs. Proceedings of 6th International Conference on Algorithmic Aspects in Information and Management (AAIM'2010), Lecture Notes in Computer Science, Vol. 6124, pp. 78--89, 2010.
  17. Zhi-Zhong Chen, M. R. Fellows, B. Fu, H. Jiang, Y. Liu, L. Wang, and B. Zhu. A Linear Kernel for Co-Path/Cycle Packing. Proceedings of 6th International Conference on Algorithmic Aspects in Information and Management (AAIM'2010), Lecture Notes in Computer Science, Vol. 6124, pp. 90--102, 2010.
  18. Z. Cai, Zhi-Zhong Chen, G. Lin, and L. Wang. An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem. Proceedings of 2nd International Conference on Combinatorial Optimization and Applications (COCOA'08), Lecture Notes in Computer Science, Vol. 5165, pp. 286-295, 2008.
  19. Zhi-Zhong Chen and R. Tanahashi. Approximating Maximum Edge 2-Coloring in Simple Graphs via Local Improvement. Proceedings of 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08), Lecture Notes in Computer Science, Vol. 5034, pp. 84-96, 2008.
  20. Zhi-Zhong Chen, R. Tanahashi, and L. Wang. An Improved Randomized Approximation Algorithm for Maximum Triangle Packing. Proceedings of 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08), Lecture Notes in Computer Science, Vol. 5034, pp. 97-108, 2008.
  21. L. Wang, Z. Wang, and Zhi-Zhong Chen. Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. Proceedings of 13th Annual International Computing and Combinatorics Conference (COCOON'2007), Lecture Notes in Computer Science, Vol. 4598, pp. 493-503, 2007.
  22. Zhi-Zhong Chen and R. Tanahashi. An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs. Proceedings of 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07), Lecture Notes in Computer Science, Vol. 4508, pp. 27--36, 2007.
  23. Zhi-Zhong Chen and T. Nagoya. Improved Approximation Algorithms for Metric Max TSP. Proceedings of 13th European Symposium on Algorithms (ESA2005), Lecture Notes in Computer Science, Vol. 3669, pp. 179--190, 2005.
  24. Zhi-Zhong Chen and T. Tsukiji. Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. Proceedings of 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2004), Lecture Notes in Computer Science, Vol. 3353, pp. 308--319, 2004.
  25. Zhi-Zhong Chen. New Bounds on the Number of Edges in a k-Map Graph. Proceedings of 10th Annual International Computing and Combinatorics Conference (COCOON2004), Lecture Notes in Computer Science, Vol. 3106, pp. 319--328, 2004.
  26. T. Tsukiji and Zhi-Zhong Chen. Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. Proceedings of 10th Annual International Computing and Combinatorics Conference (COCOON2004), Lecture Notes in Computer Science, Vol. 3106, pp. 450--461, 2004.
  27. Zhi-Zhong Chen. Protein NMR Peak Assignment: Algorithms and Complexity. Proceedings of 8th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI2004), Vol. IX, pp. 7--10, 2004.
  28. Zhi-Zhong Chen, T. Jiang, G. Lin, R. Rizzi, J. Wen, D. Xu, and Y. Xu. More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. Proceedings of 11th European Symposium on Algorithms (ESA2003), Lecture Notes in Computer Science, Vol. 2832, pp. 580--592, 2003.
  29. Zhi-Zhong Chen and M. Kouno. A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs. Proceedings of 28th International Symposium on Mathematical Foundations of Computer Science (MFCS2003), Lecture Notes in Computer Science, Vol. 2747, pp. 348--357, 2003.
  30. Y. Gao, J. Wu, R. Niewiadomski, Y. Wang, Zhi-Zhong Chen, G. Lin. A Space Efficient Algorithm for Sequence Alignment with Inversions. Proceedings of 9th Annual International Computing and Combinatorics Conference (COCOON2003), Lecture Notes in Computer Science, Vol. 2697, pp. 57--67, 2003.
  31. Zhi-Zhong Chen, T. Jiang, G. Lin, J. Wen, D. Xu, and Y. Xu. Better Approximation Algorithms for NMR Spectral Peak Assignment. Proceedings of 2nd Workshop on Algorithms in Bioinformatics (WABI2002), Lecture Notes in Computer Science, Vol. 2452, pp. 82--96, 2002.
  32. G. Lin, D. Xu, Zhi-Zhong Chen, T. Jiang, and Y. Xu. An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks. Proceedings of CSB2002 (the IEEE Computer Society Bioinformatics Conference), pp. 165--174, 2002.
  33. Y. Xu, D. Xu, D. Kim, Zhi-Zhong Chen, G. Lin, and T. Jiang. Combinatorial Optimization Algorithms for Assignment of Protein Backbone NMR Peaks. Poster (PS-109) in the 6th ACM Annual International Conference on Research in Computational Molecular Biology (RECOMB 2002), 2002.
  34. Zhi-Zhong Chen, T. Jiang, and G. Lin. Computing phylogenetic roots with bounded degrees and errors. Proceedings of 7th International Workshop on Algorithms and Data Structures (WADS2001), Lecture Notes in Computer Science, Vol. 2125, pp.377--388, 2001.
  35. G. Lin, Zhi-Zhong Chen, T. Jiang and J. Wen. The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. Proceedings of 28th International Colloquium on Automata, Languages, and Programming (ICALP2001), Lecture Notes in Computer Science, Vol. 2076, pp. 444--455, 2001.
  36. R. Uehara and Zhi-Zhong Chen. Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs. Proceedings of IFIP International Conference on Theoretical Computer Science (IFIP TCS2000), Lecture Notes in Computer Science, Vol. 1872, pp. 84--98, Springer-Verlag, 2000.
  37. Zhi-Zhong Chen. Approximation Algorithms for Independent Sets in Map Graphs. Proceedings of 6th Annual International Computing and Combinatorics Conference (COCOON2000), Lecture Notes in Computer Science, Vol. 1858, pp. 105--114, Springer-Verlag, 2000.
  38. Zhi-Zhong Chen and X. He. Hierarchical Topological Inference on Planar Disc Maps. Proceedings of 6th Annual International Computing and Combinatorics Conference (COCOON2000), Lecture Notes in Computer Science, Vol. 1858, pp. 115--125, Springer-Verlag, 2000.
  39. Zhi-Zhong Chen, X. He, and C.-H. Huang. Finding Double Euler Trails of Planar Graphs in Linear Time. Proceedings of 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS99), pp. 319--329, IEEE, 1999.
  40. Zhi-Zhong Chen, X. He, and M.-Y. Kao. Nonplanar Topological Inference and Political-map Graphs. Proceedings of 10th Annual ACM-SAIM Symposium on Discrete Algorithms (SODA99), pp. 195--204, SIAM, 1999.
  41. Zhi-Zhong Chen, M. Grigni, and C.H. Papadimitriou. Planar Map Graphs. Proceedings of 30th Annual ACM Symposium on Theory of Computing (STOC98), pp. 514--523, ACM, 1998.
  42. Zhi-Zhong Chen. Approximating Unweighted Connectivity Problems in Parallel. Proceedings of 8th International Symposium on Algorithms and Computation (ISAAC97), Lecture Notes in Computer Science, Vol. 1350, pp. 202--211, 1997.
  43. Zhi-Zhong Chen, M. Grigni, and C.H. Papadimitriou. Planarity, Revisited (Extended Abstract). Invited talk given by C.H. Papadimitriou at 5th International Workshop on Algorithms and Data Structures.
  44. R. Uehara and Zhi-Zhong Chen. Parallel Algorithms for Maximal Linear Forests. Proceedings of 2nd Workshop on Randomized Parallel Computing, IEEE, 1997.
  45. Zhi-Zhong Chen and M.-Y. Kao. Reducing Randomness via Irrational Numbers. Proceedings of 29th Annual ACM Symposium on Theory of Computing (STOC97), pp. 200--209, ACM, 1997.
  46. X. He and Zhi-Zhong Chen. Shortest Path in Complete Bipartite Digraph Problem and its Applications. Proceedings of 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA97), pp. 230--238, SIAM, 1997.
  47. R. Uehara, Zhi-Zhong Chen, and X. He. Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. Proceedings of 2nd Annual International Computing and Combinatorics Conference (COCOON96), Lecture Notes in Computer Science, Vol. 1090, pp. 209--218, Springer-Verlag, 1996.
  48. Zhi-Zhong Chen. Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K3,3-free or K5-free Graphs. Proceedings of 23rd International Colloquium on Automata, Languages, and Programming (ICALP96), Lecture Notes in Computer Science, Vol. 1099, pp. 268--279, Springer-Verlag, 1996.
  49. Zhi-Zhong Chen and X. He. NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. Proceedings of 21st International Workshop on Graph-Theoretic Concepts in Computer Science (WG95), Lecture Notes in Computer Science, Vol. 1017, pp. 275--289, 1995.
  50. Zhi-Zhong Chen. NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings. Proceedings of 22nd International Colloquium on Automata, Languages, and Programming (ICALP95), Lecture Notes in Computer Science, Vol. 944, pp. 99--110, 1995.
  51. Zhi-Zhong Chen. NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application. Proceedings of 6th International Symposium on Algorithms and Computation (ISAAC95), Lecture Notes in Computer Science, Vol. 1004, pp. 428--437, 1995.
  52. Zhi-Zhong Chen and X. He. Parallel Algorithms for Maximal Acyclic Sets. Proceedings of Aizu International Symposium on Parallel Algorithm/Architecture Synthesis, pp. 169--175, IEEE, 1995.
  53. Zhi-Zhong Chen. The Maximal f-Dependent Set Problem Is in NC. Proceedings of 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG94), Lecture Notes in Computer Science, Vol. 901, pp. 232--241, 1994.
  54. Zhi-Zhong Chen and S. Toda. The Complexity of Selecting Maximal Solutions. Proceedings of 8th IEEE Conference on Structure in Complexity Theory (SICT93), pp. 313--325, IEEE, 1993.
  55. Zhi-Zhong Chen and S. Toda. The Complexity of Finding a Minimal Satisfying Truth Assignment to a Boolean Formula. Proceedings of 3rd International Conference for Young Computer Scientists (ICYCS93), pp. 637--640, 1993.