1. | Nearly Cycle Complete and Nearly Cocycle Complete Graphs (with Maurer, S.B.), Congressus Numeratum, 27 (1979). |
2. | Double Semiorder and Double Indifference Graphs (with Roberts, F.S.), SIAM J. of Algebraic and Discrete Methods, 3 (1982), 566-583. |
3. | T-Colorings of Graphs and the Channel Assignment Problem (with Roberts, F.S.), Congressus Numeratum, 35 (1982). |
4. | Computing the Boxicity of a Graph by Covering its Complement by Cointerval Graphs (with Roberts, F.S.), Discrete Applied Math., 6 (1983), 217-228. |
5. | The General Channel Assignment Problem (with Wang, D-I.), Congressus Numeratum, 43 (1983). |
6. | On k-Suitable Sets of Arrangements and the Boxicity of a Graph (with Roberts, F.S.), J. Comb. Inf. and Syst. Sciences, 9 (1984), 14-24. |
7. | Computing the Circular Dimension of a Graph is an NP-Complete Problem, SIAM J. of Computing, (1984). |
8. | Threshold Dimension of Graphs (with Leibowitz, R.), SIAM Journal of Alg. and Disc. Methods, 5 (1984). |
9. | Closed Neighborhood Containment Graphs (with Wang, D-I.), Congressus Numeratum, 46 (1984). |
10. | Mutidimensional Guttman Scales and Threshold Graphs (with Leibowitz, R.), J. of Math. Psych., (1987). |
11. | On Minimum Critically n-Edge Connected Graphs (with Wu, S.S.), SIAM Journal of Alg. and Disc. Methods, 8 (1987), 659-669. |
12. | Dominating Sets in Social Network Graphs (with Kelleher, L.), Math. Soc. Sciences, 16 (1988), 267-279. |
13. | Graphs that are n-edge Connected and k-edge Critical (with Wu, S.S.), Disc. Math., (1989). |
14. | Maximum Critical n-edge Connected Graphs (with Wu, S.S.), J. of Graph Theory, 13 (1989), 559-568. |
15. | Hamiltonian Elimination Orderings of Interval Graphs (with Yen, S.), Europ. J. on Comb. and Graph Theory, (1989). |
16. | On Dimensional Properties of Graphs (with Roberts, F.S.), Graphs and Combinatorics, 5 (1989), 29-46. |
17. | A Graph Partitioning Approach to Speech Decoding (with Deller, J., Hsu, D., and Venkatesh, C.G.), Circuits and Systems. |
18. | Consecutive Ones Property for Matrices and Graphs (with Mahadev, N.G.), Springer Verlag Lecture Notes Series in Mathematics and its Applications: Applications of Combinatorics and Graph Theory to the Biological and Social Sciences, 17 (1989), 75-93. |
19. | Separator Theorems for Nonplanar Graphs and their Applications to Various Decoding Problems, SIAM Discrete Math., (1989). |
20. | Clique Dominating Sets (with Kelleher, L.), Annals of Disc. Math., (1990). |
21. | Dominating Cliques in Graphs (with Kelleher, L.), Discrete Math., 86 (1990), 1-16. |
22. | Critical Neighborhood Connectivity (with Wu, S.S.Y.), Ars Combinatorica, 29 (1990), 149-160. |
23. | A Graph Partitioning Approach to Sentence Level Speech Decoding (with Deller, J.R. Jr., and Venkatesh, C.G.), IEEE Trans. Acoustics, Speech, and Signal Processing, (1991). |
24. | Real Unit Concatenation Structures and Archimedeaness, J. of Math. Psych.. |
25. | Recognizing Mixed Diagonal Consecutive Ones Graphs (with Mahadev, N.G.), SIAM J. of Computing. |
26. | The Relationship between the Threshold Dimension of Split Graphs and other Dimensional Parameters of Graphs (with Halsey, M. D.), Discrete Applied Math., 30 (1991), 125-135. |
27. | Greedy Algorithms for T-colorings of Graphs and the Meaningfulness of Conclusions about them (with Roberts, F. S.), J. of Comb. and Inf. Sys., 16 (1991), 271-318. |
28. | Quo-Vadis Graph Theory Applications, Proceedings of the Quo-Vadis Graph Theory Meeting in Fairbanks Alaska - 1999. |
29. | Issues in International Undergraduate Mathematics Education, Proceedings of the International Congress on Mathematics, ICME'7, (1992). |
30. | Thoughts on Recrutiting Women (with Peden, I.), Association for Women in Mathematics Newsletter, 23 (1993). |
31. | Tenacity, An Optimal Parameter for Graph Stability (with Moazzami, D., and Stueckle, S.), Proc. of the Seventh Inter Conf. in Graph Theory, Comb., Algorithms, and Appl., (1994). |
32. | Tenacity of Harary Graphs (with Moazzami, D., and Stueckle, S.), J. of Combin. Math. and Combin. Comput., 16 (1994), 33-56. |
33. | Bounds of Vertex Neighbor Integrity of Graphs (with Wu, Shu-shih Yang), Ars Combinatorica, (1994). |
34. | Edge Neighbor Integrity of Trees (with Wu, Shu-shih Yang), Australasian J. of Combinatorics, 10 (1994), 163-174. |
35. | Vertex-Neighbor Integrity of Powers of Cycles (with Wu, Shu-shih Yang), Ars Combinatorica, (1994). |
36. | Implementing Standards-based Curriculum in the last half of the Decade (with Robinson, E), ESIE ACCESS, (1994). |
37. | Extreme Values of the Edge-Neighbor-Connectivity (with Wu, Shu-shih Yang), Ars Combinatorica, 39 (1995), 199-210. |
38. | A Change in Thinking is Required - transitions in education at all levels, SYNERGY, (1995). |
39. | Vertex Neighbor Integrity of Trees (with Wu, Shu-shih Yang), Ars Combinatorica, 43 (1996), 169-180. |
40. | Education, Ecomonics and Federal Policy, Report to the Office of Science and Technology Policy, (1996). |
41. | Algebra for all, but not necessarily a discrete course (with Kepner, H.), The Mathematics Teacher, (1996). |
42. | Bounds of Edge-Neighbor Integrity of Graphs (with Wu, Shu-shih Y.), Aust. J. of Comb., 15 (1997), 71-80. |
43. | Discrete Mathematics: A Vehicle for Problem Solving and Excitement, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 36 (1997), 67-74. |
44. | Education for African American Children, National Council of Teachers Mathematics Monograph, (1998). |
45. | The Context of Higher Education (with Gerlenter, M.), AASCU publication, (1999). |
46. | A Statewide Rising Junior Exam - Challenges and Opportunities (with Gerlenter, M.), (1999). |
47. | The Technological Workforce of the 21st Century¡, CIT, June 2003. |
48. | Science and Technology Are Moving at the Speed of Light Is the Workforce Ready? CIT, April 2005. |
52. | Integrating Mathematics and Biology at the High School Level, COMAP UMAP Journal editorial, October 2010. |
49. | Integrating Mathematics and Biology in the High School Curriculum¡, BioMath in the Schools, to be published. |
50. | TD align="left">Food Webs, Competition Graphs, and Habitat Formation¡. Journal of Mathematical Modeling of Natural Phenomena, 2011, accepted. |
51. | Edge Control in Signed Graphs¡ (with T.M. Wang and C.M. Lin). Mathematics and Computer Modeling, 2011, submitted. |