dblp.uni-trier.dewww.uni-trier.de

Zhi-Zhong Chen

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
79EEZhi-Zhong Chen, Ruka Tanahashi: Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement. AAIM 2008: 84-96
78EEZhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang: An Improved Randomized Approximation Algorithm for Maximum Triangle Packing. AAIM 2008: 97-108
77EEZhipeng Cai, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang: An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem. COCOA 2008: 286-295
76EEZhi-Zhong Chen: Approximation Algorithms for Bounded Degree Phylogenetic Roots. Algorithmica 51(1): 1-23 (2008)
75EEZhi-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)
74EEZhi-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)
2007
73EEZhi-Zhong Chen, Ruka Tanahashi: An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs. AAIM 2007: 27-36
72EELusheng Wang, Zhanyong Wang, Zhi-Zhong Chen: Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. COCOON 2007: 493-503
71EEZhi-Zhong Chen, Takayuki Nagoya: Improved approximation algorithms for metric MaxTSP. J. Comb. Optim. 13(4): 321-336 (2007)
70EEZhi-Zhong Chen: New bounds on the edge number of a k-map graph. Journal of Graph Theory 55(4): 267-290 (2007)
69EEZhi-Zhong Chen, Xiaotie Deng, Ding-Zhu Du: Preface. Theor. Comput. Sci. 378(3): 209-210 (2007)
2006
68EEZhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou: Recognizing Hole-Free 4-Map Graphs in Cubic Time. Algorithmica 45(2): 227-262 (2006)
67EEZhi-Zhong Chen, Tatsuie Tsukiji: Computing bounded-degree phylogenetic roots of disconnected graphs. J. Algorithms 59(2): 125-148 (2006)
66EETatsuie Tsukiji, Zhi-Zhong Chen: Computing phylogenetic roots with bounded degrees and errors is NP-complete. Theor. Comput. Sci. 363(1): 43-59 (2006)
2005
65EEZhi-Zhong Chen, Takayuki Nagoya: Improved Approximation Algorithms for Metric Max TSP. ESA 2005: 179-190
64EEZhi-Zhong Chen, Mitsuharu Kouno: A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs. Algorithmica 43(3): 147-177 (2005)
63EEZhi-Zhong Chen, Yuusuke Okamoto, Lusheng Wang: Improved deterministic approximation algorithms for Max TSP. Inf. Process. Lett. 95(2): 333-342 (2005)
62EEGuohui Lin, Theodore Tegos, Zhi-Zhong Chen: Heuristic Search in Constrained Bipartite Matching with Applications to Protein Nmr Backbone Resonance Assignment. J. Bioinformatics and Computational Biology 3(6): 1331-1350 (2005)
61EEZhi-Zhong Chen, Lusheng Wang: An Improved Randomized Approximation Algorithm for Max TSP. J. Comb. Optim. 9(4): 401-432 (2005)
60EEZhi-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. Journal of Computational Biology 12(2): 129-146 (2005)
2004
59EEZhi-Zhong Chen: New Bounds on the Number of Edges in a k-Map Graph. COCOON 2004: 319-328
58EETatsuie Tsukiji, Zhi-Zhong Chen: Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. COCOON 2004: 450-461
57EEZhi-Zhong Chen, Tatsuie Tsukiji: Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. WG 2004: 308-319
56EEZhi-Zhong Chen, Xin He: Disk Embeddings of Planar Graphs. Algorithmica 38(4): 539-576 (2004)
55EEZhi-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)
2003
54EEYong 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
53EEZhi-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
52EEZhi-Zhong Chen, Mitsuharu Kouno: A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs. MFCS 2003: 348-357
51EEGuohui Lin, Dong Xu, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen, Ying Xu: Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering. J. Bioinformatics and Computational Biology 1(2): 387-410 (2003)
50EEZhi-Zhong Chen, Xin He, Ming-Yang Kao: Common-Face Embeddings of Planar Graphs. SIAM J. Comput. 32(2): 408-434 (2003)
49EEZhi-Zhong Chen, Tao Jiang, Guohui Lin: Computing Phylogenetic Roots with Bounded Degrees and Errors. SIAM J. Comput. 32(4): 864-879 (2003)
48EEZhi-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. 1-3(299): 211-229 (2003)
2002
47EEGuo-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
46EEZhi-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
45EEZhi-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)
44EEZhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou: Map graphs. J. ACM 49(2): 127-138 (2002)
43EEGuo-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)
42EEZhi-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)
2001
41EEGuo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen: The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. ICALP 2001: 444-455
40EEZhi-Zhong Chen, Tao Jiang, Guo-Hui Lin: Computing Phylogenetic Roots with Bounded Degrees and Errors. WADS 2001: 377-388
39EEZhi-Zhong Chen, Xin He, Ming-Yang Kao: Common-Face Embeddings of Planar Graphs CoRR cs.DS/0102007: (2001)
38EEZhi-Zhong Chen: Approximating Unweighted Connectivity Problems in Parallel. Inf. Comput. 171(2): 125-136 (2001)
37 Zhi-Zhong Chen: Approximation Algorithms for Independent Sets in Map Graphs. J. Algorithms 41(1): 20-40 (2001)
2000
36EEZhi-Zhong Chen: Approximation Algorithms for Independent Sets in Map Graphs. COCOON 2000: 105-114
35EEZhi-Zhong Chen, Xin He: Hierarchical Topological Inference on Planar Disc Maps. COCOON 2000: 115-125
34EERyuhei Uehara, Zhi-Zhong Chen: Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. IFIP TCS 2000: 84-98
33EERyuhei Uehara, Zhi-Zhong Chen: Parallel approximation algorithms for maximum weighted matching in general graphs. Inf. Process. Lett. 76(1-2): 13-17 (2000)
32 Zhi-Zhong Chen, Ming-Yang Kao: Reducing Randomness via Irrational Numbers. SIAM J. Comput. 29(4): 1247-1256 (2000)
31EEZhi-Zhong Chen: Efficient Algorithms for Acyclic Colorings of Graphs. Theor. Comput. Sci. 230(1-2): 75-95 (2000)
1999
30EEZhi-Zhong Chen, Xin He, Chun-Hsi Huang: Finding Double Euler Trails of Planar Graphs in Linear Time. FOCS 1999: 319-329
29EEZhi-Zhong Chen, Xin He, Ming-Yang Kao: Nonplanar Topological Inference and Political-Map Graphs. SODA 1999: 195-204
28EEZhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou: Map Graphs CoRR cs.DM/9910013: (1999)
27EEZhi-Zhong Chen, Ming-Yang Kao: Reducing Randomness via Irrational Numbers CoRR cs.DS/9907011: (1999)
26 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)
25EERyuhei Uehara, Zhi-Zhong Chen, Xin He: Fast RNC and NC Algorithms for Maximal Path Sets. Theor. Comput. Sci. 215(1-2): 89-98 (1999)
1998
24EEZhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou: Planar Map Graphs. STOC 1998: 514-523
23 Zhi-Zhong Chen: Efficient Approximation Schemes for Maximization Problems on K3, 3-Free Graphs. J. Algorithms 26(1): 166-187 (1998)
1997
22 Zhi-Zhong Chen: Approximating Unweighted Connectivity Problems in Parallel. ISAAC 1997: 202-211
21 Xin He, Zhi-Zhong Chen: Shortest Path in Complete Bipartite Digraph Problem and its Applications. SODA 1997: 230-238
20EEZhi-Zhong Chen, Ming-Yang Kao: Reducing Randomness via Irrational Numbers. STOC 1997: 200-209
19 Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou: Panarity, Revisited (Extended Abstract). WADS 1997: 472-473
18 Zhi-Zhong Chen, Xin He: Parallel Algorithms for Maximal Acyclic Sets. Algorithmica 19(3): 354-368 (1997)
1996
17 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
16 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
15EEZhi-Zhong Chen, Xin He: Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests. Discrete Applied Mathematics 69(1-2): 183-198 (1996)
14EEZhi-Zhong Chen: Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings. Theor. Comput. Sci. 161(1&2): 1-21 (1996)
1995
13 Zhi-Zhong Chen: NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings. ICALP 1995: 99-110
12 Zhi-Zhong Chen: NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application. ISAAC 1995: 428-437
11 Zhi-Zhong Chen, Xin He: NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. WG 1995: 275-289
10 Zhi-Zhong Chen, Seinosuke Toda: The Complexity of Selecting Maximal Solutions Inf. Comput. 119(2): 231-239 (1995)
9EEZhi-Zhong Chen: A Fast and Efficient NC Algorithm for Maximal Matching. Inf. Process. Lett. 55(6): 303-307 (1995)
8EEZhi-Zhong Chen: The Maximal f-Dependent Set Problem for Planar Graphs is in NC. Theor. Comput. Sci. 143(2): 309-318 (1995)
1994
7 Zhi-Zhong Chen: The Maximal f-Dependent Set Problem for Planar Graphs is in NC. WG 1994: 232-241
6 Zhi-Zhong Chen: A Parallel Algorithm for Finding a Triconnected Component Separator with an Application. Inf. Process. Lett. 52(5): 265-271 (1994)
1993
5 Zhi-Zhong Chen, Seinosuke Toda: The Complexity of Selecting Maximal Solutions. Structure in Complexity Theory Conference 1993: 313-325
1992
4 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)
3 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
2 Zhi-Zhong Chen: A Randomized NC Algorithm for the Maximal Tree Cover Problem. Inf. Process. Lett. 40(5): 241-246 (1991)
1 Zhi-Zhong Chen, Seinosuke Toda: On the Complexity of Computing Optimal Solutions. Int. J. Found. Comput. Sci. 2(3): 207-220 (1991)

Coauthor Index

1Zhipeng Cai [77]
2Xiaotie Deng [69]
3Ding-Zhu Du [69]
4Ze Feng [74]
5Yong Gao [54] [55]
6Michelangelo Grigni [19] [24] [28] [44] [68]
7Xin He [11] [15] [17] [18] [21] [25] [26] [29] [30] [35] [39] [42] [50] [56]
8Chun-Hsi Huang [30] [42]
9Tao Jiang [40] [41] [43] [46] [47] [48] [49] [51] [53] [60]
10Ming-Yang Kao [20] [27] [29] [32] [39] [50]
11Mitsuharu Kouno [52] [64]
12Minming Li [74]
13Guohui Lin (Guo-Hui Lin) [40] [41] [43] [46] [47] [48] [49] [51] [53] [54] [55] [60] [62] [77]
14Takayuki Nagoya [65] [71]
15Robert Niewiadomski [54] [55]
16Yuusuke Okamoto [63]
17Christos H. Papadimitriou [19] [24] [28] [44] [68]
18Romeo Rizzi [53] [60]
19Ruka Tanahashi [73] [75] [78] [79]
20Theodore Tegos [62]
21Seinosuke Toda [1] [5] [10]
22Tatsuie Tsukiji [57] [58] [66] [67]
23Ryuhei Uehara [17] [25] [33] [34]
24Lusheng Wang [61] [63] [72] [75] [77] [78]
25Yang Wang [54] [55]
26Zhanyong Wang [72]
27Jianjun Wen [41] [43] [46] [47] [48] [51] [53] [60]
28Junfeng Wu [54] [55]
29Dong Xu [46] [47] [48] [51] [53] [60]
30Jinbo Xu [48]
31Ying Xu [46] [47] [48] [51] [53] [60]
32F. Frances Yao (Frances F. Yao, Foong Frances Yao) [74]
33Shiqing Zhang [45]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)