Jean R. S. Blair - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2024

Seeing the Whole Elephant - A Comprehensive Framework for Data EducationIain J. Cruickshank, Nathaniel D. Bastian, Jean R. S. Blair, Christa M. Chewar, Edward Sobiesk. sigcse 2024: 248-254 [doi]

2022

On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching NumberJean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov. algorithmica, 84(12):3587-3602, 2022. [doi]

2021

2020

Infusing Principles and Practices for Secure Computing Throughout an Undergraduate Computer Science CurriculumJean R. S. Blair, Christa M. Chewar, Rajendra K. Raj, Edward Sobiesk. iticse 2020: 82-88 [doi]

On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching NumberJean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov. latin 2020: 600-612 [doi]

2019

Educating Future Multidisciplinary Cybersecurity TeamsJean R. S. Blair, Andrew O. Hall, Edward Sobiesk. Computer, 52(3):58-66, 2019. [doi]

2016

What is Information Technology's Role in Cybersecurity?Jean R. S. Blair, Edward Sobiesk, Joseph J. Ekstrom, Allen Parrish. sigite 2016: 46-47 [doi]

A Capstone Design Project for Teaching Cybersecurity to Non-technical UsersTanya Estes, James C. Finocchiaro, Jean R. S. Blair, Johnathan Robison, Justin Dalme, Michael Emana, Luke Jenkins, Edward Sobiesk. sigite 2016: 142-147 [doi]

2015

Cyber Education: A Multi-Level, Multi-Discipline ApproachEdward Sobiesk, Jean R. S. Blair, Gregory J. Conti, Michael Lanham, Howard Taylor. sigite 2015: 43-47 [doi]

2014

Meaningful assessmentGeoff Stoker, Jean R. S. Blair, Edward Sobiesk. sigite 2014: 109-114 [doi]

2012

An efficient self-stabilizing distance-2 coloring algorithmJean R. S. Blair, Fredrik Manne. TCS, 444:28-39, 2012. [doi]

2010

Graph Extremities Defined by Search AlgorithmsAnne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet. algorithms, 3(2):100-124, 2010. [doi]

Efficient Self-stabilizing Graph Searching in Tree NetworksJean R. S. Blair, Fredrik Manne, Rodica Mihai. sss 2010: 111-125 [doi]

Experiments on Union-Find Algorithms for the Disjoint-Set Data StructureMd. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik Manne. wea 2010: 411-423 [doi]

2009

An Efficient Self-stabilizing Distance-2 Coloring AlgorithmJean R. S. Blair, Fredrik Manne. sirocco 2010: 237-251 [doi]

2008

On domination and reinforcement numbers in treesJean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steve Horton, Patrick Jones, Grzegorz Kubicki. DM, 308(7):1165-1175, 2008. [doi]

2006

PrefaceAnne Berry, Jean R. S. Blair, Geneviève Simonet. DM, 306(3):293, 2006. [doi]

Avoiding the pratfalls of program assessmentChrista M. Chewar, Kevin L. Huggins, Jean R. S. Blair. SIGCSE, 38(4):29-33, 2006. [doi]

An Undergraduate Success Story: A Computer Science and Electrical Engineering Integrative ExperienceGrant A. Jacoby, Jean R. S. Blair. pervasive, 5(3):11-15, 2006. [doi]

Catch that speeding turtle: latching onto fun graphics in CS1Tanya Markow, Eugene K. Ressler, Jean R. S. Blair. sigada 2006: 29-34 [doi]

Designing an interdisciplinary information technology programEdward Sobiesk, Jean R. S. Blair, James D. Cook, John C. Giordano, Bryan S. Goda, Charles W. Reynolds. sigite 2006: 71-76 [doi]

Faculty development in information technology educationWilliam K. Suchan, Jean R. S. Blair, Duane Fairfax, Bryan S. Goda, Kevin L. Huggins, Mike J. Lemanski. sigite 2006: 15-18 [doi]

2005

Extremities and orderings defined by generalized graph search algorithmsAnne Berry, Jean R. S. Blair, Jean Paul Bordat, Richard Krueger, Geneviève Simonet. endm, 22:413-420, 2005. [doi]

2004

Maximum Cardinality Search for Computing Minimal Triangulations of GraphsAnne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton. algorithmica, 39(4):287-298, 2004. [doi]

Efficient Generic Multi-Stage Self-Stabilizing Algorithms for TreesJean R. S. Blair, Fredrik Manne. ISCApdcs 2004: 333-338

2003

Efficient Self-stabilizing Algorithms for Tree NetworkJean R. S. Blair, Fredrik Manne. icdcs 2003: 20 [doi]

Puzzles and games: addressing different learning styles in teaching operating systems conceptsJohn M. D. Hill, Clark K. Ray, Jean R. S. Blair, Curtis A. Carver Jr.. sigcse 2003: 182-186 [doi]

2002

Maximum Cardinality Search for Computing Minimal TriangulationsAnne Berry, Jean R. S. Blair, Pinar Heggernes. criwg 2002: 1-12 [doi]

2001

A practical algorithm for making filled graphs minimalJean R. S. Blair, Pinar Heggernes, Jan Arne Telle. TCS, 250(1-2):125-141, 2001. [doi]

Evaluating the fidelity of a partitioned digital image halftoning algorithmDavid A. Nash, Jean R. S. Blair, Tommy D. Wagner, Eugene K. Ressler, Barry L. Shoop. spieVIP 2001: 13-23 [doi]

1997

The Undergraduate Capstone Software Design ExperienceJean R. S. Blair, Eugene K. Ressler, Thomas D. Wagner. sigada 1997: 41-47 [doi]

1996

Making an Arbitrary Filled Graph Minimal by Removing Fill EdgesJean R. S. Blair, Pinar Heggernes, Jan Arne Telle. swat 1996: 173-184

River Routing with a Generalized ModelJean R. S. Blair, Errol L. Lloyd. jcss, 53(3):525-544, 1996.

Perfect Recall and Pruning in Games with Imperfect InformationJean R. S. Blair, David Mutchler, Michael van Lent. ci, 12:131-154, 1996.

1994

On Finding Minimum-Diameter Clique TreesJean R. S. Blair, Barry W. Peyton. njc, 1(2):173-201, 1994.

1993

The Efficiency of AC GraphsJean R. S. Blair. DAM, 44(1-3):119-138, 1993. [doi]

1992

Minimizing External Wires in Generalized Single-Row RoutingJean R. S. Blair, Errol L. Lloyd. TC, 41(6):771-776, 1992.

The Impact of wire Topology on Single Row RoutingJean R. S. Blair, Errol L. Lloyd. jcsc, 2(2):101-112, 1992. [doi]

1991

The Benefits of External Wires in Single Row RoutingJean R. S. Blair, Errol L. Lloyd. ipl, 40(1):43-49, 1991.

Practical Parallel Algorithms for Chordal GraphsEric S. Kirsch, Jean R. S. Blair. icci 1991: 372-382

1987

Minimizing Channel Density in Standard Cell LayoutJean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit. algorithmica, 2:267-282, 1987.

1986

Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract)Jean R. S. Blair, Errol L. Lloyd. awoc 1986: 317-328

1985

An optimistic implementation of the stack-heapJean R. S. Blair, Phil Kearns, Mary Lou Soffa. jss, 5(3):193-202, 1985. [doi]

Sign in or sign up to see more results.

runs on WebDSL