G. N. Frederickson. Dissections: Plane & Fancy. 310 pages, Cambridge University Press, November 1997.
G. N. Frederickson. A Data Structure for Dynamically Maintaining Rooted Trees. Journal of Algorithms, 24(1):37-65, July 1997.
G. N. Frederickson. Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees. SIAM Journal on Computing, 26(2):484-538, April 1997.
G. N. Frederickson and R. Solis-Oba. Efficient Algorithms for Robustness in Matroid Optimization. In Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, pages 659-668, New Orleans, Louisiana, January 1997.
M. C. Loui, A. Condon, F. Fich, G. N. Frederickson, A. V. Goldberg, D. S. Johnson, S. Mahaney, P. Raghavan, J. Savage, A. L. Selman, and D. B. Shmoys. Strategic Directions in Research in Theory of Computing. Computing Surveys, 28(6):575-590, ACM, December 1996.
G. N. Frederickson Biographical Information