Farhad Shahrokhi Aug. 2000
Department of Computer Science
University of North Texas
Denton Texas, 76205
phone: (office) 940-565-2805 (home)940-382-0098
e-mail: farhad@cs.unt.edu
Education
1987 Ph.D. in Mathematics with concentration on graph algorithms,
Western Michigan University
Thesis: The Maximum Concurrent Flow Problem
Thesis Advisor, D.W. Matula
1985-87 Post Doc. and Visiting Scholar, Department of
Computer Science, Southern Methodist University,
hosted by D. W. Matula
1983 M.S. in Computer Science, Western Michigan University
1981 M.S. in Operations Research, Western Michigan University
1976 B.S. in Electrical Engineering, Aryamehr University of Technology,
Tehran, Iran
Areas of Expertise
Theoretical Computer Science, Combinatorial Optimization,
Geometric Graph Theory and Combinatorics, Design and Analysis of Algorithms,
Graph Drawing
Employment History
2000- Professor (with tenure),
Department of Computer Science, University of North Texas
1994-2000 Associate Professor (with tenure),
Department of Computer Science, University of North Texas
1989-94 Assistant Professor, Department of Computer Science,
University of North Texas
1987-89 Assistant Professor, Department of Computer Science,
New Mexico Tech.
Research Positions
1998-1999 (8 weeks) Visiting Scientist, Center for Discrete Mathematics and Theoretical Computer Science
(DIMACS), Rutgers University
1988 (6 weeks) Visiting Scientist, Institute for Mathematics
and its application, (IMA) University of Minnesota, 1988
RESEARCH
All conference and journal papers listed below are refereed. Some of the conference papers are the preliminary version of the journal papers.
Publications in Refereed Journals
Shahrokhi, F., Székely, L.A., Constructing integral uniform flows in networks with applications to the edge-forwarding index problem. Discrete Applied Math. 107, 3 (2000), 193-209, (in press). This work is supported by NSF grant CCR 9528228.
on a Surface,
Disc. Comp. Geometry, 19 (1998), 237-247.
This work is supported by NSF grant CCR 9528228.
Publications in Refereed Conferences
Unpublished Technical Reports
Funding
The National Science Foundations
Solving crossing number problems with applications,
Principal Investigator,
CCR-9988525, $169,280, 2000-2003.
The National Science Foundations
Crossing number problems in geometric drawings of graphs,
Principal Investigator,
CCR-9528228, $48,800, 1996-1999.
College of Art 
Sciences at UNT
AMS Sectional Meeting in Columbia, South Carolina, March 2001,
$4,000.
DIMACS
$6000, 1998-1999.
MCI Dallas
$15,000, 1995.
Various Small Internal Grants at UNT
$8,000, 1989-2000.
Abstracts and Presentations
The listed presentations do not include the talks given
for presenting the conference papers.
Shahrokhi, F., On Crossing Number Problems, Department of Mathematics, University of South Carolina, 1998.
Shahrokhi, F., Crossing numbers: Bounds and Applications, 1997 Workshop on Algorithmic Research in Midsouthwest (WARM'97), UNT, 1997.
Shahrokhi, F., Sýkora, O., Székely L.A., and Vrto, I., On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem AMS Meeting at Oaxaca, Mexico, December 1997 (Abstract).
Shahrokhi, F., Székely, L.A., Uniform Concurrent Flow in Product Graphs (Abstract), 27th Southeast International Conference in Combinatorics, Graph Theory, and Computing, LSU 1996.
Shahrokhi, F., Sýkora, O., Székely L.A., and Vrto, I., Bounds for the Crossing Number of a Graph on a Compact Two Manifold, presented in AMS National Meeting, May 1993, (Abstract) p. 410.
Shahrokhi, F., Crossing Number of Symmetric Graphs on a Compact Two Manifold, presented in 1992 Workshop on Algorithmic Research in Midsouthwest (WARM'92), SMU.
Shahrokhi, F. and Székely, L.A., New Lower Bounds for the Crossing Number, presented in Seventh International Conference on Theory and Applications of Graphs, WMU, 1992.
Shahrokhi, F., An Algebraic Approach to Concurrent Flows, presented at the Department of Computer Science, Texas A&M University, 1991.
Shahrokhi, F., Lower Bounds for the Crossing Number, presented at at the Department of Computer Science, Southern Methodist University 1991.
Shahrokhi, F., On Concurrent Flows, presented at Department Computer Science, Southern Methodist University, 1991.
Shahrokhi, F., Solving Large Multicommodity Flows, presented at BNR, 1990.
Shahrokhi, F. and Székely, L.A., A Combinatorial Approach to Integral Multicommodity Flow Problems, presented in AMS National Meeting, March 1990. (Invited Talk; Co-author presented the talk.)
Shahrokhi, F. and Barefoot, C., 1-Hamiltonian Connectivity of 4-Connected Halin Graphs, presented in International Southeast Conference on Combinatorics and Computing, Boca Raton, 1989.
Shahrokhi, F., On Solving the Universal Packet Routing Problems for Parallel and Distributed Systems presented in 1989 New Mexico Computer Science Conference, Socorro, 1989.
Shahrokhi, F., Communications Complexity and Routing in Parallel Computing, presented in 1988 New Mexico Computer Science Conference, Albuquerque, 1988.
Shahrokhi, F., The Maximum Concurrent Flow Problem, presented at the Department of Mathematics, Massachusetts Institute of Technology, 1987.
Matula, D.W., Shahrokhi, F., and Thompson, B., Another Look at Divisive Hierarchical Clustering Procedures, presented in 20th Annual International Conference on Numerical Taxonomy (NT-20), 1986.
Shahrokhi, F., An Efficient Routing Algorithm to Solve the Maximum Concurrent Flow Problem with Applications to the Packet Switched Telecommunication Networks and Cluster Analysis, presented in ACM 1986 National Conference.
Shahrokhi, F. and Matula, D.W., An Efficient Iterative Solution to the Maximum Concurrent Flow Problem, presented in ORSA/TIMS 1985 Joint National Meeting, (Abstract) p. 136.
Matula, D.W., Helgason, R.V., Shahrokhi, F., Thompson, B.W., Applications in Cluster Analysis of Maximum Concurrent Network Flows, presented in ORSA/TIMS 1985 Joint National Meeting, (Abstract) p. 136.
Awards
Service Recognition Award, UNT, 1999
Nominee (jointly with D. W. Matula) for D. Ray Fulkerson Prize
in discrete mathematics 1994.
Nominee for Decker Scholar award for excellence in research, UNT, 1993.
Nominee for Shelton teaching award for excellence in teaching, UNT, 1993.
Nominee for Shelton teaching award for excellence in teaching, UNT, 1994.
Nominee for Honors Professor's ward award for excellence in teaching UNT,
1994.
Additional Professional Activities
Co-organizer Special Session in Discrete and Computational Geometry,
and Graph Drawing,
AMS meeting at Columbia, South Carolina, March 2001,
24 speakers, Four Sessions.
Program Director
1997 Workshop on Algorithmic Research in Midsouthwest (WARM'97),
University of North Texas, March 8, 1997.
This workshop is sponsored by a consortium of computer science departments
in the area, including U. Texas, U. Oklahoma, Southern Methodist U.,
Texas A.& M., Rice U., Louisiana State U., U. Southwestern Louisiana,
U. of North Texas and, U. Texas - Dallas.
Reviewer
SODA2000, STOC2000, SODA94, Algorithmica, Disc. and Comp.
Geom., Journal of Operations Research,
Journal of Graph Theory, SIAM Journal on
Computing, Journal of Algorithms, ORSA Journal on Computing, INFOR, Pattern
Recognition, Networks, Seventh International Conference on Theory and
Application of Graphs, IEEE Trans. on Computers.
Session Chair: Fifth and Sixth, IEEE Symposium On Parallel and
Distributed Processing, Dallas, TX, 1993, 1994.
Invited Participant
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), Workshop for Graph Drawing 94, Princeton University, 1994
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), Rutgers University, Workshop for Approximation Algorithms, 1993.
NSF Workshop on Probabilistic Methods in Combinatorial Optimization,
Dept. of Mathematics, Johns Hopkins University,
1988.
NSF-CBMS Workshop on Algorithms and Complexity, Colorado College,
1987.
Invited Speaker
Sixth and Seventh International Conference on Theory and
Applications of Graphs, Kalamazoo, 1988 and 1992.
Fifth and Sixth International Conference on Random Graphs
and Probabilistic Methods, Poznan, Poland, 1991, 1993. ( I was invited but could not go)
TEACHING
Undergraduate Classes Taught
Data Structures, Discrete Mathematics, Design and Analysis of Algorithm,
Introduction to Programming, Networks, Circuit Design, Digital Logic Design.
Graduate Classes Taught
Algorithm Design, Approximation algorithms,
Combinatorial Optimization, Complexity Theory,
Graph Theory, Advanced Algorithms, Automata Theory and Compiler Design.
Undergraduate Student Supervision
Directed Studies Powel 1994, Eaton 1994, Edwards 1995.
Graduate Student Supervision
MS Students, Eric Lee 1989, Shi 1990, Lei 1990, Behzadnoori 1991,
Kaizer 1991, Chapin 1993, Kolgeshev 1994, Azzizgolu, 1995,
Dietz 1995, Kumar 1995, Lee 1995, Sethi 1996, Hughes, 1997, Yildiz 1997.
Ph.D. Students Jamily and Lin 1994; (These students did not finish.)
Member of about 8 Ph.D. committees, since 1989.
Teaching Scores at UNT
| Course | Semester | My score | Department average |
| csci6330 | fall94 | 4.57 | 3.40 |
| csci3400 | fall94 | 4.63 | 3.40 |
| csci5370 | spring95 | 4.1 | 3.64 |
| csci3400 | spring95 | 4.55 | 3.64 |
| csci6330 | fall95 | 4.25 | 3.64 |
| csci5450 | fall95 | 4.08 | 3.64 |
| csci3400 | spring96 | 4.21 | 3.95 |
| csci3400 | spring96 | 4.25 | 3.95 |
| csci6330 | fall96 | 4.0 | 3.95 |
| csci3400 | fall96 | 4.42 | 3.95 |
| csc5370 | spring97 | 4.5 | 3.70 |
| csci3400 | spring97 | 4.0 | 3.70 |
| csci6330 | fall98 | 4.0 | 3.73 |
| csci4450 | fall98 | 3.0 | 3.73 |
| csci5450 | spring99 | 3.89 | 3.89 |
| csci3400 | spring99 | 3.08 | 3.89 |
| csci5450 | summer99 | 4.60 | |
| csci5370 | summer99 | 4.83 | |
| csci6330 | fall00 | 4.6 | 3.89 |
| csci3400 | fall00 | 4.27 | 3.89 |
SERVICE AT UNT
Service to the Department of Computer Science
| 1999-2000 | Chair, Faculty Recruitment Committee |
1998-2000 |
PAC
and executive committee |
1996-1997 |
PAC and Executive committee |
1996 |
Re-wrote and revised the promotion and tenure guidelines and procedures |
1996-1997 |
Coordinator for Research Seminars |
1996-1997 |
PAC and Graduate Committee |
1996-1997 |
Faculty Recruitment Committee |
1996 (Spring) |
Add-Hoc appeal Committee of Dr. Brazile |
1995-1996 |
Chair, Faculty Recruitment Committee |
1996 |
Chair, Search Committee for Hiring a Chairman |
| in the Dept. of Comp. Sci | |
1995-1996 |
Chair, PAC and a member of the Undergraduate and Graduate Committees |
1994-1995 |
PAC and Graduate Committee |
1994-1995 |
Ad-hoc Committee for writing the Charter in the Dept. of Comp. Sci. |
1993-1994 |
Graduate Committee |
1992-1993 |
Undergraduate Committee |
1990-1992 |
Graduate Committee |
1990-1992 |
Coordinator for Research Seminars |
1989-1992 |
Graduate Committee |
Service to the College and the University
1996 |
Add-Hoc Appeal Committee (tenure) of Dr. Joe Prez, in the College of Art and Sciences |
1994-1995 |
Faculty Judge for Traffic Appeal Court at the University of North Texas |
1991-1993 |
Faculty Judge for Traffic Appeal Court at the University of North Texas |