# James McHugh

- Ph.D. Applied Mathematics 1970

Courant Institute of Mathematical Sciences

Dissertation: Asymptotic Expansions for Ordinary Differential Equations with Large Parameters. Thesis advisors: Joseph Keller & Robert O´Malley - A.B. Mathematics 1965, Fordham University

**Phi Beta Kappa**- University Teaching Excellence Award 2003
- Woodrow Wilson Nominee
- Perfect Score: 800 on Mathematics GRE
- Courant Institute - Ford Foundation Fellowship
- Brown University - Fellowship for Ph.D. Applied Mathematics
- Notre Dame University - Fellowship for Ph.D. Mathematics
- New York State Regents College Scholarship - 4 years
- New York State Regents Graduate Fellowship - 3 years

**Undergraduate **

- CS 101: Introductory Programming
- CS 213: Introduction to Computer Science
- CS 251: Computer Organization
- CS 331: Assembly Language
- CS 332: Principles of Operating Systems
- CS 335: Data Structures
- CS 341: Logic and Automata Theory
- CS 421: Numerical Analysis
- CS 461: Simulation
- CS 435: Data Structures and Algorithms
- CS 490: Software Engineering
- CS 491: Senior Project - developed and ran for 5 years an extensive capstone project program. Individually mentored large number of students, established departmental project conference - with over 100 students per year. Additionally, extensively advised undergraduate and graduate projects.
- IT 202: Internet Programming

**Graduate Courses **

- CS 610: Data Structures and Algorithms
- CS 665: Algorithmic Graph Theory
- CS 668: Parallel Algorithms
- CS 700: Master´s Project Course

- Collaborative software development, open source development, cognitive science.
- String processing algorithms, algorithmic graph theory.
- Internet technologies, security.

**BOOKS**

*Open Source: Policy and Technology *(with F. Deek), Cambridge University Press, 2007.

*Algorithmic Graph Theory,* Prentice-Hall, 1989.

*Mining The World Wide Web: An Information Search Approach *(with G. Chang, M. Healey, and Jason Wang), Kluwer Academic Publishers, 2001. Japanese edition published 2003.

*Computer-supported Collaboration with Software Applications *(with F. Deek), Kluwer Academic Publishers, 2003.

*Strategic Software Engineering: an Interdisciplinary Approach *(with F. Deek and O. Eljabiri), Auerbach Publications, Taylor & Francis Group, 2005.

**BOOK CHAPTERS **

On Covering the Points of a Graph with Point Disjoint Paths, (with F.Boesch), in Graphs and Combinatorics (F. Harary, editor), Springer-Verlag, New York, 1974, p. 201-212.

Data Structures, in Handbook of Modern Electronics and Electrical Engineering, John-Wiley & Sons, New York, 1986, pp. 2062-2079.

Computer Supported Collaboration, in Computer Science and Engineering Handbook, 2nd edition, A. Tucker (Editor-in-Chief), CRC Press, 2003, with F. Deek.

**REFEREED JOURNAL PUBLICATIONS **

Historical Survey of Ordinary Linear Differential Equations with Large Parameters and Turning Points, Archives for History of Exact Sciences, Vol. 7,1971, 277-324.

Novel Solution of a Lateral Connection Problem, Journal of Differential Equations, Vol.13, 1973, pp. 374-383.

Synthesis of Biconnected Graphs, (with F.Boesch), IEEE Transactions on Circuits and Systems, Vol. CAS-21, 1974, pp. 330-334.

Proof of Bernstein´s Theorem on Regularly Monotonic Functions, Proceedings of the American Mathematical Society, Vol. 47, 1975, pp. 358-360.

Hu´s Precedence Tree Scheduling Algorithm: A Simple Proof, Naval Research Logistics Quarterly, Vol. 31, 1984, 409-411.

An Edge Extremal Result for Subcohesion, (with F.Boesch), Journal of Combinatorial Theory, Series B, Vol. 38, 1985, pp. 1-7.

An Extremal Result for Subconnectivity, (with F. Boesch), Naval Research Logistics Quarterly, Vol.34, 1987, pp. 483-486.