| 2024 | COCOON | Approximately Covering Vertices by Order-5 or Longer Paths. | Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang |
| 2023 | COCOA | An Approximation Algorithm for Covering Vertices by 4 | Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang |
| 2021 | FAW | Approximation Algorithms for the Directed Path Partition Problems. | Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang |
| 2019 | COCOA | A Randomized Approximation Algorithm for Metric Triangle Packing. | Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang |
| 2019 | COCOA | Approximation Algorithms for Maximally Balanced Connected Graph Partition. | Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang |
| 2019 | WABI | Better Practical Algorithms for rSPR Distance and Hybridization Number. | Kohei Yamada, Zhi-Zhong Chen, Lusheng Wang |
| 2017 | COCOON | Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. | Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang |
| 2017 | FAW | Designing and Implementing Algorithms for the Closest String Problem. | Shota Yuasa, Zhi-Zhong Chen, Bin Ma, Lusheng Wang |
| 2017 | WALCOM | An Approximation Algorithm for Maximum Internal Spanning Tree. | Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang |
| 2016 | COCOON | An Improved Approximation Algorithm for rSPR Distance. | Zhi-Zhong Chen, Eita Machida, Lusheng Wang |
| 2016 | FAW | Better Approximation Algorithms for Scaffolding Problems. | Zhi-Zhong Chen, Youta Harada, Eita Machida, Fei Guo, Lusheng Wang |
| 2014 | CPM | Randomized and Parameterized Algorithms for the Closest String Problem. | Zhi-Zhong Chen, Bin Ma, Lusheng Wang |
| 2013 | AAIM | Faster Exact Computation of rSPR Distance. | Zhi-Zhong Chen, Lusheng Wang |
| 2013 | CIBCB | Identifying duplications and lateral gene transfers simultaneously and rapidly. | Zhi-Zhong Chen, Fei Deng, Lusheng Wang |
| 2013 | COCOA | Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings. | Zhi-Zhong Chen, Ying Fan, Lusheng Wang |
| 2012 | COCOA | An Improved Approximation Algorithm for the Bandpass-2 Problem. | Zhi-Zhong Chen, Lusheng Wang |
| 2012 | CPM | The Parameterized Complexity of the Shared Center Problem. | Zhi-Zhong Chen, Lusheng Wang, Wenji Ma |
| 2010 | AAIM | A Linear Kernel for Co-Path/Cycle Packing. | Zhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu |
| 2010 | AAIM | Approximating Maximum Edge 2-Coloring in Simple Graphs. | Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita |
| 2010 | COCOON | A Three-String Approach to the Closest String Problem. | Zhi-Zhong Chen, Bin Ma, Lusheng Wang |
| 2008 | AAIM | Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement. | Zhi-Zhong Chen, Ruka Tanahashi |
| 2008 | AAIM | An Improved Randomized Approximation Algorithm for Maximum Triangle Packing. | Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang |
| 2008 | COCOA | An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem. | Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang |
| 2007 | AAIM | An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs. | Zhi-Zhong Chen, Ruka Tanahashi |
| 2007 | COCOON | Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. | Lusheng Wang, Zhanyong Wang, Zhi-Zhong Chen |
| 2005 | ESA | Improved Approximation Algorithms for Metric Max TSP. | Zhi-Zhong Chen, Takayuki Nagoya |
| 2004 | COCOON | New Bounds on the Number of Edges in a k-Map Graph. | Zhi-Zhong Chen |
| 2004 | COCOON | Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. | Tatsuie Tsukiji, Zhi-Zhong Chen |
| 2004 | WG | Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. | Zhi-Zhong Chen, Tatsuie Tsukiji |
| 2003 | COCOON | A Space Efficient Algorithm for Sequence Alignment with Inversions. | Yong Gao, Junfeng Wu, Robert Niewiadomski, Yang Wang, Zhi-Zhong Chen, Guohui Lin |
| 2003 | ESA | More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. | Zhi-Zhong Chen, Tao Jiang, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu |
| 2003 | MFCS | A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs. | Zhi-Zhong Chen, Mitsuharu Kouno |
| 2002 | WABI | Improved Approximation Algorithms for NMR Spectral Peak Assignment. | Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin, Jianjun Wen, Dong Xu, Ying Xu |
| 2001 | ICALP | The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. | Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen |
| 2001 | WADS | Computing Phylogenetic Roots with Bounded Degrees and Errors. | Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin |
| 2000 | COCOON | Approximation Algorithms for Independent Sets in Map Graphs. | Zhi-Zhong Chen |
| 2000 | COCOON | Hierarchical Topological Inference on Planar Disc Maps. | Zhi-Zhong Chen, Xin He |
| 1999 | FOCS | Finding Double Euler Trails of Planar Graphs in Linear Time. | Zhi-Zhong Chen, Xin He, Chun-Hsi Huang |
| 1999 | SODA | Nonplanar Topological Inference and Political-Map Graphs. | Zhi-Zhong Chen, Xin He, Ming-Yang Kao |
| 1998 | STOC | Planar Map Graphs. | Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou |
| 1997 | ISAAC | Approximating Unweighted Connectivity Problems in Parallel. | Zhi-Zhong Chen |
| 1997 | SODA | Shortest Path in Complete Bipartite Digraph Problem and its Applications. | Xin He, Zhi-Zhong Chen |
| 1997 | STOC | Reducing Randomness via Irrational Numbers. | Zhi-Zhong Chen, Ming-Yang Kao |
| 1997 | WADS | Panarity, Revisited (Extended Abstract). | Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou |
| 1996 | COCOON | Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. | Ryuhei Uehara, Zhi-Zhong Chen, Xin He |
| 1996 | ICALP | Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs. | Zhi-Zhong Chen |
| 1995 | ICALP | NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings. | Zhi-Zhong Chen |
| 1995 | ISAAC | NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application. | Zhi-Zhong Chen |
| 1995 | WG | NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. | Zhi-Zhong Chen, Xin He |
| 1994 | WG | The Maximal f-Dependent Set Problem for Planar Graphs is in NC. | Zhi-Zhong Chen |