- Proposer, developer, and instructor of a semester-long graduate seminar course, Topics in Probabilistic Methods for Discrete Mathematics, in Fall 2005.

(Participants include Faculty members from Mathematics, Computer Science, and Business School; and Graduate students from Mathematics, Computer Science, Electrical and Computer Engineering, Mechanical and Industrial Engineering, and Physics.)

- Instructor for the following courses with full responsibility including lectures, review sessions, creating exams, and evaluating student performance:
- Introductory Linear Algebra (Math 225) [In multiple semesters]

Topics include systems of linear equations, matrices and inverses, determinants, vector spaces, eigenvalues and eigenvectors, dimension, diagonalization, orthogonal decomposition, applications. - Second course in Calculus and Analytic Geometry (Math 230) [In multiple semesters]

Topics include advanced techniques of integration, conic sections, polar coordinates, infinite sequences and series. - Instructor for the discussion sections of the following course:
- Elementary Mathematics (Math 117)

Analyses of the mathematical issues and methodology underlying elementary mathematics in grades 6-8. Topics include the Real number system and field axioms, sequences and series, functions and math modeling with technology, Euclidean and non-Euclidean geometry, probability and statistics. - TA for the following advanced undergraduate and graduate courses with various responsibilities ranging from grading to holding classroom lectures:
- Linear programming (Math 383)

Introduction to a wide range of topics in optimization, including a thorough treatment of basic ideas of linear programming, with additional topics drawn from numerical considerations, linear complementarity, integer programming and networks, polyhedral methods. - Graph Theory (Math 412) [In multiple semesters]

Topics include subgraphs, connectivity, trees, cycles, vertex and edge coloring, planar graphs and their colorings. Draws applications from computer science, operations research, chemistry, the social sciences, and other branches of mathematics - Introduction to Combinatorics (Math 413) [In multiple semesters]

Topics include Pigeonhole principle and Ramsey's theorem, Permutations and combinations, generating functions, recurrence relations, inclusion and exclusion, Permutations with forbidden positions, Polya's theory of counting, and block designs. - Combinatorial Mathematics (Math 580)

Graduate-level course on fundamental results on core topics of combinatorial mathematics: Enumeration - bijections, recurrences, generating functions, inclusion/exclusion, Polya theory; Graph Theory - trees & cycles, matchings, connectivity, coloring, planar graphs; Extremal problems on finite sets - pigeonhole principle, Ramsey theory, partial orders; Methods - probabilistic methods, random graphs, threshold functions, algebraic methods; Structures - latin squares, projective planes, block designs, matroids; Combinatorial Optimization. - Co-author of proposal for graduate course on Discrete and Convex Geometry in Fall 2003.
- Author of proposal for graduate course on Topics in Probabilistic Methods for Discrete Mathematics in Fall 2005.