2008 |
26 | EE | Jean R. S. Blair,
Wayne Goddard,
Stephen T. Hedetniemi,
Steve Horton,
Patrick Jones,
Grzegorz Kubicki:
On domination and reinforcement numbers in trees.
Discrete Mathematics 308(7): 1165-1175 (2008) |
2006 |
25 | EE | Tanya Markow,
Eugene K. Ressler,
Jean R. S. Blair:
Catch that speeding turtle: latching onto fun graphics in CS1.
SIGAda 2006: 29-34 |
24 | EE | William K. Suchan,
Jean R. S. Blair,
Duane Fairfax,
Bryan S. Goda,
Kevin L. Huggins,
Mike J. Lemanski:
Faculty development in information technology education.
SIGITE Conference 2006: 15-18 |
23 | EE | Edward Sobiesk,
Jean R. S. Blair,
James D. Cook,
John C. Giordano,
Bryan S. Goda,
Charles W. Reynolds:
Designing an interdisciplinary information technology program.
SIGITE Conference 2006: 71-76 |
22 | EE | Anne Berry,
Jean R. S. Blair,
Geneviève Simonet:
Preface.
Discrete Mathematics 306(3): 293 (2006) |
21 | EE | Grant A. Jacoby,
Jean R. S. Blair:
An Undergraduate Success Story: A Computer Science and Electrical Engineering Integrative Experience.
IEEE Pervasive Computing 5(3): 11-15 (2006) |
20 | EE | Christa M. Chewar,
Kevin L. Huggins,
Jean R. S. Blair:
Avoiding the pratfalls of program assessment.
SIGCSE Bulletin 38(4): 29-33 (2006) |
2005 |
19 | EE | Anne Berry,
Jean R. S. Blair,
Jean Paul Bordat,
Richard Krueger,
Geneviève Simonet:
Extremities and orderings defined by generalized graph search algorithms.
Electronic Notes in Discrete Mathematics 22: 413-420 (2005) |
2004 |
18 | | Jean R. S. Blair,
Fredrik Manne:
Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees.
ISCA PDCS 2004: 333-338 |
17 | EE | Anne Berry,
Jean R. S. Blair,
Pinar Heggernes,
Barry W. Peyton:
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.
Algorithmica 39(4): 287-298 (2004) |
2003 |
16 | EE | Jean R. S. Blair,
Fredrik Manne:
Efficient Self-stabilizing Algorithms for Tree Network.
ICDCS 2003: 20- |
15 | EE | John M. D. Hill,
Clark K. Ray,
Jean R. S. Blair,
Curtis A. Carver Jr.:
Puzzles and games: addressing different learning styles in teaching operating systems concepts.
SIGCSE 2003: 182-186 |
2002 |
14 | EE | Anne Berry,
Jean R. S. Blair,
Pinar Heggernes:
Maximum Cardinality Search for Computing Minimal Triangulations.
WG 2002: 1-12 |
2001 |
13 | EE | Jean R. S. Blair,
Pinar Heggernes,
Jan Arne Telle:
A practical algorithm for making filled graphs minimal.
Theor. Comput. Sci. 250(1-2): 125-141 (2001) |
1997 |
12 | EE | Jean R. S. Blair,
Eugene K. Ressler,
Thomas D. Wagner:
The Undergraduate Capstone Software Design Experience.
TRI-Ada 1997: 41-47 |
1996 |
11 | | Jean R. S. Blair,
Pinar Heggernes,
Jan Arne Telle:
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.
SWAT 1996: 173-184 |
10 | | Jean R. S. Blair,
David Mutchler,
Michael van Lent:
Perfect Recall and Pruning in Games with Imperfect Information.
Computational Intelligence 12: 131-154 (1996) |
9 | | Jean R. S. Blair,
Errol L. Lloyd:
River Routing with a Generalized Model.
J. Comput. Syst. Sci. 53(3): 525-544 (1996) |
1994 |
8 | | Jean R. S. Blair,
Barry W. Peyton:
On Finding Minimum-Diameter Clique Trees.
Nord. J. Comput. 1(2): 173-201 (1994) |
1993 |
7 | EE | Jean R. S. Blair:
The Efficiency of AC Graphs.
Discrete Applied Mathematics 44(1-3): 119-138 (1993) |
1992 |
6 | | Jean R. S. Blair,
Errol L. Lloyd:
Minimizing External Wires in Generalized Single-Row Routing.
IEEE Trans. Computers 41(6): 771-776 (1992) |
1991 |
5 | | Eric S. Kirsch,
Jean R. S. Blair:
Practical Parallel Algorithms for Chordal Graphs.
ICCI 1991: 372-382 |
4 | | Jean R. S. Blair,
Errol L. Lloyd:
The Benefits of External Wires in Single Row Routing.
Inf. Process. Lett. 40(1): 43-49 (1991) |
1987 |
3 | | Jean R. S. Blair,
Sanjiv Kapoor,
Errol L. Lloyd,
Kenneth J. Supowit:
Minimizing Channel Density in Standard Cell Layout.
Algorithmica 2: 267-282 (1987) |
1986 |
2 | | Jean R. S. Blair,
Errol L. Lloyd:
Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract).
Aegean Workshop on Computing 1986: 317-328 |
1985 |
1 | EE | Jean R. S. Blair,
Phil Kearns,
Mary Lou Soffa:
An optimistic implementation of the stack-heap.
Journal of Systems and Software 5(3): 193-202 (1985) |