default search action
Jean R. S. Blair
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Iain J. Cruickshank
, Nathaniel D. Bastian
Seeing the Whole Elephant - A Comprehensive Framework for Data Education. SIGCSE (1) 2024: 248-254 - 2022
- [j21]Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. Algorithmica 84(12): 3587-3602 (2022) - 2021
- [j20]Jean R. S. Blair
On the effectiveness of the incremental approach to minimal chordal edge modification. Theor. Comput. Sci. 888: 1-12 (2021) - [c23]Jean R. S. Blair, Lawrence Jones, Paul M. Leidig, Scott Murray, Rajendra K. Raj
Establishing ABET Accreditation Criteria for Data Science. SIGCSE 2021: 535-540 - [c22]Raymond W. Blaine, Jean R. S. Blair, Christa M. Chewar
Creating a Multifarious Cyber Science Major. SIGCSE 2021: 1205-1211 - 2020
- [c21]Jean R. S. Blair, Christa M. Chewar
Infusing Principles and Practices for Secure Computing Throughout an Undergraduate Computer Science Curriculum. ITiCSE 2020: 82-88 - [c20]Jean R. S. Blair, Pinar Heggernes, Paloma T. Lima, Daniel Lokshtanov:
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number. LATIN 2020: 600-612
2010 – 2019
- 2019
- [j19]Jean R. S. Blair, Andrew O. Hall
Educating Future Multidisciplinary Cybersecurity Teams. Computer 52(3): 58-66 (2019) - 2016
- [c19]Jean R. S. Blair, Edward Sobiesk, Joseph J. Ekstrom, Allen Parrish:
What is Information Technology's Role in Cybersecurity? SIGITE 2016: 46-47 - [c18]Tanya Estes, James C. Finocchiaro, Jean R. S. Blair, Johnathan Robison, Justin Dalme, Michael Emana, Luke Jenkins, Edward Sobiesk:
A Capstone Design Project for Teaching Cybersecurity to Non-technical Users. SIGITE 2016: 142-147 - 2015
- [c17]Edward Sobiesk, Jean R. S. Blair, Gregory J. Conti, Michael Lanham, Howard Taylor:
Cyber Education: A Multi-Level, Multi-Discipline Approach. SIGITE 2015: 43-47 - 2014
- [c16]Geoff Stoker, Jean R. S. Blair, Edward Sobiesk:
Meaningful assessment. SIGITE 2014: 109-114 - 2012
- [j18]Jean R. S. Blair, Fredrik Manne:
An efficient self-stabilizing distance-2 coloring algorithm. Theor. Comput. Sci. 444: 28-39 (2012) - 2010
- [j17]Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet:
Graph Extremities Defined by Search Algorithms. Algorithms 3(2): 100-124 (2010) - [c15]Jean R. S. Blair, Fredrik Manne, Rodica Mihai
Efficient Self-stabilizing Graph Searching in Tree Networks. SSS 2010: 111-125 - [c14]Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik Manne:
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. SEA 2010: 411-423
2000 – 2009
- 2009
- [c13]Jean R. S. Blair, Fredrik Manne:
An Efficient Self-stabilizing Distance-2 Coloring Algorithm. SIROCCO 2009: 237-251 - 2008
- [j16]Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steven B. Horton, Patrick Jones, Grzegorz Kubicki:
On domination and reinforcement numbers in trees. Discret. Math. 308(7): 1165-1175 (2008) - 2006
- [j15]Anne Berry, Jean R. S. Blair, Geneviève Simonet:
Preface. Discret. Math. 306(3): 293 (2006) - [j14]Grant A. Jacoby, Jean R. S. Blair:
An Undergraduate Success Story: A Computer Science and Electrical Engineering Integrative Experience. IEEE Pervasive Comput. 5(3): 11-15 (2006) - [j13]Christa M. Chewar
Avoiding the pratfalls of program assessment. ACM SIGCSE Bull. 38(4): 29-33 (2006) - [c12]Tanya Markow, Eugene K. Ressler, Jean R. S. Blair:
Catch that speeding turtle: latching onto fun graphics in CS1. SIGAda 2006: 29-34 - [c11]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 - [c10]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 - 2005
- [j12]Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Richard Krueger, Geneviève Simonet:
Extremities and orderings defined by generalized graph search algorithms. Electron. Notes Discret. Math. 22: 413-420 (2005) - 2004
- [j11]Anne Berry, Jean R. S. Blair, Pinar Heggernes
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. Algorithmica 39(4): 287-298 (2004) - [c9]Jean R. S. Blair, Fredrik Manne:
Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees. PDCS 2004: 333-338 - 2003
- [c8]Jean R. S. Blair, Fredrik Manne:
Efficient Self-stabilizing Algorithms for Tree Network. ICDCS 2003: 20- - [c7]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
- [c6]Anne Berry, Jean R. S. Blair, Pinar Heggernes:
Maximum Cardinality Search for Computing Minimal Triangulations. WG 2002: 1-12 - 2001
- [j10]Jean R. S. Blair, Pinar Heggernes
A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. 250(1-2): 125-141 (2001) - [c5]David A. Nash, Jean R. S. Blair, Tommy D. Wagner, Eugene K. Ressler, Barry L. Shoop:
Evaluating the fidelity of a partitioned digital image halftoning algorithm. Visual Information Processing 2001: 13-23
1990 – 1999
- 1997
- [c4]Jean R. S. Blair, Eugene K. Ressler, Thomas D. Wagner:
The Undergraduate Capstone Software Design Experience. TRI-Ada 1997: 41-47 - 1996
- [j9]Jean R. S. Blair, David Mutchler, Michael van Lent:
Perfect Recall and Pruning in Games with Imperfect Information. Comput. Intell. 12: 131-154 (1996) - [j8]Jean R. S. Blair, Errol L. Lloyd:
River Routing with a Generalized Model. J. Comput. Syst. Sci. 53(3): 525-544 (1996) - [c3]Jean R. S. Blair, Pinar Heggernes
Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. SWAT 1996: 173-184 - 1994
- [j7]Jean R. S. Blair, Barry W. Peyton:
On Finding Minimum-Diameter Clique Trees. Nord. J. Comput. 1(2): 173-201 (1994) - 1993
- [j6]Jean R. S. Blair:
The Efficiency of AC Graphs. Discret. Appl. Math. 44(1-3): 119-138 (1993) - 1992
- [j5]Jean R. S. Blair, Errol L. Lloyd:
The Impact of wire Topology on Single Row Routing. J. Circuits Syst. Comput. 2(2): 101-112 (1992) - [j4]Jean R. S. Blair, Errol L. Lloyd:
Minimizing External Wires in Generalized Single-Row Routing. IEEE Trans. Computers 41(6): 771-776 (1992) - 1991
- [j3]Jean R. S. Blair, Errol L. Lloyd:
The Benefits of External Wires in Single Row Routing. Inf. Process. Lett. 40(1): 43-49 (1991) - [c2]Eric S. Kirsch, Jean R. S. Blair:
Practical Parallel Algorithms for Chordal Graphs. ICCI 1991: 372-382
1980 – 1989
- 1987
- [j2]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
- [c1]Jean R. S. Blair, Errol L. Lloyd:
Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract). Aegean Workshop on Computing 1986: 317-328 - 1985
- [j1]Jean R. S. Blair, Phil Kearns, Mary Lou Soffa:
An optimistic implementation of the stack-heap. J. Syst. Softw. 5(3): 193-202 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: