Sue Whitesides, Selected Papers

Copyright restrictions may apply.

How to Water Carrots: Geometric Coverage Problems for Point Sets, H. Alt, E. Arkin, H. Bronnimann, J. Erikson, S. Fekete, C. Knauer, J. Lenchner, J. Mitchell, S. Whitesides, and K. Whittlesey, Proc. of the 15th Annual Fall Workshop on Computational Geometry and Visualization, U. Pennsylvania, Philadelphia, Nov. 18-19, 2005, pp. 71-72.

Realizing partitions respecting full and partial order information, E. Demaine, J. Erickson, D. Krizanc, H. Meijer, P. Morin, M. Overmas, and S. Whitesides, 16th Australasian Workshop on Combinatorial Algorithms (AWOCA 2005), Sept. 18-21, 2005, U. Ballarat, Victoria, Australia.

Maintaining visibility information of planar point sets with a moving viewpoint, O. Devillers, V. Dujmovic, H. Everett, S. Hornus, S. Whitesides, and S. Wismath, Proc. of the 17th Canadian Conference on Computational Geometry (CCCG 2005), Aug. 10-12, 2005, U. Windsor, Windsor ON, Canada, pp. 291-294.

Separating point sets in polygonal environments, E. Demaine, J. Erickson, F. Hurtado, J. Iacono, S. Langerman, H. Meijer, M. Overmars, and S. Whitesides, International J. Computational Geometry and Applications, Special Issue on the ACM Symposium on Computational Geometry 2004, accepted March 25, 2005.

Magnetic self-assembly of three-dimensional surfaces from planar sheets, M. Boncheva, S.A. Andreev, L. Mahadevan, A. Winkleman, D. R. Reichman, M. G. Prentiss, S. Whitesides, and G. M. Whitesides, Proceedings of the National Academy of Sciences of the United States of America (PNAS), vol. 102, no. 11, March 15, 2005, pp. 3924-3929.

Transversals to line segments in three-dimensional space, H. Bronnimann, H. Everett, S. Lazard, F. Sotille, and S. Whitesides, accepted by Discrete and Computational Geometry, Feb. 10, 2005.

A fixed-parameter approach to two-layer planarization, V. Dujmovic, M. Fellows, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, and D.R. Wood, accepted by Algorithmica, Jan. 27, 2005.

Minimum distance localization for a robot with limited visibility, Malvika Rao, Gregory Dudek, and Sue Whitesides, to appear in the Proc. ICRA 2005, IEEE International Conference on Robotics and Automation, April 18-22, 2005, Barcelona, Spain.

The three dimensional logic engine, Matthew Kitching and Sue Whitesides, in Proc. GD 2004, Twelfth International Symposium on Graph Drawing, New York NY, Sept. 29-Oct.2, 2004, Janos Pach (Ed.), Springer-Verlag, LNCS series, vol. 3383, pp. 329-339.

Faster fixed-parameter tractable algorithms for matching and packing problems, M. Fellows, C. Knauer, N. Nishimura, P. Ragde, F. Rosamond, U. Stege, D. Thilikos, and S. Whitesides, in Proc. ESA 2004, 12th Annual European Symposium on Algorithms, Bergen, Norway, Sept. 14-17, 2004, Springer-Verlag, LNCS series, vol. 3221, 2004, pp. 311-322.

Randomized algorithms for minimum distance localization, Malvika Rao, Gregory Dudek, and Sue Whitesides, in Proc. WAFR 2004, Sixth International Workshop on the Algorithmic Foundations of Robotics, July 11-13, 2004, Utrecht, The Netherlands, pp. 265-280.

The number of lines tangent to arbitrary convex polyhedra in 3D, H. Bronnimann, O. Devillers, V. Dujmovic, H. Everett, M. Glisse, X. Goaoc, S. Lazard, H.-S. Na, and S. Whitesides, in Proc. of the Twentieth Annual Symposium on Computational Geometry, Brooklyn NY, June 9-11, 2004, Association of Computing Machinery, New York NY, 2004, pp. 46-55.

Separating point sets in polygonal environments, E. D. Demaine, J. Erickson, F. Hurtado, J. Iacono, H. Meijer, M. Overmars, and S. Whitesides, in Proc. of the Twentieth Annual Symposium on Computational Geometry, Brooklyn NY, June 9-11, 2004, Association of Computing Machinery, New York NY, 2004, pp. 10-16.

Tuning and comparing spatial normalization methods, S. Robbins, A.C. Evans, D.L. Collins, and S. Whitesides, in Medical Image Analysis, vol. 8, no. 3, 2004, pp. 311-323.

The complexity of unfolding, H. Alt, C. Knauer, G. Rote, and S. Whitesides, in Towards a Theory of Geometric Graphs, J. Pach (Ed.), American Mathematical Society, Contemporary Mathematics series, vol. 342, 2004, pp. 1-14.

An efficient fixed parameter tractable algorithm for 1-sided crossing minimization, Vida Dujmovic and Sue Whitesides, in Algorithmica, vol. 40, no. 1, 2004, pp. 15-31.

Experiments with the fixed-parameter approach for two-layer planarization, Matthew Suderman and Sue Whitesides, in Proc. GD 2003, Eleventh International Symposium on Graph Drawing, Perugia, Italy, Sept. 21-24, 2003, G. Liotta (Ed.), Springer-Verlag LNCS vol. 2912, 2004, pp. 345-356.

A complete and effective move set for simplified protein folding, Neal Lesh, Michael Mitzenmacher, and Sue Whitesides, in Proc. RECOMB '03, Seventh Annual International Conference on Computational Biology, Berlin, Germany, April 10-13, 2003, Association for Computing Machinery, New York, 2003, pp. 188-195.

Dissections: self-assembled aggregates that spontaneously reconfigure their structures when their environment changes, C. Mao, V.R. Thalladi, D.B. Wolfe, S. Whitesides, and G.M. Whitesides, in J. of the American Chemical Society, vol. 124, no. 49, Dec. 11, 2002, pp. 14508-14509.

Using hierarchical self-assembly to form three-dimensional lattices of spheres, H. Wu, V.R. Thalladi, S. Whitesides, and G.M. Whitesides, in J. of the American Chemical Society, vol. 124, no. 48, 2002, pp. 14495-14502.

Chain Reconfiguration: the Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages , Sue Whitesides, in Algorithms and Computation, 12th International Symposium, Christchurch, New Zealand, Dec. 19-21, 2001, Proceedings, P. Eades and T. Takaoka (Eds.), Springer-Verlag, LNCS vol. 2223, 2001, pp. 1-13.

Three-dimensional orthogonal graph drawing algorithms, Peter Eades, Antonios Symvonis, and Sue Whitesides, in Discrete Applied Mathematics vol. 103, 2000, pp. 55-87.

Three-dimensional metallic microstructures fabricated by soft lithography and microelectrodeposition, R. Jackman, S. T. Brittain, A. Adams, H. Wu., M. G. Prentiss, S. Whitesides, and G. M. Whitesides, in Langmuir (ACS), vol. 15, 1999, pp. 826-836.

On folding rulers in regular polygons, Naixun Pei and Sue Whitesides, Proc. 9th Canadian Conference on Computational Geometry, Queen's U., Kingston, Ontario, Canada, Aug. 11-14, 1997.

On the reachable regions of chains, Naixun Pei and Sue Whitesides, Proc. 8th Canadian Conference on Computational Geometry, Carleton U., Ottawa, Ontario, Canada, Aug. 12-15, 1996, pp. 161-166.

On the reconfiguration of chains, Sue Whitesides and Naixun Pei, Computing and Combinatorics, Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996, Proceedings, Jin-yi Cai and C. K. Wong (Eds.), Springer-Verlag, LNCS vol. 1090, 1996, pp. 381-390.

More coming .... (as my violin teacher says, "stay tuned".)