|
Teaching - Courses I have taught and/or am teaching. These
courses and their resources are available through
Sakai.
- MATH 1P66 - Mathematics for Computer Science I
- MATH 1P67 - Mathematics for Computer Science II
- MATH 2P71 - Introduction to Combinatorics
- MATH 4P71 - Combinatorics
- MATH 5P35 - Graph Theory
- MATH 5P36 - Algorithmic Game Theory
Research - My research interests fall in the
diverse area of discrete mathematics and theoretical computer science.
In particular, my work focuses upon graph theory, algorithmic game theory,
algorithms and discrete optimization. Here is some of my publications.
- B. Farzad and Dirk Oliver Theis, The chromatic number of random lifts of K5\e
- B. Farzad, Planar Graphs without 7-cycles are
4-choosable, To Appear in SIAM Journal on Discrete Mathematics.
- B. Farzad and Mike Molloy, On the edge density of
4-critical graphs, To Appear in Combinatorica.
- B. Farzad, Lap Chi Lau, Van Bang Le and Nguyen Ngoc Tuy,
Computing Graph Roots Without Short Cycles,
STACS 2009: 397-408.
- B. Farzad, Neil Olver and Adrian Vetta, A
Priority-Based Model of Routing, Chicago Journal of Theoretical
Computer Science, Article #1, 2008.
- B. Farzad, Mohammad Mahdian, Ebad S. Mahmoodian, Bardia Sadri and Amin
Saberi, Forced Orientation of Graphs, Bulletin
of the IMS, 32 (1): 79-89 (2006).
- B. Farzad, Mike Molloy and Bruce Reed,
(\Delta-k)-critical Graphs, Journal of Combinatorial Theory (Series
B), 93(2): 173-185 (2005).
Graduate Students
- Samaneh Malekan (co-supervisor H. Ben-El-Mechaiekh)
- Yi Cao (co-supervisor H. Fukś)
|
