default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhi-Zhong Chen
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j85]Mingyang Gong
, Zhi-Zhong Chen, Kuniteru Hayashi:
Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time. Algorithmica 86(5): 1400-1427 (2024)- [j84]Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang:
Approximating the directed path partition problem. Inf. Comput. 297: 105150 (2024) - [i13]Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
Approximately covering vertices by order-5 or longer paths. CoRR abs/2408.11225 (2024) - 2023
- [c55]Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
An Approximation Algorithm for Covering Vertices by 4+-Paths. COCOA (1) 2023: 459-470 - [i12]Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Zhaohui Zhan:
An Approximation Algorithm for Covering Vertices by 4^+-Paths. CoRR abs/2304.12779 (2023) - [i11]Mingyang Gong, Zhi-Zhong Chen, Guohui Lin:
Randomized algorithms for fully online multiprocessor scheduling with testing. CoRR abs/2305.01605 (2023) - 2022
- [j83]Zhi-Zhong Chen, Fei Deng, Lusheng Wang:
Identifying duplications and lateral gene transfers simultaneously and rapidly. J. Bioinform. Comput. Biol. 20(1): 2150033:1-2150033:26 (2022) - [j82]Guangting Chen, Yong Chen, Zhi-Zhong Chen, Guohui Lin, Tian Liu, An Zhang:
Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim. 44(3): 1753-1773 (2022) - 2021
- [j81]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang:
Approximation Algorithms for Maximally Balanced Connected Graph Partition. Algorithmica 83(12): 3715-3740 (2021) - [j80]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang:
A randomized approximation algorithm for metric triangle packing. J. Comb. Optim. 41(1): 12-27 (2021) - [c54]Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang:
Approximation Algorithms for the Directed Path Partition Problems. IJTCS-FAW 2021: 23-36 - [i10]Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin, Yao Xu, An Zhang:
Approximation algorithms for the directed path partition problems. CoRR abs/2107.04699 (2021) - 2020
- [j79]An Zhang, Yong Chen, Zhi-Zhong Chen, Guohui Lin:
Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs. Algorithmica 82(10): 3041-3064 (2020) - [j78]Zhi-Zhong Chen, Shohei Ueta, Jingyu Li, Lusheng Wang:
Computing a Consensus Phylogeny via Leaf Removal. J. Comput. Biol. 27(2): 175-188 (2020) - [j77]Kohei Yamada, Zhi-Zhong Chen, Lusheng Wang:
Improved Practical Algorithms for Rooted Subtree Prune and Regraft (rSPR) Distance and Hybridization Number. J. Comput. Biol. 27(9): 1422-1432 (2020) - [j76]Zhi-Zhong Chen, Youta Harada, Yuna Nakamura, Lusheng Wang:
Faster Exact Computation of rSPR Distance via Better Approximation. IEEE ACM Trans. Comput. Biol. Bioinform. 17(3): 916-929 (2020)
2010 – 2019
- 2019
- [j75]Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang:
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. Algorithmica 81(11-12): 4167-4199 (2019) - [j74]Shota Yuasa, Zhi-Zhong Chen, Bin Ma, Lusheng Wang:
Designing and implementing algorithms for the closest string problem. Theor. Comput. Sci. 786: 32-43 (2019) - [c53]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, An Zhang:
A Randomized Approximation Algorithm for Metric Triangle Packing. COCOA 2019: 119-129 - [c52]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang:
Approximation Algorithms for Maximally Balanced Connected Graph Partition. COCOA 2019: 130-141 - [c51]Zhi-Zhong Chen, Shohei Ueta, Jingyu Li, Lusheng Wang:
Computing a Consensus Phylogeny via Leaf Removal. ISBRA 2019: 3-15 - [c50]Kohei Yamada, Zhi-Zhong Chen, Lusheng Wang:
Better Practical Algorithms for rSPR Distance and Hybridization Number. WABI 2019: 5:1-5:12 - [i9]Yong Chen, Zhi-Zhong Chen, Guohui Lin, Yao Xu, An Zhang:
Approximation algorithms for maximally balanced connected graph partition. CoRR abs/1910.02470 (2019) - 2018
- [j73]Maryam Etemadi, Mehri Bagherian, Zhi-Zhong Chen, Lusheng Wang:
Better ILP models for haplotype assembly. BMC Bioinform. 19-S(1): 11-21 (2018) - [j72]Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang:
An approximation algorithm for maximum internal spanning tree. J. Comb. Optim. 35(3): 955-979 (2018) - [j71]Zhi-Zhong Chen, Qilong Feng, Chao Shen, Jianxin Wang, Lusheng Wang:
Algorithms for Pedigree Comparison. IEEE ACM Trans. Comput. Biol. Bioinform. 15(2): 422-431 (2018) - [j70]Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang:
Approximation algorithms for the scaffolding problem and its generalizations. Theor. Comput. Sci. 734: 131-141 (2018) - [c49]Zhi-Zhong Chen, Shohei Ueta, Jingyu Li, Lusheng Wang:
Finding a Center Tree of Phylogenetic Trees via Leaf Removal. BIBM 2018: 61-64 - [i8]An Zhang, Yong Chen, Zhi-Zhong Chen, Guohui Lin:
Improved approximation algorithms for path vertex covers in regular graphs. CoRR abs/1811.01162 (2018) - 2017
- [c48]Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang:
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. COCOON 2017: 124-136 - [c47]Shota Yuasa, Zhi-Zhong Chen, Bin Ma, Lusheng Wang:
Designing and Implementing Algorithms for the Closest String Problem. FAW 2017: 79-90 - [c46]Zhi-Zhong Chen, Youta Harada, Lusheng Wang:
A New 2-Approximation Algorithm for rSPR Distance. ISBRA 2017: 128-139 - [c45]Zhi-Zhong Chen, Youta Harada, Fei Guo, Lusheng Wang:
An Approximation Algorithm for Maximum Internal Spanning Tree. WALCOM 2017: 385-396 - 2016
- [j69]Zhi-Zhong Chen, Bin Ma, Lusheng Wang:
Randomized Fixed-Parameter Algorithms for the Closest String Problem. Algorithmica 74(1): 466-484 (2016) - [j68]Takeo Hagiwara, Tatsuie Tsukiji, Zhi-Zhong Chen:
Computational Complexity of Predicting Periodicity in the Models of Lorentz Lattice Gas Cellular Automata. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1034-1049 (2016) - [j67]Zhi-Zhong Chen, Tatsuie Tsukiji, Hiroki Yamada:
Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 99-A(6): 1050-1058 (2016) - [j66]Zhi-Zhong Chen, Fei Deng, Chao Shen, Yiji Wang, Lusheng Wang:
Better ILP-Based Approaches to Haplotype Assembly. J. Comput. Biol. 23(7): 537-552 (2016) - [c44]Zhi-Zhong Chen, Eita Machida, Lusheng Wang:
An Improved Approximation Algorithm for rSPR Distance. COCOON 2016: 468-479 - [c43]Zhi-Zhong Chen, Youta Harada, Eita Machida, Fei Guo, Lusheng Wang:
Better Approximation Algorithms for Scaffolding Problems. FAW 2016: 17-28 - [i7]Zhi-Zhong Chen, Youta Harada, Lusheng Wang:
An Approximation Algorithm for Maximum Internal Spanning Tree. CoRR abs/1608.00196 (2016) - [i6]Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen:
Approximation algorithms for the maximum weight internal spanning tree problem. CoRR abs/1608.03299 (2016) - [i5]Zhi-Zhong Chen, Eita Machida, Lusheng Wang:
A Cubic-Time 2-Approximation Algorithm for rSPR Distance. CoRR abs/1609.04029 (2016) - 2015
- [j65]Zhi-Zhong Chen, Ying Fan, Lusheng Wang:
Faster exact computation of rSPR distance. J. Comb. Optim. 29(3): 605-635 (2015) - 2014
- [j64]Zhi-Zhong Chen, Wenji Ma, Lusheng Wang:
The Parameterized Complexity of the Shared Center Problem. Algorithmica 69(2): 269-293 (2014) - [j63]Zhi-Zhong Chen, Ying Fan, Lusheng Wang:
Parameterized and approximation algorithms for finding two disjoint matchings. Theor. Comput. Sci. 556: 85-93 (2014) - [c42]Zhi-Zhong Chen, Bin Ma, Lusheng Wang:
Randomized and Parameterized Algorithms for the Closest String Problem. CPM 2014: 100-109 - 2013
- [j62]Zhi-Zhong Chen, Fei Deng, Lusheng Wang:
Exact algorithms for haplotype assembly from whole-genome sequence data. Bioinform. 29(16): 1938-1945 (2013) - [j61]Zhi-Zhong Chen, Lusheng Wang:
An Ultrafast Tool for Minimum Reticulate Networks. J. Comput. Biol. 20(1): 38-41 (2013) - [c41]Zhi-Zhong Chen, Lusheng Wang:
Faster Exact Computation of rSPR Distance. FAW-AAIM 2013: 36-47 - [c40]Zhi-Zhong Chen, Fei Deng, Lusheng Wang:
Identifying duplications and lateral gene transfers simultaneously and rapidly. CIBCB 2013: 128-135 - [c39]Zhi-Zhong Chen, Ying Fan, Lusheng Wang:
Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings. COCOA 2013: 1-12 - [i4]Weitian Tong, Zhi-Zhong Chen, Lusheng Wang, Yinfeng Xu, Jiuping Xu, Randy Goebel, Guohui Lin:
An approximation algorithm for the Bandpass-2 problem. CoRR abs/1307.7089 (2013) - 2012
- [j60]Zhi-Zhong Chen, Lusheng Wang, Satoshi Yamanaka:
A fast tool for minimum hybridization networks. BMC Bioinform. 13: 155 (2012) - [j59]Zhi-Zhong Chen, Bin Ma, Lusheng Wang:
A three-string approach to the closest string problem. J. Comput. Syst. Sci. 78(1): 164-178 (2012) - [j58]Zhi-Zhong Chen, Lusheng Wang:
Algorithms for Reticulate Networks of Multiple Phylogenetic Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 9(2): 372-384 (2012) - [j57]Wenji Ma, Yong Yang, Zhi-Zhong Chen, Lusheng Wang:
Mutation Region Detection for Closely Related Individuals without a Known Pedigree. IEEE ACM Trans. Comput. Biol. Bioinform. 9(2): 499-510 (2012) - [j56]Zhi-Zhong Chen, Fei Deng, Lusheng Wang:
Simultaneous Identification of Duplications, Losses, and Lateral Gene Transfers. IEEE ACM Trans. Comput. Biol. Bioinform. 9(5): 1515-1528 (2012) - [c38]Zhi-Zhong Chen, Lusheng Wang:
An Improved Approximation Algorithm for the Bandpass-2 Problem. COCOA 2012: 188-199 - [c37]Zhi-Zhong Chen, Lusheng Wang, Wenji Ma:
The Parameterized Complexity of the Shared Center Problem. CPM 2012: 439-452 - 2011
- [j55]Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
An Approximation Algorithm for the Minimum Co-Path Set Problem. Algorithmica 60(4): 969-986 (2011) - [j54]Zhi-Zhong Chen, Lusheng Wang:
Fast Exact Algorithms for the Closest String and Substring Problems with Application to the Planted (L, d)-Motif Model. IEEE ACM Trans. Comput. Biol. Bioinform. 8(5): 1400-1410 (2011) - 2010
- [j53]Zhi-Zhong Chen, Lusheng Wang:
HybridNET: a tool for constructing hybridization networks. Bioinform. 26(22): 2912-2913 (2010) - [j52]Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang:
Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646]. Discret. Appl. Math. 158(9): 1045-1047 (2010) - [j51]Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita:
Approximating maximum edge 2-coloring in simple graphs. Discret. Appl. Math. 158(17): 1894-1901 (2010) - [j50]Ruka Tanahashi, Zhi-Zhong Chen:
A Deterministic Approximation Algorithm for Maximum 2-Path Packing. IEICE Trans. Inf. Syst. 93-D(2): 241-249 (2010) - [c36]Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita:
Approximating Maximum Edge 2-Coloring in Simple Graphs. AAIM 2010: 78-89 - [c35]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 - [c34]Zhi-Zhong Chen, Bin Ma, Lusheng Wang:
A Three-String Approach to the Closest String Problem. COCOON 2010: 449-458
2000 – 2009
- 2009
- [j49]Zhi-Zhong Chen, Lusheng Wang, Zhanyong Wang:
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. Algorithmica 54(4): 501-529 (2009) - [j48]Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang:
An improved randomized approximation algorithm for maximum triangle packing. Discret. Appl. Math. 157(7): 1640-1646 (2009) - [j47]Zhi-Zhong Chen, Lusheng Wang:
Improved Approximation Algorithms for Reconstructing the History of Tandem Repeats. IEEE ACM Trans. Comput. Biol. Bioinform. 6(3): 438-453 (2009) - [j46]Zhi-Zhong Chen, Ruka Tanahashi:
Approximating maximum edge 2-coloring in simple graphs via local improvement. Theor. Comput. Sci. 410(45): 4543-4553 (2009) - [j45]Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin:
A 3.4713-approximation algorithm for the capacitated multicast tree routing problem. Theor. Comput. Sci. 410(52): 5415-5424 (2009) - 2008
- [j44]Zhi-Zhong Chen:
Approximation Algorithms for Bounded Degree Phylogenetic Roots. Algorithmica 51(1): 1-23 (2008) - [j43]Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang:
An improved approximation algorithm for maximum edge 2-coloring in simple graphs. J. Discrete Algorithms 6(2): 205-215 (2008) - [j42]Zhi-Zhong Chen, Ze Feng, Minming Li, F. Frances Yao:
Optimizing deletion cost for secure multicast key management. Theor. Comput. Sci. 401(1-3): 52-61 (2008) - [c33]Zhi-Zhong Chen, Ruka Tanahashi:
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement. AAIM 2008: 84-96 - [c32]Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang:
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing. AAIM 2008: 97-108 - [c31]Zhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem. COCOA 2008: 286-295 - 2007
- [j41]Zhi-Zhong Chen, Takayuki Nagoya:
Improved approximation algorithms for metric MaxTSP. J. Comb. Optim. 13(4): 321-336 (2007) - [j40]Zhi-Zhong Chen:
New bounds on the edge number of a k-map graph. J. Graph Theory 55(4): 267-290 (2007) - [j39]Zhi-Zhong Chen, Xiaotie Deng, Ding-Zhu Du:
Preface. Theor. Comput. Sci. 378(3): 209-210 (2007) - [c30]Zhi-Zhong Chen, Ruka Tanahashi:
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs. AAIM 2007: 27-36 - [c29]Lusheng Wang, Zhanyong Wang, Zhi-Zhong Chen:
Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. COCOON 2007: 493-503 - 2006
- [j38]Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Recognizing Hole-Free 4-Map Graphs in Cubic Time. Algorithmica 45(2): 227-262 (2006) - [j37]Zhi-Zhong Chen, Tatsuie Tsukiji:
Computing bounded-degree phylogenetic roots of disconnected graphs. J. Algorithms 59(2): 125-148 (2006) - [j36]Tatsuie Tsukiji, Zhi-Zhong Chen:
Computing phylogenetic roots with bounded degrees and errors is NP-complete. Theor. Comput. Sci. 363(1): 43-59 (2006) - 2005
- [j35]Zhi-Zhong Chen, Mitsuharu Kouno:
A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs. Algorithmica 43(3): 147-177 (2005) - [j34]Zhi-Zhong Chen, Yuusuke Okamoto, Lusheng Wang:
Improved deterministic approximation algorithms for Max TSP. Inf. Process. Lett. 95(2): 333-342 (2005) - [j33]Guohui Lin, Theodore Tegos, Zhi-Zhong Chen:
Heuristic Search in Constrained Bipartite Matching with Applications to Protein Nmr Backbone Resonance Assignment. J. Bioinform. Comput. Biol. 3(6): 1331-1350 (2005) - [j32]Zhi-Zhong Chen, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu, Tao Jiang:
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. J. Comput. Biol. 12(2): 129-146 (2005) - [j31]Zhi-Zhong Chen, Lusheng Wang:
An Improved Randomized Approximation Algorithm for Max TSP. J. Comb. Optim. 9(4): 401-432 (2005) - [c28]Zhi-Zhong Chen, Takayuki Nagoya:
Improved Approximation Algorithms for Metric Max TSP. ESA 2005: 179-190 - 2004
- [j30]Zhi-Zhong Chen, Xin He:
Disk Embeddings of Planar Graphs. Algorithmica 38(4): 539-576 (2004) - [j29]Zhi-Zhong Chen, Yong Gao, Guohui Lin, Robert Niewiadomski, Yang Wang, Junfeng Wu:
A space-efficient algorithm for sequence alignment with inversions and reversals. Theor. Comput. Sci. 325(3): 361-372 (2004) - [c27]Zhi-Zhong Chen:
New Bounds on the Number of Edges in a k-Map Graph. COCOON 2004: 319-328 - [c26]Tatsuie Tsukiji, Zhi-Zhong Chen:
Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. COCOON 2004: 450-461 - [c25]Zhi-Zhong Chen, Tatsuie Tsukiji:
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. WG 2004: 308-319 - 2003
- [j28]Guohui Lin, Dong Xu, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen, Ying Xu:
Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering. J. Bioinform. Comput. Biol. 1(2): 387-410 (2003) - [j27]Zhi-Zhong Chen, Xin He, Ming-Yang Kao:
Common-Face Embeddings of Planar Graphs. SIAM J. Comput. 32(2): 408-434 (2003) - [j26]Zhi-Zhong Chen, Tao Jiang, Guohui Lin:
Computing Phylogenetic Roots with Bounded Degrees and Errors. SIAM J. Comput. 32(4): 864-879 (2003) - [j25]Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin, Jianjun Wen, Dong Xu, Jinbo Xu, Ying Xu:
Approximation algorithms for NMR spectral peak assignment. Theor. Comput. Sci. 299(1-3): 211-229 (2003) - [c24]Yong Gao, Junfeng Wu, Robert Niewiadomski, Yang Wang, Zhi-Zhong Chen, Guohui Lin:
A Space Efficient Algorithm for Sequence Alignment with Inversions. COCOON 2003: 57-67 - [c23]Zhi-Zhong Chen, Tao Jiang, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu:
More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. ESA 2003: 580-592 - [c22]Zhi-Zhong Chen, Mitsuharu Kouno:
A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs. MFCS 2003: 348-357 - 2002
- [j24]Zhi-Zhong Chen, Shiqing Zhang:
Tight upper bound on the number of edges in a bipartite K3, 3-free or K5-free graph with an application. Inf. Process. Lett. 84(3): 141-145 (2002) - [j23]Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Map graphs. J. ACM 49(2): 127-138 (2002) - [j22]Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen:
The longest common subsequence problem for sequences with nested arc annotations. J. Comput. Syst. Sci. 65(3): 465-480 (2002) - [j21]Zhi-Zhong Chen, Xin He, Chun-Hsi Huang:
Finding Double Euler Trails of Planar Graphs in Linear Time. SIAM J. Comput. 31(4): 1255-1285 (2002) - [c21]Guo-Hui Lin, Dong Xu, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen, Ying Xu:
An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks. CSB 2002: 165-174 - [c20]Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin, Jianjun Wen, Dong Xu, Ying Xu:
Improved Approximation Algorithms for NMR Spectral Peak Assignment. WABI 2002: 82-96 - 2001
- [j20]Zhi-Zhong Chen:
Approximating Unweighted Connectivity Problems in Parallel. Inf. Comput. 171(2): 125-136 (2001) - [j19]Zhi-Zhong Chen:
Approximation Algorithms for Independent Sets in Map Graphs. J. Algorithms 41(1): 20-40 (2001) - [c19]Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen:
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. ICALP 2001: 444-455 - [c18]Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin:
Computing Phylogenetic Roots with Bounded Degrees and Errors. WADS 2001: 377-388 - [i3]Zhi-Zhong Chen, Xin He, Ming-Yang Kao:
Common-Face Embeddings of Planar Graphs. CoRR cs.DS/0102007 (2001) - 2000
- [j18]Ryuhei Uehara, Zhi-Zhong Chen:
Parallel approximation algorithms for maximum weighted matching in general graphs. Inf. Process. Lett. 76(1-2): 13-17 (2000) - [j17]Zhi-Zhong Chen, Ming-Yang Kao:
Reducing Randomness via Irrational Numbers. SIAM J. Comput. 29(4): 1247-1256 (2000) - [j16]Zhi-Zhong Chen:
Efficient Algorithms for Acyclic Colorings of Graphs. Theor. Comput. Sci. 230(1-2): 75-95 (2000) - [c17]Zhi-Zhong Chen:
Approximation Algorithms for Independent Sets in Map Graphs. COCOON 2000: 105-114 - [c16]Zhi-Zhong Chen, Xin He:
Hierarchical Topological Inference on Planar Disc Maps. COCOON 2000: 115-125 - [c15]Ryuhei Uehara, Zhi-Zhong Chen:
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. IFIP TCS 2000: 84-98
1990 – 1999
- 1999
- [j15]Xin He, Zhi-Zhong Chen:
An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications. SIAM J. Comput. 29(1): 65-80 (1999) - [j14]Ryuhei Uehara, Zhi-Zhong Chen, Xin He:
Fast RNC and NC Algorithms for Maximal Path Sets. Theor. Comput. Sci. 215(1-2): 89-98 (1999) - [c14]Zhi-Zhong Chen, Xin He, Chun-Hsi Huang:
Finding Double Euler Trails of Planar Graphs in Linear Time. FOCS 1999: 319-329 - [c13]Zhi-Zhong Chen, Xin He, Ming-Yang Kao:
Nonplanar Topological Inference and Political-Map Graphs. SODA 1999: 195-204 - [i2]Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Map Graphs. CoRR cs.DM/9910013 (1999) - [i1]Zhi-Zhong Chen, Ming-Yang Kao:
Reducing Randomness via Irrational Numbers. CoRR cs.DS/9907011 (1999) - 1998
- [j13]Zhi-Zhong Chen:
Efficient Approximation Schemes for Maximization Problems on K3,3-free or K5-free Graphs. J. Algorithms 26(1): 166-187 (1998) - [c12]Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Planar Map Graphs. STOC 1998: 514-523 - 1997
- [j12]Zhi-Zhong Chen, Xin He:
Parallel Algorithms for Maximal Acyclic Sets. Algorithmica 19(3): 354-368 (1997) - [c11]Zhi-Zhong Chen:
Approximating Unweighted Connectivity Problems in Parallel. ISAAC 1997: 202-211 - [c10]Xin He, Zhi-Zhong Chen:
Shortest Path in Complete Bipartite Digraph Problem and its Applications. SODA 1997: 230-238 - [c9]Zhi-Zhong Chen, Ming-Yang Kao:
Reducing Randomness via Irrational Numbers. STOC 1997: 200-209 - [c8]Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou:
Panarity, Revisited (Extended Abstract). WADS 1997: 472-473 - 1996
- [j11]Zhi-Zhong Chen, Xin He:
Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests. Discret. Appl. Math. 69(1-2): 183-198 (1996) - [j10]Zhi-Zhong Chen:
Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings. Theor. Comput. Sci. 161(1&2): 1-21 (1996) - [c7]Ryuhei Uehara, Zhi-Zhong Chen, Xin He:
Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. COCOON 1996: 209-218 - [c6]Zhi-Zhong Chen:
Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs. ICALP 1996: 268-279 - 1995
- [j9]Zhi-Zhong Chen, Seinosuke Toda:
The Complexity of Selecting Maximal Solutions. Inf. Comput. 119(2): 231-239 (1995) - [j8]Zhi-Zhong Chen:
A Fast and Efficient NC Algorithm for Maximal Matching. Inf. Process. Lett. 55(6): 303-307 (1995) - [j7]Zhi-Zhong Chen:
The Maximal f-Dependent Set Problem for Planar Graphs is in NC. Theor. Comput. Sci. 143(2): 309-318 (1995) - [c5]Zhi-Zhong Chen:
NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings. ICALP 1995: 99-110 - [c4]Zhi-Zhong Chen:
NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application. ISAAC 1995: 428-437 - [c3]Zhi-Zhong Chen, Xin He:
NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. WG 1995: 275-289 - 1994
- [j6]Zhi-Zhong Chen:
A Parallel Algorithm for Finding a Triconnected Component Separator with an Application. Inf. Process. Lett. 52(5): 265-271 (1994) - [c2]Zhi-Zhong Chen:
The Maximal f-Dependent Set Problem for Planar Graphs is in NC. WG 1994: 232-241 - 1993
- [c1]Zhi-Zhong Chen, Seinosuke Toda:
The Complexity of Selecting Maximal Solutions. SCT 1993: 313-325 - 1992
- [j5]Zhi-Zhong Chen:
A Simple Parallel Algorithm for Computing the Diameters of all Vertices in a Tree and its Application. Inf. Process. Lett. 42(5): 243-248 (1992) - [j4]Zhi-Zhong Chen:
A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. Inf. Process. Lett. 43(4): 191-193 (1992) - 1991
- [j3]Zhi-Zhong Chen, Seinosuke Toda:
On the Complexity of Computing Optimal Solutions. Int. J. Found. Comput. Sci. 2(3): 207-220 (1991) - [j2]Zhi-Zhong Chen:
A Randomized NC Algorithm for the Maximal Tree Cover Problem. Inf. Process. Lett. 40(5): 241-246 (1991)
1980 – 1989
- 1989
- [j1]Zhi-Zhong Chen, Takumi Kasai:
Probabilistic automata push-down. Syst. Comput. Jpn. 20(6): 11-20 (1989)
Coauthor Index
Guohui Lin
aka: Guo-Hui Lin
aka: Guo-Hui Lin
[i13] [c55] [j83] [j80] [j78] [j77] [j76] [j75] [j74] [c53] [c51] [c50] [j73] [j72] [j71] [j70] [c49] [c48] [c47] [c46] [c45] [j69] [j66] [c44] [c43] [i7] [i6] [i5] [j65] [j64] [j63] [c42] [j62] [j61] [c41] [c40] [c39] [i4] [j60] [j59] [j58] [j57] [j56] [c38] [c37] [j55] [j54] [j53] [j52] [c35] [c34] [j49] [j48] [j47] [j43] [c32] [c31] [c29] [j34] [j31]
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 2024-10-07 21:16 CEST 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:
