Zhi-Zhong Chen. Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs, Proc. of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, Bonn, Germany,. Lecture Notes in Computer Science,. 2004
Zhi-Zhong Chen. Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs, Proc. of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, Bonn, Germany,. Lecture Notes in Computer Science,. 2004
Zhi-Zhong Chen. Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard, Proc. of the 10th Annual International Conference on Computing and Combinatorics, Jeju Island, Korea, August 2004 (COCOON2004),. Lecture Notes in Computer Science,. 2004. vol.3106,. 450-461,
Zhi-Zhong Chen. Computing Phylogenetic Roots with Bounded Degrees and Errors Is Hard, Proc. of the 10th Annual International Conference on Computing and Combinatorics, Jeju Island, Korea, August 2004 (COCOON2004),. Lecture Notes in Computer Science,. 2004. vol.3106,. 450-461,
Tomokazu Imamura, Kazuo Iwama. Approximated Vertex Cover for Graphs with Perfect Matchings, Proc. of the 10th Annual International Conference on Computing and combinatorics, Jeju island, Korea, August 2004 (COCOON2004),. Lecture Notes in Computer Science,. 2004. vol.3106,. 132-142,