Jean R. S. Blair

Edward Sobiesk

Joseph J. Ekstrom

Allen Parrish

Proceedings of the 17th Annual Conference on Information Technology Education and the 5th Annual Conference on Research in Information Technology, 2016

2015

Cyber Education: A Multi-Level, Multi-Discipline Approach.

[BibT_eX]

[DOI]

Proceedings of the 16th Annual Conference on Information Technology Education, 2015

2014

Meaningful assessment.

[BibT_eX]

[DOI]

Geoff Stoker

Edward Sobiesk

Proceedings of the 15th Annual Conference on Information Technology Education, 2014

2012

An efficient self-stabilizing distance-2 coloring algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

2010

Graph Extremities Defined by Search Algorithms.

[BibT_eX]

[DOI]

Algorithms, 2010

Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure.

[BibT_eX]

[DOI]

Md. Mostofa Ali Patwary

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Efficient Self-stabilizing Graph Searching in Tree Networks.

[BibT_eX]

[DOI]

Rodica Mihai

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

2008

On domination and reinforcement numbers in trees.

[BibT_eX]

[DOI]

Wayne Goddard

Stephen T. Hedetniemi

Steven B. Horton

Patrick Jones

Grzegorz Kubicki

Discret. Math., 2008

2006

Avoiding the pratfalls of program assessment.

[BibT_eX]

[DOI]

Christa M. Chewar

Kevin L. Huggins

ACM SIGCSE Bull., 2006

An Undergraduate Success Story: A Computer Science and Electrical Engineering Integrative Experience.

[BibT_eX]

[DOI]

Grant A. Jacoby

IEEE Pervasive Comput., 2006

Preface.

[BibT_eX]

[DOI]

Anne Berry

Geneviève Simonet

Discret. Math., 2006

Faculty development in information technology education.

[BibT_eX]

[DOI]

Proceedings of the 7th Conference on Information Technology Education, 2006

Designing an interdisciplinary information technology program.

[BibT_eX]

[DOI]

Proceedings of the 7th Conference on Information Technology Education, 2006

Catch that speeding turtle: latching onto fun graphics in CS1.

[BibT_eX]

[DOI]

Tanya Markow

Eugene K. Ressler

Proceedings of the 2006 Annual ACM SIGAda International Conference on Ada, 2006

2005

Extremities and orderings defined by generalized graph search algorithms.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2004

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2004

Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees.

[BibT_eX]

Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003

Puzzles and games: addressing different learning styles in teaching operating systems concepts.

[BibT_eX]

[DOI]

Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, 2003

Efficient Self-stabilizing Algorithms for Tree Network.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

2002

Maximum Cardinality Search for Computing Minimal Triangulations.

[BibT_eX]

[DOI]

Anne Berry

Pinar Heggernes

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001

A practical algorithm for making filled graphs minimal.

[BibT_eX]

[DOI]

Pinar Heggernes

Jan Arne Telle

Theor. Comput. Sci., 2001

Evaluating the fidelity of a partitioned digital image halftoning algorithm.

[BibT_eX]

[DOI]

Proceedings of the Visual Information Processing X, Orlando, FL, USA, April 16, 2001, 2001

1997

The Undergraduate Capstone Software Design Experience.

[BibT_eX]

[DOI]

Eugene K. Ressler

Thomas D. Wagner

Proceedings of the Conference, The annual meeting of the Ada programming world, 1997

1996

River Routing with a Generalized Model.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

Perfect Recall and Pruning in Games with Imperfect Information.

[BibT_eX]

[DOI]

David Mutchler

Michael van Lent

Comput. Intell., 1996

Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.

[BibT_eX]

[DOI]

Pinar Heggernes

Jan Arne Telle

Proceedings of the Algorithm Theory, 1996

1994

On Finding Minimum-Diameter Clique Trees.

[BibT_eX]

Barry W. Peyton

Nord. J. Comput., 1994

1993

The Efficiency of AC Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1993

1992

Minimizing External Wires in Generalized Single-Row Routing.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

The Impact of wire Topology on Single Row Routing.

[BibT_eX]

[DOI]

J. Circuits Syst. Comput., 1992

1991

The Benefits of External Wires in Single Row Routing.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Practical Parallel Algorithms for Chordal Graphs.

[BibT_eX]

[DOI]

Eric S. Kirsch

Proceedings of the Advances in Computing and Information, 1991

1987

Minimizing Channel Density in Standard Cell Layout.

[BibT_eX]

[DOI]

Algorithmica, 1987

1986

Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

An optimistic implementation of the stack-heap.

[BibT_eX]

[DOI]