The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Zhi-Zhong Chen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zhi-Zhong Chen, Seinosuke Toda
    The Complexity of Selecting Maximal Solutions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:313-325 [Conf]
  2. Zhi-Zhong Chen
    Approximation Algorithms for Independent Sets in Map Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:105-114 [Conf]
  3. Zhi-Zhong Chen
    New Bounds on the Number of Edges in a k-Map Graph. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:319-328 [Conf]
  4. Zhi-Zhong Chen, Xin He
    Hierarchical Topological Inference on Planar Disc Maps. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:115-125 [Conf]
  5. Yong Gao, Junfeng Wu, Robert Niewiadomski, Yang Wang, Zhi-Zhong Chen, Guohui Lin
    A Space Efficient Algorithm for Sequence Alignment with Inversions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:57-67 [Conf]
  6. Tatsuie Tsukiji, Zhi-Zhong Chen
    Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard. [Citation Graph (0, 0)][DBLP]
    COCOON, 2004, pp:450-461 [Conf]
  7. Ryuhei Uehara, Zhi-Zhong Chen, Xin He
    Fast RNC and NC Algorithms for Finding a Maximal Set of Paths with an Application. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:209-218 [Conf]
  8. 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. [Citation Graph (0, 0)][DBLP]
    CSB, 2002, pp:165-174 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:580-592 [Conf]
  10. Zhi-Zhong Chen, Takayuki Nagoya
    Improved Approximation Algorithms for Metric Max TSP. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:179-190 [Conf]
  11. Zhi-Zhong Chen, Xin He, Chun-Hsi Huang
    Finding Double Euler Trails of Planar Graphs in Linear Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:319-329 [Conf]
  12. Zhi-Zhong Chen
    NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:99-110 [Conf]
  13. Zhi-Zhong Chen
    Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:268-279 [Conf]
  14. Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen
    The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:444-455 [Conf]
  15. Ryuhei Uehara, Zhi-Zhong Chen
    Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:84-98 [Conf]
  16. Zhi-Zhong Chen
    NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:428-437 [Conf]
  17. Zhi-Zhong Chen
    Approximating Unweighted Connectivity Problems in Parallel. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1997, pp:202-211 [Conf]
  18. Zhi-Zhong Chen, Mitsuharu Kouno
    A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:348-357 [Conf]
  19. Xin He, Zhi-Zhong Chen
    Shortest Path in Complete Bipartite Digraph Problem and its Applications. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:230-238 [Conf]
  20. Zhi-Zhong Chen, Xin He, Ming-Yang Kao
    Nonplanar Topological Inference and Political-Map Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:195-204 [Conf]
  21. Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
    Planar Map Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:514-523 [Conf]
  22. Zhi-Zhong Chen, Ming-Yang Kao
    Reducing Randomness via Irrational Numbers. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:200-209 [Conf]
  23. Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin, Jianjun Wen, Dong Xu, Ying Xu
    Improved Approximation Algorithms for NMR Spectral Peak Assignment. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:82-96 [Conf]
  24. Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
    Panarity, Revisited (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:472-473 [Conf]
  25. Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin
    Computing Phylogenetic Roots with Bounded Degrees and Errors. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:377-388 [Conf]
  26. Zhi-Zhong Chen
    The Maximal f-Dependent Set Problem for Planar Graphs is in NC. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:232-241 [Conf]
  27. Zhi-Zhong Chen, Xin He
    NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:275-289 [Conf]
  28. Zhi-Zhong Chen, Tatsuie Tsukiji
    Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:308-319 [Conf]
  29. Zhi-Zhong Chen, Xin He
    Disk Embeddings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:38, n:4, pp:539-576 [Journal]
  30. Zhi-Zhong Chen, Xin He
    Parallel Algorithms for Maximal Acyclic Sets. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:3, pp:354-368 [Journal]
  31. Zhi-Zhong Chen, Mitsuharu Kouno
    A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:3, pp:147-177 [Journal]
  32. Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
    Recognizing Hole-Free 4-Map Graphs in Cubic Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:2, pp:227-262 [Journal]
  33. Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
    Map Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  34. Zhi-Zhong Chen, Xin He, Ming-Yang Kao
    Common-Face Embeddings of Planar Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  35. Zhi-Zhong Chen, Ming-Yang Kao
    Reducing Randomness via Irrational Numbers [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  36. Zhi-Zhong Chen, Xin He
    Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:69, n:1-2, pp:183-198 [Journal]
  37. Zhi-Zhong Chen
    Approximating Unweighted Connectivity Problems in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:171, n:2, pp:125-136 [Journal]
  38. Zhi-Zhong Chen, Seinosuke Toda
    The Complexity of Selecting Maximal Solutions [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:119, n:2, pp:231-239 [Journal]
  39. Zhi-Zhong Chen, Seinosuke Toda
    On the Complexity of Computing Optimal Solutions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:3, pp:207-220 [Journal]
  40. Zhi-Zhong Chen
    A Randomized NC Algorithm for the Maximal Tree Cover Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:5, pp:241-246 [Journal]
  41. Zhi-Zhong Chen
    A Simple Parallel Algorithm for Computing the Diameters of all Vertices in a Tree and its Application. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:5, pp:243-248 [Journal]
  42. Zhi-Zhong Chen
    A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:4, pp:191-193 [Journal]
  43. Zhi-Zhong Chen
    A Parallel Algorithm for Finding a Triconnected Component Separator with an Application. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:5, pp:265-271 [Journal]
  44. Zhi-Zhong Chen
    A Fast and Efficient NC Algorithm for Maximal Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:6, pp:303-307 [Journal]
  45. Zhi-Zhong Chen, Yuusuke Okamoto, Lusheng Wang
    Improved deterministic approximation algorithms for Max TSP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:2, pp:333-342 [Journal]
  46. 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. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:141-145 [Journal]
  47. Ryuhei Uehara, Zhi-Zhong Chen
    Parallel approximation algorithms for maximum weighted matching in general graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:13-17 [Journal]
  48. Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
    Map graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:2, pp:127-138 [Journal]
  49. Zhi-Zhong Chen
    Approximation Algorithms for Independent Sets in Map Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:1, pp:20-40 [Journal]
  50. Zhi-Zhong Chen
    Efficient Approximation Schemes for Maximization Problems on K3, 3-Free Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:1, pp:166-187 [Journal]
  51. Zhi-Zhong Chen, Tatsuie Tsukiji
    Computing bounded-degree phylogenetic roots of disconnected graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:59, n:2, pp:125-148 [Journal]
  52. Guohui Lin, Theodore Tegos, Zhi-Zhong Chen
    Heuristic Search in Constrained Bipartite Matching with Applications to Protein Nmr Backbone Resonance Assignment. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2005, v:3, n:6, pp:1331-1350 [Journal]
  53. Guohui Lin, Dong Xu, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen, Ying Xu
    Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2003, v:1, n:2, pp:387-410 [Journal]
  54. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2005, v:12, n:2, pp:129-146 [Journal]
  55. Zhi-Zhong Chen, Lusheng Wang
    An Improved Randomized Approximation Algorithm for Max TSP. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:4, pp:401-432 [Journal]
  56. Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen
    The longest common subsequence problem for sequences with nested arc annotations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:465-480 [Journal]
  57. Xin He, Zhi-Zhong Chen
    An Algorithm for Shortest Paths in Bipartite Digraphs with Concave Weight Matrices and its Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:65-80 [Journal]
  58. Zhi-Zhong Chen, Xin He, Chun-Hsi Huang
    Finding Double Euler Trails of Planar Graphs in Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1255-1285 [Journal]
  59. Zhi-Zhong Chen, Xin He, Ming-Yang Kao
    Common-Face Embeddings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:2, pp:408-434 [Journal]
  60. Zhi-Zhong Chen, Tao Jiang, Guohui Lin
    Computing Phylogenetic Roots with Bounded Degrees and Errors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:4, pp:864-879 [Journal]
  61. Zhi-Zhong Chen, Ming-Yang Kao
    Reducing Randomness via Irrational Numbers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1247-1256 [Journal]
  62. Zhi-Zhong Chen
    Efficient Algorithms for Acyclic Colorings of Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:230, n:1-2, pp:75-95 [Journal]
  63. Zhi-Zhong Chen
    The Maximal f-Dependent Set Problem for Planar Graphs is in NC. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:2, pp:309-318 [Journal]
  64. Zhi-Zhong Chen
    Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:1-21 [Journal]
  65. Zhi-Zhong Chen, Yong Gao, Guohui Lin, Robert Niewiadomski, Yang Wang, Junfeng Wu
    A space-efficient algorithm for sequence alignment with inversions and reversals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:325, n:3, pp:361-372 [Journal]
  66. Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin, Jianjun Wen, Dong Xu, Jinbo Xu, Ying Xu
    Approximation algorithms for NMR spectral peak assignment. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:211-229 [Journal]
  67. Tatsuie Tsukiji, Zhi-Zhong Chen
    Computing phylogenetic roots with bounded degrees and errors is NP-complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:1, pp:43-59 [Journal]
  68. Ryuhei Uehara, Zhi-Zhong Chen, Xin He
    Fast RNC and NC Algorithms for Maximal Path Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:89-98 [Journal]
  69. Zhi-Zhong Chen, Ruka Tanahashi
    An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:27-36 [Conf]
  70. Lusheng Wang, Zhanyong Wang, Zhi-Zhong Chen
    Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:493-503 [Conf]
  71. Zhi-Zhong Chen, Takayuki Nagoya
    Improved approximation algorithms for metric MaxTSP. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:13, n:4, pp:321-336 [Journal]
  72. Zhi-Zhong Chen, Xiaotie Deng, Ding-Zhu Du
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:378, n:3, pp:209-210 [Journal]

  73. An Improved Randomized Approximation Algorithm for Maximum Triangle Packing. [Citation Graph (, )][DBLP]


  74. Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement. [Citation Graph (, )][DBLP]


  75. A Linear Kernel for Co-Path/Cycle Packing. [Citation Graph (, )][DBLP]


  76. Approximating Maximum Edge 2-Coloring in Simple Graphs. [Citation Graph (, )][DBLP]


  77. A Three-String Approach to the Closest String Problem. [Citation Graph (, )][DBLP]


  78. An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem. [Citation Graph (, )][DBLP]


  79. Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. [Citation Graph (, )][DBLP]


  80. Approximation Algorithms for Bounded Degree Phylogenetic Roots. [Citation Graph (, )][DBLP]


  81. An improved randomized approximation algorithm for maximum triangle packing. [Citation Graph (, )][DBLP]


  82. Erratum to "An improved randomized approximation algorithm for maximum triangle packing" [Discrete Appl. Math. 157 (2009) 1640-1646] [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002