Skip to content. Skip to navigation
McGill Home SOCS Home
Personal tools
You are here: Home → People → Profile

Sue Whitesides


photo

Email: sue At uvic Dot CA
Home Page: http://www.cs.mcgill.ca/~sue
Office: MC318
Phone: +1-250-472-5704
Fax: +1-250-472-5708
Address:
Department of Computer Science
University of Victoria
P.O. Box 3055 STN CSC
Victoria, BC
V8W 3P6
Canada

Research Description

Professor Whitesides' research interests lie in discrete mathematics and theoretical computer science, computational geometry, combinatorial algorithms, and complexity bounds. Particular interests include graph drawing, graph embedding, geometric representations of graphs; robot motion planning; geometric issues in brain imaging; geometric problems in microfabrication technology; geometric problems in graphics

Research Interests

Research Labs

Teaching

Selected Publications (click link in front of each publication to see bibtex in ASCII format)

[1] Fellowsa, M. R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F. A., Stege, U., Thilikos, D. M., and Whitesides, S. Algorithmica, 2008, v. 52, n. 2, pp. 267-292.
[2] Fellows, M. R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F. A., Stege, U., Thilikos, D. M., and Whitesides, S. Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica, 2008, v. 52, n. 2, pp. 167-176.
[3] Dujmovic, V., Fellows, M. R., Kitching, M., Liotta, G., McCarin, C., Nishimura, N., Ragde, P., Rosamond, F. A., Whitesides, S., and Wood, D. R. On the parameterized complexity of layered graph drawing. Algorithmica, 2008, v. 52, n. 2, pp. 267-292.
[4] Giannopoulos, P., Knauer, C., and Whitesides, S. Parameterized complexity of geometric problems. The Computing Journal, 2008, v. 51, n. 3, pp. 372-384.
[5] Demaine, E. D., Erickson, J., Krizanc, D., Meijer, H., Morin, P., Overmars, M., and Whitesides, S. Realizing partitions respecting full and partial order information. Journal of Discrete Algorithms, 2008, v. 6, n. 1, pp. 51-58.
[6] Fellows, M. R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F. A., Stege, U., Thilikos, D. M., and Whitesides, S. Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica, 2008, v. 52, n. 2, pp. 167-176.
[7] Dujmovic, V., Fellows, M. R., Kitching, M., Liotta, G., McCarin, C., Nishimura, N., Ragde, P., Rosamond, F. A., Whitesides, S., and Wood, D. R. On the parameterized complexity of layered graph drawing. Algorithmica, 2008, v. 52, n. 2, pp. 267-292.
[8] Zhang, L., Everett, H., Lazard, S., Weibel, C., and Whitesides, S. On the size of the 3d visibility skeleton: experimental results. In Halperin, D., and Melhorn, K., editors, ESA 2008 16th Annual European Symposium on Algorithms. Springer-Verlag, 2008, pp. 805-816.
[9] Giordano, F., Liotta, G., and Whitesides, S. In Tollis, I., and Patrignani, M., editors, Graph Drawing: 16th International Symposium, GD 2008. Springer-Verlag, September 2008, pp. 242-253.
[10] Rao, M., Dudek, G., and Whitesides, S. Randomized algorithms for minimum distance localization. The International Journal of Robotics Research, September 2007, v. 26, n. 9, pp. 917-934.
[11] Devillers, O., Dujmovic, V., Everett, H., Hornus, S., Whitesides, S., and Wismath, S. Maintaining visibility information of planar point sets with a moving viewpoint. International Journal of Computational Geometry and Applications, August 2007, v. 17, n. 4, pp. 297-304.
[12] Bronnimann, H., Devillers, O., Dujmovic, V., Everett, H., Glisse, M., Goaoc, X., Lazard, S., Na, H.-S., and Whitesides, S. Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra. SIAM Journal on Computing, 2007, v. 37, n. 2, pp. 522-551.
[13] Ada, A., Coggan, M., Marco, P. D., Doyon, A., Flookes, L., Heilala, S., Kim, E., Wing, J. L. O., Preville-Ratelle, L.-F., Whitesides, S., and Yu, N. On bus graph realizability. In Bose, P., editor, Proceedings of the 19th Canadian Conference on Computational Geometry, August 2007, pp. 229-232.
[14] Kim, E., Whitesides, S., and Liotta, G. A note on drawing direction-constrained paths in 3d. In Bose, P., editor, Proceedings of the 19th Canadian Conference on Computational Geometry, August 2007, pp. 193-196.
[15] Zhang, L., Everett, H., Lazard, S., and Whitesides, S. Towards an implementation of the 3d visibility skeleton. In Proceedings of the ACM Symposium on Computational Geometry, June 2007, pp. 131-132.
[16] Boucher, M., Lyttelton, O., Whitesides, S., and Evans, A. A discrete differential operator for direction-based surface morphometry. In Proceedings of the IEEE 11th International Conference on Computer Vision ICCV2007. IEEE, October 2007, pp. 1-8.
[17] Battista, G. D., Liotta, G., and Whitesides, S. The strength of weak proximity. Journal of Discrete Algorithms, 2006, v. 4, n. 3, pp. 384-400.
[18] Demaine, E., Erickson, J., Krizanc, D., Meijer, H., Morin, P., and Whitesides, S. Realizing partitions respecting full and partial order information. Journal of Discrete Algorithms, 2006. accepted 14 August 2006 In Press.
[19] Absar, R., and Whitesides, S. On computing shortest external watchman routes for convex polygons. In Proceedings of the 18th Canadian Conference on Computational Geometry, August 2006, pp. 59-62. Kingston ON Aug. 14-16.
[20] Devillers, O., Dujmovic, V., Everett, H., Hornus, S., Whitesides, S., and Wismath, S. Maintaining visibility information of planar point sets with a moving viewpoint. International Journal of Computational Geometry and Applications, 2006. accepted 7 March 2006 In Press.
[21] Alt, H., Arkin, E., Bronnimann, H., Erikson, J., Fekete, S., Knauer, C., Lenchner, J., Mitchell, J., Whitesides, S., and Whittlesey, K. How to water carrots: Geometric coverage problems for point sets. In Proceedings of the 15th Annual Fall Workshop on Computational Geometry and Visualization, U. Pennsylvania, Philadelphia. November 2005, pp. 71-72.
[ .pdf ]
[22] Devillers, O., Dujmovic, V., Everett, H., Hornus, S., Whitesides, S., and Wismath, S. Maintaining visibility information of planar point sets with a moving viewpoint. In Proceedings of the 17th Canadian Conference on Computational Geometry (CCCG 2005), U. Windsor, Windsor ON, Canada. August 2005, pp. 291-294.
[ .pdf ]
[23] Demaine, E., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Meijer, H., Overmars, M., and Whitesides, S. Separating point sets in polygonal environments. In International J. Computational Geometry and Applications, Special Issue on the ACM Symposium on Computational Geometry 2004, March 2005.
[ .pdf ]
[24] Boncheva, M., Andreev, S., Mahadevan, L., Winkleman, A., Reichman, D. R., Prentiss, M. G., Whitesides, S., and Whitesides, G. M. Magnetic self-assembly of three-dimensional surfaces from planar sheets. In Proceedings of the National Academy of Sciences of the United States of America (PNAS), March 2005, v. 102, n. 11, pp. 3924-3929.
[ .pdf ]
[25] Bronnimann, H., Everett, H., Lazard, S., Sotille, F., and Whitesides, S. Transversals to line segments in three-dimensional space. Discrete and Computational Geometry, February 2005.
[ .pdf ]

Last Update:   2010/11/17 22:18:24.538 US/Eastern