Follow
Jean Blair
Jean Blair
Distinguished Professor of Innovation and Professor of Computer Science, United States Military
Verified email at westpoint.edu
Title
Cited by
Cited by
Year
An introduction to chordal graphs and clique trees
JRS Blair, B Peyton
Graph theory and sparse matrix computation, 1-29, 1993
7321993
Maximum cardinality search for computing minimal triangulations of graphs
A Berry, JRS Blair, P Heggernes, BW Peyton
Algorithmica 39, 287-298, 2004
1652004
Puzzles and games: addressing different learning styles in teaching operating systems concepts
JMD Hill, CK Ray, JRS Blair, CA Carver Jr
Proceedings of the 34th SIGCSE technical symposium on Computer science …, 2003
1232003
A practical algorithm for making filled graphs minimal
JRS Blair, P Heggernes, JA Telle
Theoretical Computer Science 250 (1-2), 125-141, 2001
842001
Experiments on union-find algorithms for the disjoint-set data structure
MMA Patwary, J Blair, F Manne
Experimental Algorithms: 9th International Symposium, SEA 2010, Ischia …, 2010
662010
Cyber education: a multi-level, multi-discipline approach
E Sobiesk, J Blair, G Conti, M Lanham, H Taylor
Proceedings of the 16th annual conference on information technology …, 2015
642015
Maximum cardinality search for computing minimal triangulations
A Berry, JRS Blair, P Heggernes
Graph-Theoretic Concepts in Computer Science: 28th International Workshop …, 2002
502002
Efficient self-stabilizing algorithms for tree networks
JRS Blair, F Manne
23rd International Conference on Distributed Computing Systems, 2003 …, 2003
462003
Educating future multidisciplinary cybersecurity teams
JRS Blair, AO Hall, E Sobiesk
Computer 52 (3), 58-66, 2019
412019
Games with imperfect information
JRS Blair, D Mutchler, C Liu
Proceedings of the AAAI Fall Symposium on Games: Planning and Learning, AAAI …, 1993
391993
Broadcast domination algorithms for interval graphs, series-parallel graphs, and trees
JRS Blair, P Heggernes, S Horton, F Manne
University of Bergen. Department of Informatics, 2003
372003
On finding minimum-diameter clique trees
JRS Blair, BW Peyton
Oak Ridge National Lab.(ORNL), Oak Ridge, TN (United States), 1991
341991
An efficient self-stabilizing distance-2 coloring algorithm
JRS Blair, F Manne
Theoretical Computer Science 444, 28-39, 2012
332012
Graph extremities defined by search algorithms
A Berry, JRS Blair, JP Bordat, G Simonet
Algorithms 3 (2), 100-124, 2010
322010
Movable dominating sensor sets in networks
J Blair, R Gera, S Horton
JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing 77, 103, 2011
292011
PERFECT RECALL AND PRUNING IN GAMES WITH IMPERFECT INFORMATION 1
JRS Blair, D Mutchler, M Van Lent
Computational Intelligence 12 (1), 131-154, 1996
231996
Infusing principles and practices for secure computing throughout an undergraduate computer science curriculum
JRS Blair, CM Chewar, RK Raj, E Sobiesk
Proceedings of the 2020 ACM Conference on Innovation and Technology in …, 2020
202020
On domination and reinforcement numbers in trees
JRS Blair, W Goddard, ST Hedetniemi, S Horton, P Jones, G Kubicki
Discrete mathematics 308 (7), 1165-1175, 2008
202008
Making an arbitrary filled graph minimal by removing fill edges
JRS Blair, P Heggernes, JA Telle
Scandinavian Workshop on Algorithm Theory, 173-184, 1996
201996
The efficiency of AC graphs
JRS Blair
Discrete applied mathematics 44 (1-3), 119-138, 1993
141993
The system can't perform the operation now. Try again later.
Articles 1–20