( en | de | ru )

 

Disambiguation of "Chen, Zhi-Zhong"

Author of the publication

copydeleteadd this publication to your clipboard
Recognizing Hole-Free 4-Map Graphs in Cubic Time.

, , and . Algorithmica, 45 (2): 227-262 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Zhi Chen

Zhi Chen

Zhi Qiang Chen

Chen-Zhong Dong

Maria Zhivkova-Galunska

 

Other publications of authors with the same name

Approximating Unweighted Connectivity Problems in Parallel.. ISAAC, volume 1350 of Lecture Notes in Computer Science, page 202-211. Springer, (1997)Planar Map Graphs., , and . STOC, page 514-523. ACM, (1998)Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard., and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 450-461. Springer, (2004)A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs., and . MFCS, volume 2747 of Lecture Notes in Computer Science, page 348-357. Springer, (2003)Hierarchical Topological Inference on Planar Disc Maps., and . COCOON, volume 1858 of Lecture Notes in Computer Science, page 115-125. Springer, (2000)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)Finding Double Euler Trails of Planar Graphs in Linear Time., , and . SIAM J. Comput., 31 (4): 1255-1285 (2002)Tight upper bound on the number of edges in a bipartite K3, 3-free or K5-free graph with an application., and . Inf. Process. Lett., 84 (3): 141-145 (2002)Recognizing Hole-Free 4-Map Graphs in Cubic Time., , and . Algorithmica, 45 (2): 227-262 (2006)On the Complexity of Computing Optimal Solutions., and . Int. J. Found. Comput. Sci., 2 (3): 207-220 (1991)