Probabilistic automata push-down. - Zhi-Zhong Chen; Takumi Kasai (Syst. Comput. Jpn., 1989)

On the Complexity of Computing Optimal Solutions. - Zhi-Zhong Chen; Seinosuke Toda (Int. J. Found. Comput. Sci., 1991)

A Randomized NC Algorithm for the Maximal Tree Cover Problem. - Zhi-Zhong Chen (Inf. Process. Lett., 1991)

A Simple Parallel Algorithm for Computing the Diameters of all Vertices in a Tree and its Application. - Zhi-Zhong Chen (Inf. Process. Lett., 1992)

A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. - Zhi-Zhong Chen (Inf. Process. Lett., 1992)

A Parallel Algorithm for Finding a Triconnected Component Separator with an Application. - Zhi-Zhong Chen (Inf. Process. Lett., 1994)

NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings. - Zhi-Zhong Chen (ICALP, 1995)

NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application. - Zhi-Zhong Chen (ISAAC, 1995)

NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. - Zhi-Zhong Chen; Xin He 005 (WG, 1995)

A Fast and Efficient NC Algorithm for Maximal Matching. - Zhi-Zhong Chen (Inf. Process. Lett., 1995)

The Maximal f-Dependent Set Problem for Planar Graphs is in NC. - Zhi-Zhong Chen (Theor. Comput. Sci., 1995)

The Complexity of Selecting Maximal Solutions - Zhi-Zhong Chen; Seinosuke Toda (Inf. Comput., 1995)

Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. - Ryuhei Uehara; Zhi-Zhong Chen; Xin He 005 (COCOON, 1996)

Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs. - Zhi-Zhong Chen (ICALP, 1996)

Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests. - Zhi-Zhong Chen; Xin He 005 (Discret. Appl. Math., 1996)

Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings. - Zhi-Zhong Chen (Theor. Comput. Sci., 1996)

Shortest Path in Complete Bipartite Digraph Problem and its Applications. - Xin He 005; Zhi-Zhong Chen (SODA, 1997)

Panarity, Revisited (Extended Abstract). - Zhi-Zhong Chen; Michelangelo Grigni; Christos H. Papadimitriou (WADS, 1997)

Parallel Algorithms for Maximal Acyclic Sets. - Zhi-Zhong Chen; Xin He 005 (Algorithmica, 1997)

Planar Map Graphs. - Zhi-Zhong Chen; Michelangelo Grigni; Christos H. Papadimitriou (STOC, 1998)

Efficient Approximation Schemes for Maximization Problems on K3,3-free or K5-free Graphs. - Zhi-Zhong Chen (J. Algorithms, 1998)

Nonplanar Topological Inference and Political-Map Graphs. - Zhi-Zhong Chen; Xin He 005; Ming-Yang Kao (SODA, 1999)

An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications. - Xin He 005; Zhi-Zhong Chen (SIAM J. Comput., 1999)

Fast RNC and NC Algorithms for Maximal Path Sets. - Ryuhei Uehara; Zhi-Zhong Chen; Xin He 005 (Theor. Comput. Sci., 1999)

Hierarchical Topological Inference on Planar Disc Maps. - Zhi-Zhong Chen; Xin He 005 (COCOON, 2000)

Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. - Ryuhei Uehara; Zhi-Zhong Chen (IFIP TCS, 2000)

Parallel approximation algorithms for maximum weighted matching in general graphs. - Ryuhei Uehara; Zhi-Zhong Chen (Inf. Process. Lett., 2000)

Reducing Randomness via Irrational Numbers. - Zhi-Zhong Chen; Ming-Yang Kao (SIAM J. Comput., 2000)

Efficient Algorithms for Acyclic Colorings of Graphs. - Zhi-Zhong Chen (Theor. Comput. Sci., 2000)

Approximating Unweighted Connectivity Problems in Parallel. - Zhi-Zhong Chen (Inf. Comput., 2001)

Approximation Algorithms for Independent Sets in Map Graphs. - Zhi-Zhong Chen (J. Algorithms, 2001)

An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks. - Guo-Hui Lin; Dong Xu 002; Zhi-Zhong Chen; Tao Jiang 001; Jianjun Wen; Ying Xu 001 (CSB, 2002)

Improved Approximation Algorithms for NMR Spectral Peak Assignment. - Zhi-Zhong Chen; Tao Jiang 001; Guo-Hui Lin; Jianjun Wen; Dong Xu 002; Ying Xu 001 (WABI, 2002)

Tight upper bound on the number of edges in a bipartite K3, 3-free or K5-free graph with an application. - Zhi-Zhong Chen; Shiqing Zhang (Inf. Process. Lett., 2002)

Map graphs. - Zhi-Zhong Chen; Michelangelo Grigni; Christos H. Papadimitriou (J. ACM, 2002)

The longest common subsequence problem for sequences with nested arc annotations. - Guo-Hui Lin; Zhi-Zhong Chen; Tao Jiang 001; Jianjun Wen (J. Comput. Syst. Sci., 2002)

Finding Double Euler Trails of Planar Graphs in Linear Time. - Zhi-Zhong Chen; Xin He 005; Chun-Hsi Huang (SIAM J. Comput., 2002)

A Space Efficient Algorithm for Sequence Alignment with Inversions. - Yong Gao; Junfeng Wu; Robert Niewiadomski; Yang Wang 006; Zhi-Zhong Chen; Guohui Lin (COCOON, 2003)

A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs. - Zhi-Zhong Chen; Mitsuharu Kouno (MFCS, 2003)

Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering. - Guohui Lin; Dong Xu 002; Zhi-Zhong Chen; Tao Jiang 001; Jianjun Wen; Ying Xu 001 (J. Bioinform. Comput. Biol., 2003)

Common-Face Embeddings of Planar Graphs. - Zhi-Zhong Chen; Xin He 005; Ming-Yang Kao (SIAM J. Comput., 2003)

Computing Phylogenetic Roots with Bounded Degrees and Errors. - Zhi-Zhong Chen; Tao Jiang 001; Guohui Lin (SIAM J. Comput., 2003)

Approximation algorithms for NMR spectral peak assignment. - Zhi-Zhong Chen; Tao Jiang 001; Guo-Hui Lin; Jianjun Wen; Dong Xu 002; Jinbo Xu; Ying Xu 001 (Theor. Comput. Sci., 2003)

New Bounds on the Number of Edges in a k-Map Graph. - Zhi-Zhong Chen (COCOON, 2004)

Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. - Tatsuie Tsukiji; Zhi-Zhong Chen (COCOON, 2004)

Disk Embeddings of Planar Graphs. - Zhi-Zhong Chen; Xin He 005 (Algorithmica, 2004)

A space-efficient algorithm for sequence alignment with inversions and reversals. - Zhi-Zhong Chen; Yong Gao; Guohui Lin; Robert Niewiadomski; Yang Wang 006; Junfeng Wu (Theor. Comput. Sci., 2004)

Improved Approximation Algorithms for Metric Max TSP. - Zhi-Zhong Chen; Takayuki Nagoya (ESA, 2005)

A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs. - Zhi-Zhong Chen; Mitsuharu Kouno (Algorithmica, 2005)

Improved deterministic approximation algorithms for Max TSP. - Zhi-Zhong Chen; Yuusuke Okamoto; Lusheng Wang 001 (Inf. Process. Lett., 2005)

Heuristic Search in Constrained Bipartite Matching with Applications to Protein Nmr Backbone Resonance Assignment. - Guohui Lin; Theodore Tegos; Zhi-Zhong Chen (J. Bioinform. Comput. Biol., 2005)

More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. - Zhi-Zhong Chen; Guohui Lin; Romeo Rizzi; Jianjun Wen; Dong Xu 002; Ying Xu 001; Tao Jiang 001 (J. Comput. Biol., 2005)

An Improved Randomized Approximation Algorithm for Max TSP. - Zhi-Zhong Chen; Lusheng Wang 001 (J. Comb. Optim., 2005)

Recognizing Hole-Free 4-Map Graphs in Cubic Time. - Zhi-Zhong Chen; Michelangelo Grigni; Christos H. Papadimitriou (Algorithmica, 2006)

Computing bounded-degree phylogenetic roots of disconnected graphs. - Zhi-Zhong Chen; Tatsuie Tsukiji (J. Algorithms, 2006)

Computing phylogenetic roots with bounded degrees and errors is NP-complete. - Tatsuie Tsukiji; Zhi-Zhong Chen (Theor. Comput. Sci., 2006)

An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs. - Zhi-Zhong Chen; Ruka Tanahashi (AAIM, 2007)

Improved approximation algorithms for metric MaxTSP. - Zhi-Zhong Chen; Takayuki Nagoya (J. Comb. Optim., 2007)

New bounds on the edge number of a k-map graph. - Zhi-Zhong Chen (J. Graph Theory, 2007)

Preface. - Zhi-Zhong Chen; Xiaotie Deng; Ding-Zhu Du (Theor. Comput. Sci., 2007)

An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem. - Zhipeng Cai 001; Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001 (COCOA, 2008)

Approximation Algorithms for Bounded Degree Phylogenetic Roots. - Zhi-Zhong Chen (Algorithmica, 2008)

An improved approximation algorithm for maximum edge 2-coloring in simple graphs. - Zhi-Zhong Chen; Ruka Tanahashi; Lusheng Wang 001 (J. Discrete Algorithms, 2008)

Optimizing deletion cost for secure multicast key management. - Zhi-Zhong Chen; Ze Feng; Minming Li; F. Frances Yao (Theor. Comput. Sci., 2008)

Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. - Zhi-Zhong Chen; Lusheng Wang 001; Zhanyong Wang (Algorithmica, 2009)

An improved randomized approximation algorithm for maximum triangle packing. - Zhi-Zhong Chen; Ruka Tanahashi; Lusheng Wang 001 (Discret. Appl. Math., 2009)

Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats. - Zhi-Zhong Chen; Lusheng Wang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

A 3.4713-approximation algorithm for the capacitated multicast tree routing problem. - Zhipeng Cai 001; Zhi-Zhong Chen; Guohui Lin (Theor. Comput. Sci., 2009)

Approximating maximum edge 2-coloring in simple graphs via local improvement. - Zhi-Zhong Chen; Ruka Tanahashi (Theor. Comput. Sci., 2009)

A Linear Kernel for Co-Path/Cycle Packing. - Zhi-Zhong Chen; Michael R. Fellows; Bin Fu; Haitao Jiang; Yang Liu 002; Lusheng Wang 001; Binhai Zhu (AAIM, 2010)

HybridNET: a tool for constructing hybridization networks. - Zhi-Zhong Chen; Lusheng Wang 001 (Bioinform., 2010)

Approximating maximum edge 2-coloring in simple graphs. - Zhi-Zhong Chen; Sayuri Konno; Yuki Matsushita (Discret. Appl. Math., 2010)

Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646] - Zhi-Zhong Chen; Ruka Tanahashi; Lusheng Wang 001 (Discret. Appl. Math., 2010)

A Deterministic Approximation Algorithm for Maximum 2-Path Packing. - Ruka Tanahashi; Zhi-Zhong Chen (IEICE Trans. Inf. Syst., 2010)

An Approximation Algorithm for the Minimum Co-Path Set Problem. - Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001 (Algorithmica, 2011)

Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (L, d)-Motif Model. - Zhi-Zhong Chen; Lusheng Wang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

An Improved Approximation Algorithm for the Bandpass-2 Problem. - Zhi-Zhong Chen; Lusheng Wang 001 (COCOA, 2012)

A fast tool for minimum hybridization networks. - Zhi-Zhong Chen; Lusheng Wang 001; Satoshi Yamanaka (BMC Bioinform., 2012)

A three-string approach to the closest string problem. - Zhi-Zhong Chen; Bin Ma 002; Lusheng Wang 001 (J. Comput. Syst. Sci., 2012)

Simultaneous Identification of Duplications, Losses, and Lateral Gene Transfers. - Zhi-Zhong Chen; Fei Deng; Lusheng Wang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

Algorithms for Reticulate Networks of Multiple Phylogenetic Trees. - Zhi-Zhong Chen; Lusheng Wang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

Mutation Region Detection for Closely Related Individuals without a Known Pedigree. - Wenji Ma; Yong Yang; Zhi-Zhong Chen; Lusheng Wang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

Faster Exact Computation of rSPR Distance. - Zhi-Zhong Chen; Lusheng Wang 001 (FAW-AAIM, 2013)

Exact algorithms for haplotype assembly from whole-genome sequence data. - Zhi-Zhong Chen; Fei Deng; Lusheng Wang 001 (Bioinform., 2013)

An approximation algorithm for the Bandpass-2 problem. - Weitian Tong; Zhi-Zhong Chen; Lusheng Wang 001; Yinfeng Xu; Jiuping Xu; Randy Goebel; Guohui Lin (CoRR, 2013)

An Ultrafast Tool for Minimum Reticulate Networks. - Zhi-Zhong Chen; Lusheng Wang 001 (J. Comput. Biol., 2013)

Randomized and Parameterized Algorithms for the Closest String Problem. - Zhi-Zhong Chen; Bin Ma 002; Lusheng Wang 001 (CPM, 2014)

The Parameterized Complexity of the Shared Center Problem. - Zhi-Zhong Chen; Wenji Ma; Lusheng Wang 001 (Algorithmica, 2014)

Parameterized and approximation algorithms for finding two disjoint matchings. - Zhi-Zhong Chen; Ying Fan; Lusheng Wang 001 (Theor. Comput. Sci., 2014)

Faster exact computation of rSPR distance. - Zhi-Zhong Chen; Ying Fan; Lusheng Wang 001 (J. Comb. Optim., 2015)

An Improved Approximation Algorithm for rSPR Distance. - Zhi-Zhong Chen; Eita Machida; Lusheng Wang 001 (COCOON, 2016)

Better Approximation Algorithms for Scaffolding Problems. - Zhi-Zhong Chen; Youta Harada; Eita Machida; Fei Guo 001; Lusheng Wang 001 (FAW, 2016)

Randomized Fixed-Parameter Algorithms for the Closest String Problem. - Zhi-Zhong Chen; Bin Ma 002; Lusheng Wang 001 (Algorithmica, 2016)

An Approximation Algorithm for Maximum Internal Spanning Tree. - Zhi-Zhong Chen; Youta Harada; Lusheng Wang 001 (CoRR, 2016)

Approximation algorithms for the maximum weight internal spanning tree problem. - Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001; Yong Chen 002 (CoRR, 2016)

A Cubic-Time 2-Approximation Algorithm for rSPR Distance. - Zhi-Zhong Chen; Eita Machida; Lusheng Wang 001 (CoRR, 2016)

Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications. - Zhi-Zhong Chen; Tatsuie Tsukiji; Hiroki Yamada (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Computational Complexity of Predicting Periodicity in the Models of Lorentz Lattice Gas Cellular Automata. - Takeo Hagiwara; Tatsuie Tsukiji; Zhi-Zhong Chen (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Better ILP-Based Approaches to Haplotype Assembly. - Zhi-Zhong Chen; Fei Deng; Chao Shen; Yiji Wang; Lusheng Wang 001 (J. Comput. Biol., 2016)

A New 2-Approximation Algorithm for rSPR Distance. - Zhi-Zhong Chen; Youta Harada; Lusheng Wang 001 (ISBRA, 2017)

Finding a Center Tree of Phylogenetic Trees via Leaf Removal. - Zhi-Zhong Chen; Shohei Ueta; Jingyu Li; Lusheng Wang 001 (BIBM, 2018)

Better ILP models for haplotype assembly. - Maryam Etemadi; Mehri Bagherian; Zhi-Zhong Chen; Lusheng Wang 001 (BMC Bioinform., 2018)

An approximation algorithm for maximum internal spanning tree. - Zhi-Zhong Chen; Youta Harada; Fei Guo 001; Lusheng Wang 001 (J. Comb. Optim., 2018)

Algorithms for Pedigree Comparison. - Zhi-Zhong Chen; Qilong Feng; Chao Shen; Jianxin Wang 001; Lusheng Wang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Approximation algorithms for the scaffolding problem and its generalizations. - Zhi-Zhong Chen; Youta Harada; Fei Guo 001; Lusheng Wang 001 (Theor. Comput. Sci., 2018)

Better Practical Algorithms for rSPR Distance and Hybridization Number. - Kohei Yamada; Zhi-Zhong Chen; Lusheng Wang 001 (WABI, 2019)

Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. - Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001; Yong Chen 002; Dan Wang (Algorithmica, 2019)

Designing and implementing algorithms for the closest string problem. - Shota Yuasa; Zhi-Zhong Chen; Bin Ma 002; Lusheng Wang 001 (Theor. Comput. Sci., 2019)

Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs. - An Zhang 001; Yong Chen 002; Zhi-Zhong Chen; Guohui Lin (Algorithmica, 2020)

Computing a Consensus Phylogeny via Leaf Removal. - Zhi-Zhong Chen; Shohei Ueta; Jingyu Li; Lusheng Wang 001 (J. Comput. Biol., 2020)

Improved Practical Algorithms for Rooted Subtree Prune and Regraft (rSPR) Distance and Hybridization Number. - Kohei Yamada; Zhi-Zhong Chen; Lusheng Wang 001 (J. Comput. Biol., 2020)

Faster Exact Computation of rSPR Distance via Better Approximation. - Zhi-Zhong Chen; Youta Harada; Yuna Nakamura; Lusheng Wang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2020)

Approximation Algorithms for the Directed Path Partition Problems. - Yong Chen 002; Zhi-Zhong Chen; Curtis Kennedy; Guohui Lin; Yao Xu; An Zhang 001 (IJTCS-FAW, 2021)

Approximation Algorithms for Maximally Balanced Connected Graph Partition. - Yong Chen 002; Zhi-Zhong Chen; Guohui Lin; Yao Xu; An Zhang 001 (Algorithmica, 2021)

A randomized approximation algorithm for metric triangle packing. - Yong Chen 002; Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001; An Zhang 001 (J. Comb. Optim., 2021)

Identifying duplications and lateral gene transfers simultaneously and rapidly. - Zhi-Zhong Chen; Fei Deng; Lusheng Wang 001 (J. Bioinform. Comput. Biol., 2022)

Approximation algorithms for the maximally balanced connected graph tripartition problem. - Guangting Chen; Yong Chen 002; Zhi-Zhong Chen; Guohui Lin; Tian Liu 001; An Zhang 001 (J. Comb. Optim., 2022)

An Approximation Algorithm for Covering Vertices by 4+-Paths. - Mingyang Gong; Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001 (COCOA (1), 2023)

An Approximation Algorithm for Covering Vertices by 4^+-Paths. - Mingyang Gong; Zhi-Zhong Chen; Guohui Lin; Zhaohui Zhan (CoRR, 2023)

Randomized algorithms for fully online multiprocessor scheduling with testing. - Mingyang Gong; Zhi-Zhong Chen; Guohui Lin (CoRR, 2023)

Approximating the directed path partition problem. - Yong Chen 002; Zhi-Zhong Chen; Curtis Kennedy; Guohui Lin; Yao Xu; An Zhang 001 (Inf. Comput., 2024)

Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time. - Mingyang Gong; Zhi-Zhong Chen; Kuniteru Hayashi (Algorithmica, 2024)

Path cover using only short paths. - Mingyang Gong; Guangting Chen; Zhi-Zhong Chen; Guohui Lin; Riki Uchida (Theor. Comput. Sci., 2025)

An improved approximation algorithm for covering vertices by 4+-paths. - Mingyang Gong; Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001 (J. Comb. Optim., 2025)

Approximately covering vertices by order-5 or longer paths. - Mingyang Gong; Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001 (J. Comput. Syst. Sci., 2026)