Terry Anderson's Home Page I earned my M.Math. (Computer Science) from the University of Waterloo in 2011, supervised by Professor Therese Biedl. I have been working as a sessional instructor for the Faculty of Mathematics since January 2010, which has definitely been the most rewarding part of my university experience. My main research interests are graph-theoretic algorithms for k-connectivity augmentation problems, the on-line maintenance of k-connectivity and planarity properties in subgraphs, and planar graph drawing. I am also interested in topics related to machine learning in artificial intelligence.

• The Vulcan game of Kal-toh: Finding or making triconnected planar subgraphs (my M.Math. thesis) link
• External referee for Discrete Mathematics and Theoretical Computer Science.
• External referee for The 17th International Symposium on Graph Drawing, 2009.
• Anderson, T. Strategies for Blackjack Tournaments. The 9th Annual Graduate Student Research Conference. University of Waterloo, 2009.
• Anderson, T., Loftus, J., Rampersad, N., Santean, N., and Shallit, J. Detecting Palindromes, Patterns and Borders in Regular Languages. Information and Computation, 2009. link
• Anderson, T., Rampersad, N., Santean, N., and Shallit, J. Finite Automata, Palindromes, Powers, and Patterns. In Language and Automata Theory and Applications, volume 5196 of Lecture Notes in Computer Science, pages 52--63. Springer Berlin, 2008. (Conference proceedings for The Second International Conference on Language and Automata Theory and Applications. Tarragona, Spain, 2008.) link

• CS 116: Introduction to Computer Science 2 (W10, F10)
• CS 136: Elementary Algorithm Design and Data Abstraction (F10, W11)
• CS 246: Object-Oriented Software Development (S11)
• MATH 127: Calculus 1 for the Sciences (F11)
• MATH 137: Calculus 1 for Honours Mathematics (F11)

Terry Anderson
Office of the Dean of Mathematics
University of Waterloo
200 University Avenue West
Waterloo, ON  N2L 5G5
Canada