GRANTS AND AWARDS
Recent Grant Funding
- NSF grant, "Preparing Mathematicians to Educate Teachers," co-project
director, $3,100,000, 2003-2007.
- NSF grant, "Interconnecting Research and
Education in the Mathematical Sciences at Stony Brook," co-project
director, $1,300,000, 2000-2004.
- NSF grant ,"Long Island Consortium for Interconnected Learning,"
project director, $2,800,000, 1996-00.
- NSF Research Careers for Minority Scholars grant, co-project dire
ctor, $1,050,000, 1992-96.
- Department of Education Grants for Graduate Assistance Applied to
National Needs, project director, $400,000, 1990-93;$410,000, 1991-1
994; $690,000, 1998-01; $405,000, 2000-2003.
- NSF grant, "Case Studies in Exemplary Undergraduate Programs," project director, $83,000, 1992-95.
- NSF grant, "Assessing Calculus Reform Effort," co-PI, $180,000, 1
991-94.
- NSF equipment grant, "Workstations for Computational Statistics,"
project director, $33,000, 1994-95.
- NSF grants in precalculus and freshman mathematics, member of wri
ting teams, 1991-95.
Major Past Grants
- National Science Foundation Math Sciences/Computer Science Resear
ch Grants, 1972-1986
- National Science Foundation Policy Analysis Grant, 1981-1983
- Gas Research Institute Energy Modeling Grant, 1981-1983
- Sloan Foundation Curriculum Grant (for CUPM Project), 1979-1982
Teaching and Educational Awards
- SUNY Chancellor's Award for Excellence in Teaching, 1974
- SUNY Distinguished Teaching Professorship, 1989-
- Award for Distinguished Teaching, Metropolitan New York Section o
f Math Assoc. of America, 1993
- National Award for Distinguished Teaching of Mathematics, Math As
soc. of America, 1994
- Trevor Evans Award, Mathematical Assoc. of America, 1996
- PBS/Annenberg Foundation Award for Innovative Programs Using Tec
hnology, 1997
Dissertation Students
Malcolm Easton 1973, Austin Teng 1982, Donna Wilson 1983, T-H Wu
1983, Svetlana Dynin 1985
PUBLICATIONS
Doctoral Dissertation: Two Characterizations of Proper Circula
r-arc Graphs, advisors: G. Dantzig and D.R. Fulkerson, Stanford Unive
rsity, 1969.
Books:
- APPLIED COMBINATORICS, John Wiley & Sons, First Edition 1980
; Second Edition 1984; Third Edition, 1995; Fourth Edition, 2001;
Fifth Edition, 2007.
- A UNIFIED INTRODUCTION TO LINEAR ALGEBRA: MODELS, METHODS, AND TH
EORY,
MacMillan Publishing Co., 1988.
- LINEAR ALGEBRA: An Introduction to the Theory and Use of Vectors
and Matrices, MacMillan Publishing Co (now Prentice-Hall), 1994.
- FUNCTIONING IN THE REAL WORLD, co-author, Addison-Wesley, Reading
, MA, 1997, Second Eidtion, 2003, 425 pages.
- PRINCIPLES AND PRACTICES OF MATHEMATICS, co-author, Springer, New
York, 686 pages, 1997.
Articles
- Characterizing the Consecutive 1's Property, Proc. 2nd Ch
apel Hill Conf. on Combinatorial Math. and Its Appl., 1970, p.472
-477.
- Optimizing Binary Trees (with T.C. Hu), Proc. 2nd Chapel Hill
Conf. on Combinatorial Math. and Its Appl., 1970, p.285-305.
- Characterizing Circular-arc Graphs, Bulletin Amer. Math. Soc.<
/I>, 76 (1970), p.1257-1260.
- Heuristics in Manpower Scheduling (with E. Beltrami, L. Bodin, S.
Altman), SUNY-Stony Brook Urban Science Report #8, 1971.
- Optimal Computer Search Trees and Variable Length Alphabetical Co
des (with T.C. Hu), SIAM J. Applied Math. 2 (1971), p.
514-532.
- Matrix Characterizations of Circular-arc Graphs, Pacific J. Ma
th. 39 (1971), p.535-545.
- A Structure Theorem for the Consecutive 1's Property, J. Combi
natorial Theory 12 (1972), p.153-162.
- The Strong Perfect Graph Theorem for Planar Graphs, Canadian J
. Math. 25 (1973), p.103-114.
- Perfect Graphs and an Application to Refuse Collection, SIAM
Review 15 (1973), p.585-590.
- Structure Theorems for Some Classes of Circular-arc Graphs, D
iscrete Math. 7 (1974), p.167-195.
- Polya's Enumeration Formula by Example, Math. Mag. 47
(1974), p.248-256.
- The Strong Perfect Graph Conjecture and an Application to a Muni
cipal Routing Problem, Graph Theory and Its Appl., Spring-Verl
ag, 1974, p.297-303.
- The Cost of a Class of Optimal Binary Trees, J. Combinatorial
Theory B 16 (1974), p.259-263.
- Towards a Mathematics Major for the 1980's, Amer. Math. Month
ly 81 (1974), p.891-899.
- Coloring a Family of Circular Arcs, SIAM J. Applied Math.
29 (1975), p.493-502.
- A Model for Municipal Street Sweeping Operations, Case Studie
s in Applied Math., Math. Assoc. of Amer., 19 [reprinted in Di
screte and System Models (ed. W. Lucas), Birkhauser Boston, 1983,
p.76-111].
- A New Proof of the Euler Circuit Theorem and its Application to
Street Sweeping, Amer. Math. Monthly 83 (1976), p.638-
641.
- Ideas for an Applications-Oriented Graph Theory Course, Proc.
of Conf. on Math. Models and Appl. in Undergraduate Math. (ed. M
. Thompson), Indiana Univ., 1976, p.139-165.
- Critical Perfect Graphs and Perfect 3-Chromatic Graphs, J. Co
mbinatorial Theory B 23 (1977), p.143-149.
- A Note on the Convergence of the Ford-Fulkerson Flow Algorithm,
Math. of Operations Research 2 <1977), p.143-144.
- Circular-arc Graphs: New Uses and a New Algorithm, Proc. Inte
rnational Conf. of Graph Theory and Its Appl. (ed. D. Lick), Spri
nger-Verlag, 1978, p.580-589.
- On Berge's Strong Perfect Graph Conjecture, Annals NY Acad. S
ci. 319 (1979), p.530-535.
- Core Computer Science Curriculum and Mathematics, Computer Sci
ence and the Math. Sciences: Interfaces and Overlaps, Conf. Board
of Math. Sciences, 1979, p.21-25.
- An Efficient Test for Circular-arc Graphs, SIAM J. of Computin
g 9 (1980), p.1-25.
- Linear and Circular Models for Graphs, UMAP Journal 1
(1980), p.35-46.
- Redefining the Mathematics Major, Mathematics Tomorrow (e
d. L. Steen), Academic Press, 1981, p.47-55.
- Recommendations for a General Mathematical Sciences Major
(report of the CUPM Panel on a General Mathematical Sciences Program
), Math. Assoc. Amer., 1982.
- Principles for a Lower-Division Discrete-Systems-Oriented Mathem
atics Sequence, The Future of College Mathematics (ed. A. Rals
ton & G. Young), Springer-Verlag, 1983, p.135-144.
- A Matroid Related to Finite Chainlike, Countably Infinite Networ
ks (with A. Zemanian), Networks 12 (1982), p.453-457.
- Energy/Economy Mdel Linkage and Assessment (with M. Schnader, K
. Hendricks, K. Tingley, N. Huslak), Brookhaven National Laboratory R
eport No. 33728, 1982.
- Uniquely Colorable Perfect Graphs, Discrete Math. 44
(1983), p.187-194.
- CUPM's Proposed Mathematics Sciences Major, Proc. 4th Interna
tional Congress on Math. Education (ed. M. Zweng), Birkhauser, 1
983, p.73-77.
- Coloring Graphs with Stable Cutsets, J. Combinatorial Theory
B 34 (1983), p.258-267.
- An 0(n2) Algorithm for Coloring Planar Perfect Graphs (with D. W
ilson), J. of Algorithms 5 (1984), p. 60-68.
- The Validity of The Perfect Graph Conjecture for K4-free Graphs,
Topics in Perfect Graphs (ed. C. Berge & V. Chvatal), Anna
ls of Discrete Math. 21 (1985), p. 149-157.
- The Validity of The Perfect Graph Conjecture for a Class of Part
itionable Graphs, (with R. Giles and L. Trotter), Topics in Perfec
t Graphs (ed. C. Berge & V. Chvatal), Annals of Discrete Math.
21 (1985), p. 82-95.
- A New Start for Mathematics Curriculum, The First Two Years C
ollege Math. (ed. D. Albers), Springer-Verlag, 1985, p.145-152.
- An 0(qn) Algorithm to q-Color a Proper Family of Circular Arcs (
with A. Teng), Discrete Math. 55 (1985), p. 233-243.
- Coloring Perfect (K4-e)-free Graphs, J. Combinatorial Theory
B 42 (1987), p. 313-318.
- A Reduction Procedure for Coloring Perfect K4-free Graphs, J.
Combinatorial Theory B 43 (1987), p. 151-173.
- The Use of Computing in Teaching Linear Algebra (with H. Anton,
E. Herman and G. Helzer),
Computers and Mathematics, Math. Assoc. of America, Washington
DC, 1988, pp. 55-61.
- Greedy Packing and Series-Parallel Graphs (with A. Hoffman),
J. Combinatorial Theory A 47 (1988), p.6-15.
- Trends in Mathematics: Bad News, Good News, FOCUS 8 (1989), p.2-3.
- Agenda of the MAA's New Education Council, UME Trends
3 #1(1991), p. 3.
- Computers in Undergraduate Mathematics, Mathematics in Colleg
e, Winter 1992, p 62-63.
- Moving Beyond Moving Beyond Myths, UME Trends 4 (1
992), #3, p.4.
- The Growing Importance of Linear Algebra in Undergraduate Mathem
atics, College Mathematics Journal, 24 (1993), p. 3-9.
- Balanced Matrices with Row Sum 3, Discrete Mathematics, 132 (1994), p. 395-399.
- The Art Gallery Problem, Mathematical Horizons, 2
no. 1 (1994), p. 7-9.
- Assessing Calculus Reform Efforts, (with Jim Leitzel), Ma
thematical Assoc. of America, Washington, 1995, 97 pages.
- The Parallel Climbers Problem, Mathematical Horizons,
3 no. 2 (1995), p. 22-24.
- Models That Work: Case Studies in Effective Undergraduate Mat
hemtics Programs, MAA Notes # 38, Mathematical Association of Ame
rica, Washington, DC, 1996, 78 pages.
- Matrices and Matrix Algebra, article in Encyclopedia of Opera
tions Research, ed. S. Gaus and and C. Harris, North-Holland, 199
6, p. 381-384.
- The Role of Linear Algebra in Undergraduate Mathematics, Reso
urces for Teaching Linear Algebra, ed. D Carlson et al., Math. As
soc. of America, Washington DC, 1997., pages 5-12.
- Discrete Mathematics in the Core Curriculum, Confronting the
Core Curriculum, John Dossey, ed., MAA Notes #45, Mathematical A
ssociation of America, Washington, DC., 1998.
- Polya's Counting Formula, section in CRC Handbook on Combinatorics,
K Rosen et al, editors, CRC Press, New York, 2000, p. 120-127.
- "New Thinking about the Mathematical Education of Teachers," Dialogues
of NCTM, vol 4, #2, 2000, p.3.
- "The CBMS Mathematical Education of Teachers Report," Proceedings
of the Michigan State-Math Assoc of Amer. Conference on the Mathematical
Education of Teachers, 2000.
- "CBMS Preparing Report on Teacher Education," FOCUS, Math. Assoc.
of Amer., October 2000 vol. 21, #6, p.6.
- "What Kinds of Mathematical Knowledge Matter in Teaching," Knowing
and Learning Mathematics, National Acad. Press, Washington, DC, 2001.
- "Playbook of the Long Island Consortium for Interconnected Learning,"
PRIMUS, 2002.
- "Perfect Graphs," chapter in CRC Handbook on Graph Theory, J. Gross and
J. Yellen, ed., CRC Press, 2003.
- "Polynomial Time Recognition of Unit Circular-arc Graphs," with G. Duran,
A. Gravano and J. Spinrad, submitted for publication.