HUTCHINSON JOAN P. / Computer science / Researchers

International Center for Scientific Research


Computer science / HUTCHINSON JOAN P.


Professor of mathematics and computer science at Macalester College.

Research interests

Theoretical computer science, graph algorithms and graph drawing.

Her work has focused primarily on problems of coloring maps and related graphs, and on drawing these graphs on different surfaces, such as the sphere, the torus, and a doubled sphere like the combined earth and moon. Her mathematical work has had relevance to areas of theoretical computer science, graph algorithms and graph drawing, and she currently works and teaches in both disciplines.

Prizes and awards

1999 Winner of the Deborah and Franklin Tepper Haimo Award for Excellence in College or University Teaching.

1998-2000 National Security Agency and American Mathematical Association research grant, \"Three- and Four-Coloring Even Triangualations of Surfaces,\" #MDA904-99-1-0069.

1998 Mathematical Association of America North Central Section Teaching Award

1996 National Science Foundation grant #DMS-9612387, \"Mathematical Sciences: A conference in combinatorics and graph theory; June 12-15, 1996; Philadelphia, PA\"

1994 recipient of the Carl. B. Allendoerfer Award for the article, \"Coloring ordinary maps, maps of empires, and maps of the moon\" which appeared in Mathematics Magazine, 1993

1989-90 National Science Foundation Visiting Professorship for Women, University of Washington, Seattle, WA, \"Structural and algorithmic problems in topological graph theory\", #RII 8901458.



with M. O. Albertson, Discrete Mathematics with Algorithms, John Wiley & Sons, 1988, 546 pp.

with M. O. Albertson, Discrete Mathematics with Algorithms, Instructors Manual, John Wiley & Sons, 1988, 93 pp.


Coloring graphs on surfaces, invited chapter in Topological Graph Theory (J. Gross and T. Tucker, eds.), Topics in Graph Theory series (L. Beineke and R. Wilson, eds.), Cambridge University Press.

with E. H. Moore, Distance bounds in color extension theorems.

with A. Dean and E. Gethner, Unit Bar-visibility Layouts of Triangulated Polygons: Extended Abstract, proceedings of 12th International Symposium on Graph Drawing 2004.

A note on rectilinear and polar visibility graphs (submitted, Discrete Applied Math).

with Y. Chang, M. S. Jacobson, J. Lehel, and D. B. West, The visibility number of a graph, SIAM J. Discrete Math.

with M.O. Albertson, Extending precolorings of subgraphs of locally planar graphs, European J. of Combinatorics (submitted as invited contribution to special issue on Topological Graph Theory and Graph Minors).

with M.O. Albertson, Graph Coloring Extensions: When Hadwiger\'s Conjecture and Embeddings Help, Electronic J. Combinatorics, 9 (1) (2002), R37.
with Bruce Richter and Paul Seymour, Colouring Eulerian Triangulations J. Combinatorial Theory, Series B

On 3- and 4-coloring nearly triangulated surfaces, Proc. 32nd Southeastern Conf. on Combinatorics, Graph Theory, and Computing, 2001, Congressus Numerantium 150 (2001) 129-143.
Arc- and Circle-Visibility Graphs, Australasian J. Combinatorics 25 (2002) 241-262.

with D. Archdeacon, A. Nakamoto, S. Negami, and K. Ota, Chromatic Numbers of Quadrangulations of closed surfaces (pdf, permission required), J. Graph Theory, 37 (2001) 100-114.

with G. Chen, W. Piotrowski, W. Shreve, and B. Wei, Degree sequences with repeated values (pdf), Ars Combinatoria 59 (2001), pp. 33-44.
On polar visibility representations of graphs, Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, Sept. 2000, Proceedings, (J. Marks, ed.), Lecture Notes in Computer Science #1984, Springer, Berlin, 2001, pp. 63 - 76.

with M. O. Albertson, Extending colorings of locally planar graphs ( postscript, dvi, LaTeX), J. Graph Theory, 36 (2001) 105-116.

with Karen L. Collins, Four-coloring six-regular graphs on the torus, Graph Colouring and Applications, P. Hansen and O. Marcotte, eds., CRM Proceedings and Lecture Notes, Vol. 23 (1999) 21-34.

with T. Shermer, A. Vince, On Representations of some Thickness-two graphs (pdf, permission required), Computational Geometry, Theory and Applications, 13 (1999) 161-171.

with A. Dean, Rectangle-visibility layouts of unions and products of trees (compressed postscript, pdf ) , the (electronic) Journal of Graph Algorithms and Applications, 2 (1998) 1-21.

with S. Wagon, Kempe revisited, Amer. Math. Monthly, 105 (1998) 170-174.
with S. Wagon, Four-coloring Planar Maps, Mathematica in Education and Research, 6, no. 1, (1997) 42 - 51.

with P. Bose, A. Dean, and T. Shermer, On Rectangular Visibility Graphs, Graph Drawing, Lecture Notes in Computer Science #1190 (Symp. on Graph Drawing, GD \'96, Berkeley, Calif, USA, Sept. 1996 Proceedings), S. North, ed., Springer-Verlag, Berlin, 1997, pp. 25-44.

Legal notice - Contact

Copyright © 2013 - - All rights reserved