EDUCATION

 

 	   Institution  		 Date 		  Degree 

 	Mary Washington Univ. 		 1964   	  B.S. 

 	New Mexico Highlands Univ. 	 1968 		  M.S. 

        University of Houston  	         1982  		  Ph.D.  

PROFESSIONAL EXPERIENCE

 
	1998--present	         Professor of Mathematics

				 University of Colorado at Denver

	Fall,1998		 Visiting Professor

				 Florida Atlantic University

 	1989--1998 		 Associate Professor of Mathematics

		     		 University of Colorado at Denver

        Spring,1991  		 Visiting Associate Professor

		                 Florida Atlantic University

        1982--1989  		 Assistant Professor of Mathematics

 		     		 University of Colorado at Denver

        1981--1982  		 Graduate Fellow

 		                 University of Houston

        1979--1981  		 Instructor of Mathematics,

		     		 Stephen F. Austin University

        1975--1977  		 Graduate Fellow

                                 University of Houston

        1967--1969 		 Instructor of Mathematics

 		     		 Universidad de las Americas, Mexico D.F.

        1966--1967 		 Mathematics Assistant

 		     		 New Mexico Highlands University

        1965--1966 		 Teaching Assistant,

 		     		 University of Southern California

AREAS OF INTEREST

Graph theory, applied abstract algebra, mathematical foundations of artificial intelligence and heuristic search

REFEREED PUBLICATIONS

1996

Finding independent sets in triangle-free graphs, SIAM J. Discrete Applied Math. 9: 674-- 681 (with S. C. Locke).

1995

11/30 (finding large independent sets in triangle-free graphs). J. Combin. Theory B 65: 51--72 (with S. C. Locke).

1995

-connected graphs of minimum size. Ars Combinatoria (with D. Fisher and L. Langley).

1995

On -saturated graphs with minimum size. Cong. Numerantium 112, 45--48. (with D. Fisher and L. Langley).

1995

Competition graphs of strongly connected and Hamiltonian digraphs. Siam J. Discrete Math. 8: 179--185 (with J. Lundgren, J. Maybee, S. Merz and N. Pullman).

1995

Conditional chromatic numbers with forbidden cycles. Linear Algebra and its Applications 217: 53--66 (with K. Casey).

1995

Size in maximal triangle-free graphs and minimal graphs of diameter two. Discrete Applied Math. 138: 93--99 (with D. Fisher, K. Casey, F. Harary).

1993

Path assignment for call routing: an application of tabu search. Annals of Operations Research 44: 301--312 (with C. Anderson, M. Parker and J. Ryan).

1991

A suggestion for new niche numbers for graphs. Cong. Numerantium 81: 23--32 (with C. Anderson and R. Lundgren).

1991

competition graphs. Discrete Applied Math. 32: 241--262 (with K. Hefner, S. Kim, R. Lundgren, F. Roberts).

1991

Totally coloring a graph with maximum degree four. Ars Combinatoria 31: 277--285 (with J. Ryan).

1991

What is the difference between the domination and independent domination numbers of a cubic graph? Graphs and Combin. 7: 205--208 (with C. Barefoot, F. Harary).

1991

A two-dimensional genetic algorithm for the Ising problem. J. of Complex Systems 5: 327--333 (with J. Ryan and C. Anderson).

1991

Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices. J. of Combin. Theory B: 73--89 (with D. Gregory, R. Lundgren, N. Pullman).

1990

Size and independence in triangle-free graphs with maximum degree three. J. of Graph Theory 14: 525--535.

1990

Competition multigraphs and the multicompetition number. Ars Combinatoria, 29B: 185--192 (with C. Anderson, J. Lundgren, and T. McKee).

1989

Graphs that are both the upper and lower bound graph of a poset, Ars Combinatoria 28: 109--121 (with D. Bergstrand).

1989

Niche graphs, Discrete Applied Math 23: 231--241 (with C. Cable, R. Lundgren and S. Seager).

1988

On upper bound graphs of partially ordered sets, Cong. Numerantium 66: 181-184 (with D. Bergstrand).

1988

A note on the biclique cover numbers of , and complete t-partite graphs, Cong. Numerantium 66: 181--184 (with R. Lundgren, N. Pullman, R. Rees).

1987

Some remarks on the double competition number of a graph, Cong. Numerantium 60: 17--24 (with R. Lundgren, S. Seager, F. Roberts).

1986

Degree conditional bipartition numbers in graphs, Cong. Numerantium 55: 39--50 (with F. Harary).

1986

Biclique covers of regular digraphs, Cong. Numerantium 53: 147--154 (with C. Barefoot, R. Lundgren, J. Maybee).

1986

Biclique covers of the complements of cycles and paths in a digraph, Cong. Numerantium 53: 133--146 (with C. Barefoot, K. Hefner, R. Lundgren).

1985

Clique covers of digraphs II, Cong. Numerantium 48: 211--218 (with R. Lundgren and J. Maybee).

1985

Maximum bipartite subgraphs and independence, Cong. Numerantium 48: 219--224.

1985

Conditional colorability II: Bipartite variations, Cong. Numerantium 50: 205--218 (with F. Harary).

1984

Independence in graphs with maximum degree four, J. Combin. Theory 37: 254--269.

1984

Minimum independence graphs with maximum degree four, Graphs and Applications (F. Harary and J. Maybee, eds. ) Wiley, New York, 221--230.

1982

Independence in graphs with maximum degree four, Ph.D. dissertation, University of Houston.

1995

Integrated heuristic search procedures for efficient classification, CASI TR-95-04 (with J. Smith and H. Zullo).

1994

Heuristics for efficient classification, CASI TR-94-0. (with J. Ryan and H. Zullo).

1993

Integrated heuristic search procedures for network optimization, CASI TR-93-02 (with M. Parker and J. Ryan).

1992

Tabu search and genetic algorithms for network optimization, CASI TR-92-04 (with J. Ryan and M. Parker).

1991

Tabu search and genetic algorithms for network optimization, CIAI TR-91-02 (with C. Anderson and J. Ryan).

1988

competition graphs, Rutgers Research Report RRR #14-87 (with K. Hefner, S. Kim, R. Lundgren, and F. Roberts).

1986

UC Denver is enriching curriculum, SIAM News, November 4, (with W. Wolfe).

1986

Automatic camera calibration using the perspective view of 3 control points, SPIE Cambridge Symposium on Optical and Optoelectronic Engineering (with W. Wolfe).

1986

Math Clinic -- Robot planning and artificial intelligence, CU-Denver Technical Report RP 986 (with W. Wolfe).

Lower bounds on the size of -free graphs, J. Graph Theory (with S. Locke) (submitted 11/93).

The number of dependent edges in an acyclic orientation, J. Combin. Theory B (with D. Fisher, L. Langley, and D. West). (submitted 9/95, accepted 9/96)

Heuristics for efficient classification, Annals of Operations Research (with T. Cox, J. Ryan and H. Zullo) (12/93)

The domination number of graphs with maximum degree three or less (with D. Fisher and S. Seager) Western Michigan Press(refereed proceedings of Kalamazoo conference (6/96)

Heuristic search and classification with actions (with T. Cox and R. Heymans) Colorado Advanced Software Institute TR Series (2/97).

Uni-intersection graphs, Bull. of the Inst. of Combin. and its Applications (with S. Monson, N. Pullman and R. Rees) (4/97).

MANUSCRIPTS IN PREPARATION

Graphs with maximum degree 3 and maximum domination number, with D. Fisher and S. Seager

Coloring without cycles and paths in graphs whose complements are acyclic (with M. Dillon).

Coloring without triangles is NP-complete (with M. Dillon).

Coloring without paths in graphs of large order (with M. Dillon).

1994

Classification with Actions. Colorado Advanced Software Institute. $31,000.

1993

Integrated Heuristic Search Procedures for Efficient Classification. Colorado Advanced Software Institute. $32,000.

1992

Heuristics for Efficient Classification. Colorado Advanced Software Institute. $30,000 (with J. Ryan).

1991

Integrated heuristic search procedures for network optimization, Colorado Advanced Software Institute, $30,000 (with J. Ryan).

1990

Tabu Search and genetic algorithms for network optimization, Colorado Institute for Artificial Intelligence, $30,000 (with J. Ryan).

1989

Tabu Search and genetic algorithms for network optimization, Colorado Institute for Artificial Intelligence, $30,000 (with J. Ryan).

1994

CU-Denver Outstanding Research Award

1994

Colorado Advanced Software Institute Exemplary Researcher Award

1993

Colorado Advanced Software Institute Exemplary Researcher Award

1993

CU-Denver Outstanding Service Award

1992

Colorado Advanced Software Institute Exemplary Researcher Award

PRESENTATIONS AT MEETINGS OR SEMINARS

1997

``Graphs with maximum degree 3 and maximum domination number,'' 28th S.E. International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida.

1996

``Domination in graphs with maximum degree three or less,'' 8th International Conference on Graph Theory, Combinatorics, Algorithms and Applications, Western Michigan Univ., Kalamazoo, Michigan.

1996

``Characterizing graphs for which cc(G)=cp(G),'' research seminar, Old Dominion University, Norfolk, Virginia

1995

``Classification with actions,'' CASI Research Symposium, Denver, Colorado.

1995

``-connected graphs of minimum size,'' 26th S.E. International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida.

1994

``Integrated heuristic search procedures for efficient classification,'' CASI Research Symposium, Denver, Colorado.

1994

``Finding independent sets in triangle-free graphs,'' SIAM Conference on Discrete Mathematics, Albuquerque, New Mexico

1994

``Finding independent sets in triangle-free graphs,'' Queens University, Kingston, Ontario.

1994

``Condition coloring with forbidden cycles,'' 25th S.E. International Conference on Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida.

1993

``Heuristics for efficient classification,'' CASI Research Symposium, Denver, Colorado.

1993

``Size in maximal triangle-free graphs and minimal graphs of diameter two,'' 14th British Combinatorial Conference, Keele University, U.K.

1993

``Size in maximal triangle-free graphs and minimal graphs of diameter two,'' invited presentation in special session on ``Beautiful Graph Theory'', A.M.S., DeKalb, Illinois.

1993

``Conditional coloring: color classes without cycles,'' John Maybee Conference, Boulder, Colorado.

1993

``Size and independence in -free graphs,'' 24th S.E. International Conference on Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida.

1993

``Heuristic algorithms and communication networks,'' National Transportation and Intercommunications Agency, Boulder, Colorado.

1992

``Lower bounds on size in -free graphs,'' University of Wyoming.

1992

``Lower bounds on size in -free graphs,'' SIAM Conference on Discrete Mathematics, Vancouver, B.C.

1992

``Path assignment for call routing: an application of Tabu search,'' 23rd S.E. International Conference on Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida.

1991

``Uniquely intersectable graphs,'' 22nd S.E. International Conference in Graph Theory and Computing, L.S.U., Baton Rouge, Louisiana.

1990

``Uniquely intersectable graphs,'' Queens University, Kingston, Ontario

1990

``Competition graphs of strongly connected digraphs,'' Queens University, Kingston, Ontario

1990

``Genetic and tabu search algorithms for the Ising problem,'' Williams College, Williams, Mass.

1990

``A 2-dimensional genetic algorithm,'' 21st S.E. International Conference in Graph Theory and Computing, Florida Atlantic University, Boca Raton, Florida.

1989

``Multicompetition graphs and the multicompetition number,'' Twelfth British Combinatorial Conference, University of East Anglia, England.

1989

``Bounds on the competition number of a graph,'' Second International Conference in Graph Theory Combinatorics and Computing.

1989

``Size and independence in graphs with maximum degree three,'' 20th S.E. International Conference on Graph Theory and Computing.

1988

``Graphs that are both the upper and lower bound graph of a poset,'' 3rd ARIDAM Conference, Rutgers University, Rutgers, Mass.

1988

``A note on the biclique cover numbers of ,'' 19th S.E. International Conference on Graph Theory and Computing.

1987

``Competition, competition-common enemy, and niche graphs,'' 2nd ARIDAM Conference, Rutgers University, Rutgers, Mass.

1987

``Some remarks on the double competition number of a graph,'' 18th S.E. International Conference on Graph Theory and Computing.

1986

``Degree conditional bipartition numbers in graphs,'' 17th S.E. International on Graph Theory and Computing.

1985

``Maximum bipartite subgraphs and independence,'' 16th S.E. International Conference on Graph Theory and Computing.

1984

``Conditional colorability II: Bipartite variations,'' 15th S.E. International Conference on Graph Theory and Computing.

1983

``Minimum independence graphs with maximum degree four,'' First Colorado Symposium on Graph Theory, C. U. Boulder, Boulder, Co.

1982

``Independence in graphs with maximum degree four,'' M. A. A. Regional Conference.

Association for Women in Mathematics

Mathematical Association of America

Society for Industrial and Applied Mathematics

OTHER PROFESSIONAL ACTIVITIES Member of Operating Board of Colorado Advanced Software Institute, 1987 -- 1995.

Co-Program Chair of Rocky Mountain Section of MAA, 1987 -- 1988.

Consultant, U.S. Geological Survey, 1988.

Referee for various journals, 1983 -- present.

Reviewer for Mathematical Reviews, 1994 -- present.

Book reviewer for Networks, 1996.