Publications

Ting-Yi Sung

(A) Journal Papers:

1.

Ting-Yi Sung, Her-Jiun Sheu and Denis Naddef, Heuristic approach to the Artificial Intelligence Design Challenge, Journal of Guidance, Control, and Dynamics 11, 1988, 406-411.

2.

Manfred Padberg and Ting-Yi Sung, A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'', Operations Research Letters 7, 1988, 117-125.

3.

Manfred Padberg and Ting-Yi Sung, An analytical comparison of different formulations of the travelling salesman problem, Mathematical Programming 52, 1991, 315-357.

4.

Chun-Nan Hung, Lih-Hsing Hsu and Ting-Yi Sung, The most vital edges of matching in bipartite graphs, Networks 35, 1993, 309-313.

5.

Fu-Shang P. Tsen, Ting-Yi Sung, Men-Yang Lin and Lih-Hsing Hsu, Finding the most vital edges with respect to the number of spanning trees, IEEE Trans. on Reliability 43, 1994, 600-603.

6.

Tung-Yang Ho, Lih-Hsing Hsu and Ting-Yi Sung, Transmitting on various network topologies, Networks 27, 1996, 145-157; also presented at ICCI'94 Sixth International Conference.

7.

Chun-Nan Hung, Lih-Hsing Hsu and Ting-Yi Sung, A response to Volgenant's addendum on the most vital edges, Networks 27, 1996, 255.

8.

Zhen Liu and Ting-Yi Sung, Routing and transmitting problems in de Bruijn networks, IEEE Transactions on Computers 45, 1996, 1056-1062.

9.

Ting-Yi Sung, Men-Yang Lin and Tung-Yang Ho, Multiple-edge-fault tolerance with respect to hypercubes, IEEE Transactions on Parallel and Distributed Systems 8, 1997, 187-192; also accepted by ISPAN '96.

10.

Lih-Hsing Hsu, Shih-Yih Wang and Ting-Yi Sung, Faithful 1-edge fault tolerant graphs, Information Processing Letters 61, 1997, 173-181; also presented at The Eighth SIAM Conference on Discrete Mathematics, Baltimore, Maryland, 1996.

11.

Manfred Padberg and Ting-Yi Sung, An analytic symmetrization of max flow-min cut, Discrete Mathematics 165/166, 1997, 531-545.

12.

Jenn-Jung Wang, Shih-Yih Wang, Lih-Hsing Hsu and Ting-Yi Sung, Extended tree contraction for some parallel algorithms on series-parallel networks, Journal of Information Science and Engineering 13, 1997, 665-680.

13.

Tung-Yang Ho, Ting-Yi Sung, Lih-Hsing Hsu, Chang-Hsiung Tsai and Jeng-Yan Hwang, The recognition of double euler trails in series-parallel networks, Journal of Algorithms 28, 1998, 216-257.

14.

Ting-Yi Sung, Chun-Yuan Lin, Yen-Chu Chuang and Lih-Hsing Hsu, Fault-tolerant token ring embedding in double loop networks, Information Processing Letters 66, 1998, 201-207.

15.

Chun-Nan Hung, Lih-Hsing Hsu and Ting-Yi Sung, Christmas tree: a versatile 1-fault-tolerant design for token rings, Information Processing Letters 72, 1999, 55-63; a preliminary version also in the Proceedings of 1998 International Conference on Parallel and Distributed Systems, 383-388.

16.

Chien-Ping Chang, Ting-Yi Sung and Lih-Hsing Hsu, Edge congestion and topological properties of crossed cubes, to appear in IEEE Transactions on Parallel and Distributed Systems, 2000.

17.

Jeng-Jung Wang, Chun-Nan Hung, Jimmy J.M. Tan, Lih-Hsing Hsu and Ting-Yi Sung, Construction schemes for fault tolerant Hamiltonian graphs, to appear in Networks, 2000.

18.

Chun-Nan Hung, Jeng-Jung Wang, Ting-Yi Sung and Lih-Hsing Hsu, On the isomorphism between cyclic-cubes and wrapped butterfly networks, to appear in IEEE Transactions on Parallel and Distributed Systems, 2000.

19.

Jeng-Jung Wang, Ting-Yi Sung and Lih-Hsing Hsu, A family of optimal 1-Hamiltonian graphs with diameter O(log n), to appear in Journal of Information Science and Engineering, 2000; a preliminary version under the title ``A new family of optimal 1-Hamiltonian graphs with small diameter'' also appeared in Computing and Combinatorics, Proceedings of the Fourth Annual International Conference, COCOON'97, Lecture Notes in Computer Science 1449, Wen-Lian Hsu and Ming-Yang Kao, editors, Springer-Verlag, 269-278, 1998.

20.

Ting-Yi Sung, Tung-Yang Ho and Lih-Hsing Hsu, Optimal k-fault-tolerant networks for token rings, to appear in Journal of Information Science and Engineering, 2000; also in Proceedings of National Computer Symposium, 1995, 382-388.

21.

Chun-Nan Hung, Lih-Hsing Hsu and Ting-Yi Sung, On the construction of combined k-fault-tolerant hamiltonian graphs, to appear in Networks, 2000.

(B) Jounral Submissions:

1.

Ting-Yi Sung, Tung-Yang Ho and Lih-Hsing Hsu, Combinatorial properties of projective torus networks, submitted to Networks, 1999.

2.

Ting-Yi Sung and Jeng-Jung Wang, Bisection width and netwrok congestion of cubical networks, submitted to IEEE Transactions on Parallel and Distributed Systems, 2000.

3.

Tung-Yang Ho, Ting-Yi Sung and Daniela Ferrero, Diameter variability of hypercubes and cyclic networks, submitted to IEEE Transactions on Parallel and Distributed Systems, 2000.

4.

Meng-Yang Lin, Chung-Haw Chang, Ting-Yi Sung and Lih-Hsing Hsu, A note on the edge fault-tolerance with respect to hypercubes, submitted to Information Processing Letters, 2000.

(C) Conference Papers:

1.

Jan-Ming Ho, Ming-Tat Ko, Tze-Heng Ma and Ting-Yi Sung, Algorithms for rectilinear optimal multicast tree problem, Proceedings of the Third Symposium on Algorithms and Computation, Nagoya, Japan, 1992.

2.

Lih-Hsing Hsu, Chang-Hsiung Tsai and Ting-Yi Sung, On the compositions of networks having double Euler trails, presented at The Seventh International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, 1992.

3.

Ting-Yi Sung, Lih-Hsing Hsu and Jeng-Yan Hwang, Data structure for graph representations of a network having double Euler trails, Information Processing 92, Volume I: Algorithms, Software, Architecture, J. van Leeuwen, editor, Elsevier Science Publishers B.V., 436-442, 1992.

4.

Ting-Yi Sung and Men-Yang Lin, Edge fault tolerance in hypercubes, presented at TIMS/ORSA Joint National Meeting, Boston, April 1994.

5.

Ting-Yi Sung, The undirected de Bruijn graph: shortest paths and transmitting, presented at INFORMS Meeting, New Orleans, Oct. 1995.

6.

Ting-Yi Sung, Tung-Yang Ho and Lih-Hsing Hsu, Projevctive torus networks, Computing and Combinatorics, Proceedings of the Third Annual International Conference, COCOON'97, Lecture Notes in Computer Science 1276, Tao Jiang and D.T. Lee, editors, Springer-Verlag, 451-459, 1997; also submitted to Networks.

7.

Chien-Ping Chang, Ting-Yi Sung and Lih-Hsing Hsu, A new shortest path routing algorithm and embedding cycles of crossed cubes, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'97), Feipei Lai, Bruce Maggs, and D. Frank Hsu, editors, IEEE Computer Society Press, 125-131, 1997.

(D) Others

1.

Lih-Hsing Hsu and Ting-Yi Sung, Second optimal solutions, critical elements, and recycling algorithms, manuscript, 1996.

2.

Yonghong Chen, Chun-Nan Hung, Qiao Li and Ting-Yi Sung, On the equivalence between a class of Cayley graphs and butterflies, manuscript, 1997.

3.

Chien-Ping Chang, Ting-Yi Sung and Lih-Hsing Hsu, Bisection width and edge congestion of hypercubic networks, manuscript, 1998.