--Journal Articles--
Emergency Response Sets in Graphs.
Jean R. S. Blair, Wayne Goddard, Sandra M. Hedetniemi, Stephen T. Hedetniemi, and Steven B. Horton ,
accepted for publication in Journal of Combinatorial Mathematics and Combintatorial Computing.
An Undergraduate Success Story: A Computer Science and Electrical Engineering Integrative Experience.
Jean R. S. Blair, and
Grant A. Jacoby ,
IEEE Pervasive Computing, Vol. 5 (2006), No. 3, pages 11-15.
Broadcast Covers in Graphs.
Jean R. S. Blair, and
Steven B. Horton ,
Congressus Numerantium, Vol. 173 (2005), pages 109-115.
Broadcast Domination Algorithms for Interval Graphs, Series-Parallel Graphs, and Trees.
Jean R. S. Blair,
Pinar Heggernes,
Steven Horton , and
Fredrik Manne,
Congressus Numerantium, Vol. 169 (2004), pages 55-77.
A Practical Algorithm for Making Filled Graphs Minimal. (
ps) (
pdf)
Jean R. S. Blair,
Pinar Heggernes, and
Jan Arne Telle,
Theoretical Computer Science, Vol. 250 (2001), No. 1/2, pages 125-141.
Perfect recall and pruning in games with imperfect information.
Jean R. S. Blair,
David Mutchler, and Mike van Lent,
Computational Intelligence, Vol. 12 (1996), No. 1, pages 131-154.
River Routing with a Generalized Model.
Jean R. S. Blair and
Errol L Lloyd,
Journal of Computer and System Sciences, Vol. 53 (1996), No. 3, pages 525-544.
On Finding Minimum-Diameter Clique Trees.
Jean R. S. Blair and
Barry W. Peyton,
Nordic Journal of Computing, Vol. 1 (1994), pages 173-201.
The Effciency of AC graphs.
Jean R. S. Blair,
Discrete Applied Mathematics, Vol. 44 (1993), pages 119-138.
The Impact of Wire Topology on Single Row Routing.
Jean R. S. Blair and
Errol L. Lloyd,
Journal of Circuits, Systems, and Computers, Vol. 2 (1992), No. 2, pages 101-112.
Minimzing External Wires in Generalized Single-Row Routing.
Jean R. S. Blair and
Errol L. Lloyd,
IEEE Transactions on Computers, Vol. 41 (1992), No. 6, pages 771-776.
The Benefits of External Wires in Single Row Routing.
Jean R. S. Blair and
Errol L. Lloyd,
Information Processing Letters, 40 (11 October 1991), pages 43-49.
Minimizing Channel Density in Standard Cell Layout.
Jean R. S. Blair, S. Kapoor,
Errol L. Lloyd, and Kenneth J. Supowit,
Algorithmica, Vol. 2 (1987), pages 267-282.
An Optimistic Implementation of the Stack-Heap.
Jean R. S. Blair,
Phil Kearns, and
Mary Lou Soffa,
Journal of Systems and Software, Vol. 5 (1985), pages 193-202.
--Invited Papers--An Introduction to Chordal Graphs and Clique Trees.
Jean R. S. Blair and
Barry W. Peyton,
Graph Theory and Sparse Matrix Computations,
eds. J.A. George,
J.R. Gilbert, and
J.W-H. Liu,
IMA Volumes in Mathematics and its Applications, Vol. 56, Springer-Verlag, pages 1-27.
Avoiding the Pratfalls of Program Assessment.
Christa Chewar,
Kevin L. Huggins , and Jean R. S. Blair,
ACM SIGCSE Bulletin, Vol. 38 (2006), No. 4, ACM Press, New York NY, pages 22-33.
--Conferences--Catch that Speeding Turtle: Latching onto Fun Graphics in CS 1.
Tanya Markow,
Eugene K. Ressler, and Jean R. S. Blair,
Proceedings of the SIGAda Annual International Conference (SIGAda-2006), November 2006, pages 29-34.
Faculty Development in Information Technology Education.
William K. Suchan, Jean R. S. Blair,
Duane Fairfax ,
Bryan S. Goda ,
Kevin L. Huggins , and Michael J. Lemanski,
Proceedings of the ACM Special Interest Group for Information Technology Education Conference (SIGITE-2006), October 2006.
Designing an Interdisciplinary Information Technology Program.
Edward J. Sobiesk , Jean R. S. Blair, James D. Cook, John C. Giordano,
Bryan S. Goda , and
Charles W. Reynolds ,
Proceedings of the ACM Special Interest Group for Information Technology Education Conference (SIGITE-2006), October 2006.
Extremities and orderings defined by generalized graph search algorithms.
Anne Berry , Jean R.S. Blair,
J-P.Bordat ,
R. Krueger , and G. Simonet.
7th International Colloquium on Graph Theory (ICGT 05),
Electronic Notes in Discrete Mathematics, Vol. 22 (2005), pages 413-420.
Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees.
Jean R. S. Blair and
Fredrik Manne,
17th International Conference on Parallel and Distributed Computing Systems, San Francisco CA, September 2004, pages 333-338.
Evolution of the Distributed Application Engineering Course.
Michael J. Lanham, Charles E. Phillips, Jr., John M. D. Hill, and Jean R. S. Blair,
International Conference on Education and Information Systems: Technologies and Applications, Orlando, Florida, July 21-25, 2004.
Genesis of the New Information Systems Engineering Program at the United States Military Academy at West Point.
Gregory S. Parnell, Jean R. S. Blair,
Curtis A. Carver Jr., Clark K. Ray, and
Michael D. Matthews,
International Conference on Information Systems and Engineering, July 2003.
Efficient Self-stabilizing Algorithms for Tree Networks. (
ps)
Jean R. S. Blair and
Fredrik Manne,
Proceedings of the 23rd International Conference on Distrubited Computing Systems (ICDCS-2003), IEEE Computer Society, May 2003, pages 20-26.
Puzzles and Games: Addressing Different Learning Styles in Teaching Operating Systems Concepts.
John M. D. Hill, Clark K. Ray, Jean R. S. Blair, and
Curtis A. Carver Jr.,
Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, Reno Nevada, February 2003, pages 182-186.
Maximum Cardinality Search for Computing Minimal Triangulations (
ps) (
pdf).
Jean R. S. Blair,
Anne Berry , and
Pinar Heggernes,
28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG-2002), Cesky Krumlov, Czech Republic, June 13-15 2002, pages 1-12.
Evaluating the Fidelity of a Partitioned Digital Image Halftoning Algorithm.
David A. Nash, Jean R. S. Blair,
Eugene K. Ressler,
Barry L. Shoop, and Tommy D. Wagner,
Proceedings of SPIE, Vol. 4388 (2001), Orlando Florida, pages 13-23.
A Partitioning Scheme for Optoelectronic Neural Networks.
Tommy D. Wagner, David A. Nash, Jean R. S. Blair,
Eugene K. Ressler, and
Barry L. Shoop,
2000 Digest of the LEOS Summer Topical Meetings, Aventura Florida, July 2000, pages 69-70.
Partitioning Schemes for Use in a Neural Network for Digital Image Halftoning.
Jean R. S. Blair, Tommy D. Wagner, David A. Nash,
Eugene K. Resslerr,
Barry L. Shoop, and Tim J. Talty,
Proceedings of the SPIE, Vol. 4055 (2000), Orlando Florida, pages 36-48.
A Practical Algorithm for Making Filled Graphs Minimal. (
ps) (
pdf),
Jean R. S. Blair,
Pinar Heggernes, and
Jan Arne Telle,
XIV Householder Symposium on Numerical Algebra, Whistler, Canada, 1999.
The Undergraduate Capstone Software Design Experience.
Jean R. S. Blair,
Eugene K. Ressler, and Tommy D. Wagner,
Proceedings of the Tri-Ada Conference, St. Louis Missouri, November, 1997 pages 41-47.
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges (
ps) (
pdf).
Jean R. S. Blair,
Pinar Heggernes, and
Jan Arne Telle,
Proceedings of Fifth Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 1097, Springer Verlag, 1996, pages 173-184.
Games with Imperfect Information.
Jean R. S. Blair,
David Mutchler, and Cheng Liu,
AAAI Fall Symposium on Games: Planning and Learning, Raleigh North Carolina, October 22-24 1993, pages 59-67.
An Introduction to Chordal Graphs and Clique Trees.
Jean R. S. Blair and
Barry W. Peyton,
Graph Theory and Sparse Matrix Computation, eds. J. A. George, J. R. Gilbert and J. W-H. Liu,
IMA Volumes in Mathematics and its Applications, Vol. 56 (1993), Springer-Verlag, pages 1-30.
Practical Parallel Algorithms for Chordal Graphs (Extended Abstract).
Eric S. Kirsch and Jean R. S. Blair,
Proceedings - International Conference on Computing and Information, Ottawa Canada, eds. F. Dehne, F. Fiala, and W. W. Koczkodaj, Springer-Verlag, May 1991, pages 372--382.
Markov Networks for Knowledge Representation Incorporating Probabilities.
Michael G. Thomason and Jean R. S. Blair,
Proceedings: Automated Interpretation of Oceanographic Satellite Data Workshop, Naval Oceanographic and Atmospheric Research Laboratory, Stennis Space Center, September 13-14 1990, pages 177-182.
TR-Matching for Chordal Graphs.
Jean R. S. Blair and
S. S. Ravi,
Proceedings of the Twenty-Seventh Annual Allerton Conference on Communication, Control, and Computing, Urbana-Champaign Illinois, September 1989, pages 72--81.
Generalized River Routing - Algorithms and Performance Bounds.
Jean R. S. Blair and
Errol L. Lloyd,
Proceedings -- Aegean Workshop on Computing, Loutraki Greece, eds. F. Makedon, K. Mehlhorn, T. Papatheodorou, and P. Spirakis, Springer-Verlag, July 1986, pages 317-328.