Dr. Farhad Shahrokhi

University of North Texas

Computer Science and Engineering

Email: Farhad.Shahrokhi@unt.edu

PhD, Western Michigan University, 1988.

Major: Mathematics - graph algorithms/The Maximum Concurrent Flow Problem

MS, Western Michigan University, 1983.

Major: Computer Science

MS, Western Michigan University, 1981.

Major: Operations Research

BS, Aryamehr University of Technology, 1976.

Major: Electrical Engineering

Professor, University of North Texas. (2000 – Present).

Associate Professor, University of North Texas. (1994 – 2000).

Visiting Scientist, Rutgers University. (1998 – 1999).

Assistant Professor, University of North Texas. (1989 – 1994).

Assistant Professor, New Mexico Tech. (1988 – 1989).

Visiting Scientist, University of Minnesota. (1988 – 1988).

Post-Doc, Southern Methodist University. (1985 – 1987).

Nominee (jointly with D. W. Matula)D. Ray Fulkerson Prize in discrete mathematics. (1994 – 1994).

CSCE 3110, Data Structures and Algorithms, 11 courses.

CSCE 4110, Algorithms, 19 courses.

CSCE 4890, Directed Study, 5 courses.

CSCE 4940, Special Computer Application Problem, 1 course.

CSCE 5150, Analysis of Computer Algorithms, 28 courses.

CSCE 5170, Graph Theory, 7 courses.

CSCE 5934, Directed Study, 2 courses.

CSCE 5950, Master's Thesis, 5 courses.

CSCE 6900, Special Problems, 4 courses.

CSCE 6933, Advanced Topics in Computer Science and Engineering, 2 courses.

CSCE 6940, Individual Research, 3 courses.

CSCI 3400, Data Structures, 2 courses.

CSCI 4450, Algorithm Analysis and Complexity Theory, 1 course.

CSCI 5370, Graph Theory for Computer Scientists, 1 course.

CSCI 6330, Advanced Topics in Computer Science, 1 course.

Dissertation Committee Chair, Computer Science and Engineering. (August 2018 – Present).

Recongnition of teaching (Thank a teacher), Clear. (2017 – Present).

Honor's day recognition, UNT. (2016 – Present).

Recognition of teaching (CLEAR) Thank a Teacher, CLEAR. (2016 – Present).

Nominated for: Steven Piper Teaching Award, state of Texas. (2015 – 2015).

Honor Professor Award, UNT. (2008 – 2008).

Shahrokhi, F. (2016). k-domination in the intersection graph of geometric objects. *47th Southeastern International Conference on Combinatorics, Graph Theory and Computing, 2016.*.

Shahrokhi, F. (2015). Crossing Number and Congestion of Tree Decomposition. *American Mathematical Society, Spring Eastern Sectional Meeting Georgetown University, Washington, DC March 7-8, 2015*.

Shahrokhi, F. (2015). New Results For Edge Covering of Hypergraphs. *46th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, CGTC46*.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A, (1992). Uniform concurrent multicommodity flow in product graphs. Rheinische Friedrich-Wilhelms-Universit\"at Bonn.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A, (1992). Uniform concurrent multicommodity flow in product graphs. Rheinische Friedrich-Wilhelms-Universit\"at Bonn.

Matula, D. W., Shahrokhi, F. (1986). Graph partitioning by sparse cuts and maximum concurrent flow. Department of Computer Science and Engineering, Southern Methodist University.

Matula, D. W., Shahrokhi, F. (1986). Graph partitioning by sparse cuts and maximum concurrent flow. Department of Computer Science and Engineering, Southern Methodist University.

Shahrokhi, F., S\`ykora, O,, Sz\'ekely, LA,, Vrt’o, I. (2003). Towards the theory of convex crossing numbers. *Towards a Theory of Geometric Graphs*. 342, 249--258. American Mathematical Society Providence.

Shahrokhi, F., S\`ykora, O,, Sz\'ekely, LA,, Vrt’o, I. (2003). Towards the theory of convex crossing numbers. *Towards a Theory of Geometric Graphs*. 342, 249--258. American Mathematical Society Providence.

Shahrokhi, F. (2014). Clique Cover Width in the Clique Sum Graphs. *45th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, CGTC45*.

Shahrokhi, F. (2014). Clique Cover Width in the Clique Sum Graphs. *45th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, CGTC45*.

Shahrokhi, F. (2013). New representation results for planar graphs. *29th European Workshop on Computational Geometry (EuroCG 2013). arXiv:1502.06175 [math.CO]*. 177--181.

Shahrokhi, F. (2013). New representation results for planar graphs. *29th European Workshop on Computational Geometry (EuroCG 2013). arXiv:1502.06175 [math.CO]*. 177--181.

Sahrokhi, F. (2012). New representation results for planar graphs and graphs with an excluded minor. *43th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, CGTC43*.

Sahrokhi, F. (2012). New representation results for planar graphs and graphs with an excluded minor. *43th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, CGTC43*.

Shahrokhi, F. (2012). New separation theorems and sub-exponential time algorithms for packing and piercing of fat objects. *, 28th European Workshop on Computational Geometry.*. 269--273.

Shahrokhi, F. (2012). New separation theorems and sub-exponential time algorithms for packing and piercing of fat objects. *, 28th European Workshop on Computational Geometry.*. 269--273.

Shahrokhi, F. (2010). Generalized Bandwidth and Clique Cover Separation. *41th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, CGTC41*.

Shahrokhi, F. (2010). Generalized Bandwidth and Clique Cover Separation. *41th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, CGTC41*.

Shahrokhi, F. (2009). A new look at the tree decomposition. *40th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, CGTC40*.

Shahrokhi, F. (2009). A new look at the tree decomposition. *40th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, CGTC40*.

Shahrokhi, F. (2004). On Pseudo-transitive Graphs. *Joint AMS-SMM International Meeting in Houston, TX, May 13-15, 2004.*.

Shahrokhi, F. (2004). On Pseudo-transitive Graphs. *Joint AMS-SMM International Meeting in Houston, TX, May 13-15, 2004.*.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, Laszlo A,, Vrt’o, I. (2003). Bounds for convex crossing numbers. *International Computing and Combinatorics Conference*. 487--495.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, Laszlo A,, Vrt’o, I. (2003). Bounds for convex crossing numbers. *International Computing and Combinatorics Conference*. 487--495.

Shahrokhi, F. (2002). Algorithms and Covering Theorems For Pseudo Transitive Graphs. *SIAM Conference in Disc. Mathematics, San Diego, CA, 2002*.

Shahrokhi, F. (2002). Algorithms and Covering Theorems For Pseudo Transitive Graphs. *SIAM Conference in Disc. Mathematics, San Diego, CA, 2002*.

Shahrokhi, F. (2002). On pseudo-transitive graphs. *DIMACS Workshop on Geometric Graph Theory, Rutgers University, 2002*.

Shahrokhi, F. (2002). On pseudo-transitive graphs. *DIMACS Workshop on Geometric Graph Theory, Rutgers University, 2002*.

Shahrokhi, F. (2001). Algorithms and Covering Theorems For Pseudo Transitive Graphs With Geometric Applications. *The Elbe Sandstones Geometry Workshop Rynartice Czech Republic, July 2001*. 17.

Shahrokhi, F. (2001). Algorithms and Covering Theorems For Pseudo Transitive Graphs With Geometric Applications. *The Elbe Sandstones Geometry Workshop Rynartice Czech Republic, July 2001*. 17.

Shahrokhi, F., Vrt’o, I. (1999). On 3-layer crossings and pseudo arrangements. *International Symposium on Graph Drawing*. 225--231.

Shahrokhi, F., Vrt’o, I. (1999). On 3-layer crossings and pseudo arrangements. *International Symposium on Graph Drawing*. 225--231.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A, (1998). Integral uniform flows in symmetric networks. *International Workshop on Graph-Theoretic Concepts in Computer Science*. 272--284.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A, (1998). Integral uniform flows in symmetric networks. *International Workshop on Graph-Theoretic Concepts in Computer Science*. 272--284.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1997). On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem. *Workshop on Algorithms and data Structures*. 55--68.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1997). On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem. *Workshop on Algorithms and data Structures*. 55--68.

Shahrokhi, F., Shi, W. (1996). Efficient deterministic algorithms for embedding graphs on books. *International Computing and Combinatorics Conference*. 162--168.

Shahrokhi, F., Shi, W. (1996). Efficient deterministic algorithms for embedding graphs on books. *International Computing and Combinatorics Conference*. 162--168.

Shahrokhi, F., Shi, W. (1996). Effcient deterministic algorithms for embedding graphs on books. *Computing and Combinatorics (COCOON96), LNCS*. 1090, 162--168.

Shahrokhi, F., Sz\'ekely, LA, (1995). On group invariant flows and applications. *Graph Theory, Combinatorics, and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs*. 2, 1033--1042.

Shahrokhi, F., Sz\'ekely, LA, (1995). On group invariant flows and applications. *Graph Theory, Combinatorics, and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs*. 2, 1033--1042.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1994). Book embeddings and crossing numbers. *International Workshop on Graph-Theoretic Concepts in Computer Science*. 256--268.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1994). Book embeddings and crossing numbers. *International Workshop on Graph-Theoretic Concepts in Computer Science*. 256--268.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1994). Crossing numbers of graphs, lower bound techniques and algorithms: a survey. *International Symposium on Graph Drawing*. 131--142.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1994). Crossing numbers of graphs, lower bound techniques and algorithms: a survey. *International Symposium on Graph Drawing*. 131--142.

Shahrokhi, F., Sz\'ekely, Laszl\'o A, (1993). Concurrent flows and packet routing in Cayley graphs (Preliminary version). *International Workshop on Graph-Theoretic Concepts in Computer Science*. 327--337.

Shahrokhi, F., Sz\'ekely, Laszl\'o A, (1993). Concurrent flows and packet routing in Cayley graphs (Preliminary version). *International Workshop on Graph-Theoretic Concepts in Computer Science*. 327--337.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A,, S\`ykora, Ondrej,, Vrt'o, I. (1993). Improved bounds for the crossing numbers on surfaces of genus g. *International Workshop on Graph-Theoretic Concepts in Computer Science*. 388--395.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A,, S\`ykora, Ondrej,, Vrt'o, I. (1993). Improved bounds for the crossing numbers on surfaces of genus g. *International Workshop on Graph-Theoretic Concepts in Computer Science*. 388--395.

Shahrokhi, F. (1991). Duality Theorems for the Maximum Concurrent Flow Problem. *Graph theory, combinatorics, and applications: proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Western Michigan University*. 2, 1075.

Shahrokhi, F. (1991). Duality Theorems for the Maximum Concurrent Flow Problem. *Graph theory, combinatorics, and applications: proceedings of the Sixth Quadrennial International Conference on the Theory and Applications of Graphs, Western Michigan University*. 2, 1075.

Shahrokhi, F., Matula, D. W. (1987). On solving large maximum concurrent flow problems. *Proceedings of the 15th annual conference on Computer Science*. 205--209.

Shahrokhi, F., Matula, D. W. (1987). On solving large maximum concurrent flow problems. *Proceedings of the 15th annual conference on Computer Science*. 205--209.

Shahrokhi, F. (1986). An efficient flow routing algorithm to solve the maximum concurrent flow problem with applications to the packet switched telecommunication networks and cluster analysis. *Proceedings of the 1986 ACM fourteenth annual conference on Computer science*. 494.

Shahrokhi, F. (1986). An efficient flow routing algorithm to solve the maximum concurrent flow problem with applications to the packet switched telecommunication networks and cluster analysis. *Proceedings of the 1986 ACM fourteenth annual conference on Computer science*. 494.

Shahrokhi, F. (2018). Strong pseudo transivity and intersection graphs.. Congressus Numerantium. 230, 309-316.

Shahrokhi, F. (2017). Largest reduced neighborhood clique cover number revisited. 229, 173--179.

Shahrokhi, F. (2016). On the largest reduced neighborhood clique cover number of a graph. Congressus Numerantium. 226, 273--279.

Shahrokhi, F. (2015). Bounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid. Congressus Numerantium. 224, 213--220.

Shahrokhi, F. (2015). Bounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid. Other. 224, 213--220.

Shahrokhi, F. (2015). Clique Cover Width and Clique Sum. Other. 218, 135--140.

Shahrokhi, F. (2014). Algorithms For Longest Chains In Pseudo- Transitive Graphs. Congressus Numerantium. 221, 21--30.

Shahrokhi, F. (2014). Algorithms For Longest Chains In Pseudo- Transitive Graphs. Congressus Numerantium. 221, 21--30.

Shahrokhi, F. (2012). Unit Incomparability Dimension and Clique Cover Width in Graphs. Congressus Numerantium. 213, 91--98.

Shahrokhi, F. (2012). Unit Incomparability Dimension and Clique Cover Width in Graphs. Congressus Numerantium. 213, 91--98.

Shahrokhi, F. (2011). Guest Editor’s Foreword: Algorithms, Combinatorics, \& Geometry. Algorithmica. 60(3), 481--483. Springer.

Shahrokhi, F. (2011). Guest Editor’s Foreword: Algorithms, Combinatorics, \& Geometry. Algorithmica. 60(3), 481--483. Springer.

Shahrokhi, F. (2010). A New upper bound for the clique cover number with applications. Other. 205(2010), 105--111.

Shahrokhi, F. (2010). A New upper bound for the clique cover number with applications. Other. 205(2010), 105--111.

Shahrokhi, F. (2010). On the clique cover width problem. Congressus Numerantium. 205, 97--103.

Shahrokhi, F. (2010). On the clique cover width problem. Congressus Numerantium. 205, 97--103.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt’o, I. (2007). On k-planar crossing numbers. Discrete Applied Mathematics. 155(9), 1106--1115. North-Holland.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt’o, I. (2007). On k-planar crossing numbers. Discrete Applied Mathematics. 155(9), 1106--1115. North-Holland.

Shahrokhi, F., Sykora, O., Szekely, L., Vrto, I. (2004). The gap between the crossing numbers and the convex crossing numbers. Contemporary Mathematics. 342, 249--258. Providence, RI; American Mathematical Society; 1999.

Shahrokhi, F., Sykora, O., Szekely, L., Vrto, I. (2004). The gap between the crossing numbers and the convex crossing numbers. Contemporary Mathematics. 342, 249--258. Providence, RI; American Mathematical Society; 1999.

Shahrokhi, F., S\`ykora, O,, Sz\'ekely, LA,, Vrt’o, I. (2003). IMI.

Shahrokhi, F., S\`ykora, O,, Sz\'ekely, LA,, Vrt’o, I. (2003). IMI.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A, (2001). Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem. Discrete Applied Mathematics. 108(1-2), 175--191. North-Holland.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A, (2001). Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem. Discrete Applied Mathematics. 108(1-2), 175--191. North-Holland.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrto, I. (2001). On bipartite drawings and the linear arrangement problem. SIAM Journal on Computing. 30(6), 1773--1789. SIAM.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrto, I. (2001). On bipartite drawings and the linear arrangement problem. SIAM Journal on Computing. 30(6), 1773--1789. SIAM.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (2000). A new lower bound for the bipartite crossing number with applications. Theoretical Computer Science. 245(2), 281--294. Elsevier.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (2000). A new lower bound for the bipartite crossing number with applications. Theoretical Computer Science. 245(2), 281--294. Elsevier.

Shahrokhi, F., Shi, W. (2000). On crossing sets, disjoint sets, and pagenumber. Journal of Algorithms. 34(1), 40--53. Academic Press.

Shahrokhi, F., Shi, W. (2000). On crossing sets, disjoint sets, and pagenumber. Journal of Algorithms. 34(1), 40--53. Academic Press.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1998). Intersection of curves and crossing number of C m$\times$ C n on surfaces. Discrete & Computational Geometry. 19(2), 237--247. Springer-Verlag.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1998). Intersection of curves and crossing number of C m$\times$ C n on surfaces. Discrete & Computational Geometry. 19(2), 237--247. Springer-Verlag.

Pach, J., Shahrokhi, F., Szegedy, M. (1996). Applications of the crossing number. Algorithmica. 16(1), 111--116. Springer Verlag.

Pach, J., Shahrokhi, F., Szegedy, M. (1996). Applications of the crossing number. Algorithmica. 16(1), 111--116. Springer Verlag.

Shahrokhi, F., Szekely, L. A., S\`ykora, Ondrej,, Vrt'o, I. (1996). Drawings of graphs on surfaces with few crossings. Algorithmica. 16(1), 118--131. Springer-Verlag.

Shahrokhi, F., Szekely, L. A., S\`ykora, Ondrej,, Vrt'o, I. (1996). Drawings of graphs on surfaces with few crossings. Algorithmica. 16(1), 118--131. Springer-Verlag.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A,, S\`ykora, Ondrej,, Vrt'o, I. (1996). The book crossing number of a graph. Journal of Graph Theory. 21(4), 413--424. Wiley Online Library.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A,, S\`ykora, Ondrej,, Vrt'o, I. (1996). The book crossing number of a graph. Journal of Graph Theory. 21(4), 413--424. Wiley Online Library.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1996). The crossing number of a graph on a compact 2-manifold. Advances in Mathematics. 123(2), 105--119. Academic Press.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1996). The crossing number of a graph on a compact 2-manifold. Advances in Mathematics. 123(2), 105--119. Academic Press.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt’o, I. (1995). Crossing numbers: bounds and applications. Other. 6, 179--206.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt’o, I. (1995). Crossing numbers: bounds and applications. Other. 6, 179--206.

anos Pach, J., Shahrokhi, F., Szegedy, M. (1994). Applications of the Crossing Number.

anos Pach, J., Shahrokhi, F., Szegedy, M. (1994). Applications of the Crossing Number.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A, (1994). On canonical concurrent flows, crossing number and graph expansion. Combinatorics Probability & Computing. 3(4), 523--543. Cambridge University Press.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A, (1994). On canonical concurrent flows, crossing number and graph expansion. Combinatorics Probability & Computing. 3(4), 523--543. Cambridge University Press.

Shahrokhi, F., Sz\'ekely, LA, (1994). The complexity of the bottleneck graph bipartition problem. Journal of Combinatorial Mathematics and Combinatorial Computing. 15(94), 221--226.

Shahrokhi, F., Sz\'ekely, LA, (1994). The complexity of the bottleneck graph bipartition problem. Journal of Combinatorial Mathematics and Combinatorial Computing. 15(94), 221--226.

Shahrokhi, F., Sz\'ekely, LA, (1993). Integral uniform concurrent flows and all pairs packet routing. Congressus Numerantium. 3--3. UTILITAS MATHEMATICA PUBLISHING INC.

Shahrokhi, F., Sz\'ekely, LA, (1993). Integral uniform concurrent flows and all pairs packet routing. Congressus Numerantium. 3--3. UTILITAS MATHEMATICA PUBLISHING INC.

Clark, L., Shahrokhi, F., Szekely, L. A. (1992). A linear time algorithm for graph partition problems. Information Processing Letters. 42(1), 19--24.

Clark, L., Shahrokhi, F., Szekely, L. A. (1992). A linear time algorithm for graph partition problems. Information Processing Letters. 42(1), 19--24.

Matula, D. W., Shahrokhi, F. (1990). Sparsest cuts and bottlenecks in graphs. Discrete Applied Mathematics. 27(1-2), 113--123. North-Holland.

Matula, D. W., Shahrokhi, F. (1990). Sparsest cuts and bottlenecks in graphs. Discrete Applied Mathematics. 27(1-2), 113--123. North-Holland.

Shahrokhi, F., Matula, D. (1990). The maximum concurrent flow problem. Journal of the ACM. 37(2), 318--334.

Shahrokhi, F., Matula, D. (1990). The maximum concurrent flow problem. Journal of the ACM. 37(2), 318--334.

Shahrokhi, F. (1989). Approximation algorithms for the maximum concurrent flow problem. ORSA Journal on Computing. 1(2), 62--69. INFORMS.

Shahrokhi, F. (1989). Approximation algorithms for the maximum concurrent flow problem. ORSA Journal on Computing. 1(2), 62--69. INFORMS.

Lindhorst, G., Shahrokhi, F. (1989). On renaming a set of clauses as a Horn set. Information Processing Letters. 30(6), 289--293. Elsevier.

Lindhorst, G., Shahrokhi, F. (1989). On renaming a set of clauses as a Horn set. Information Processing Letters. 30(6), 289--293. Elsevier.

Shahrokhi, F. (1987). Design and analysis of efficient algorithms to solve the maximum concurrent flow problem. Western Michigan University.

Shahrokhi, F. (1987). Design and analysis of efficient algorithms to solve the maximum concurrent flow problem. Western Michigan University.

Shahrokhi, F. (1986). Design and analysis of efficient algorithms to solve the maximum concurrent flow problem.

Shahrokhi, F. (1986). Design and analysis of efficient algorithms to solve the maximum concurrent flow problem.

Matula, D. (1986). The Macimum concurrent Flow problems and sparsest cuts. Other.

Matula, D. (1986). The Macimum concurrent Flow problems and sparsest cuts. Other.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1998). A New Lower Bound for the Bipartite Crossing Number with Applications.

Shahrokhi, F., S\`ykora, Ondrej,, Sz\'ekely, L\'aszl\'o A,, Vrt'o, I. (1998). A New Lower Bound for the Bipartite Crossing Number with Applications.

Shahrokhi, F., Shi, W. (1998). On Crossing Sets, Disjoint Sets and the Pagenumber.

Shahrokhi, F., Shi, W. (1998). On Crossing Sets, Disjoint Sets and the Pagenumber.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o, (1992). Effective lower bounds for crossing number, bisection width and balanced vertex separator in terms of symmetry. Rheinische Friedrich-Wilhelms-Universit\"at Bonn.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o, (1992). Effective lower bounds for crossing number, bisection width and balanced vertex separator in terms of symmetry. Rheinische Friedrich-Wilhelms-Universit\"at Bonn.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A, (1991). An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications. Rheinische Friedrich-Wilhelms-Universit\"at.

Shahrokhi, F., Sz\'ekely, L\'aszl\'o A, (1991). An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications. Rheinische Friedrich-Wilhelms-Universit\"at.

Shahrokhi, F. (2002). NSF/CBMS Regional Research Conference in Mathematical Sciences on Geometric Graph Theory. Department of Mathematics, University of South Carolina Columbia.

Shahrokhi, F. (2002). NSF/CBMS Regional Research Conference in Mathematical Sciences on Geometric Graph Theory. Department of Mathematics, University of South Carolina Columbia.

Shahrokhi, F. (Principal), "Workshop on Algorithms, Combinatorics and Geometry," Sponsored by The National Science Foundations, $9000. (2007 – 2009).

Shahrokhi, F. (Principal), "Solving crossing number problems with applications CCR-9988525," Sponsored by The National Science Foundations, $175280. (2000 – 2005).

Shahrokhi, F. (Principal), "NSF/CBMS Regional Research Conference on Geometric Graph Theory, DMS-0121729," Sponsored by The National Science Foundations, $29969. (2001 – 2003).

Shahrokhi, F. (Other), Sponsored by DIMACS, $6000. (1998 – 1999).

Shahrokhi, F. (Principal), "Crossing number problems in geometric drawings of graphs, CCR-9528228," Sponsored by The National Science Foundations, $48800. (1996 – 1999).

Shahrokhi, F. (Other), Sponsored by MCI Dallas, $15000. (1995 – 1995).

Committee Member, Scholarship Committee. (2019 – Present).

Committee Member, Faculty Council. (2018 – Present).

Committee Member, Student Grade Appeal. (2018 – Present).

Committee Member, UNT Faculty Senate. (September 1, 2017 – Present).

Committee Member, CSCEPAC. (January 1, 2004 – Present).

Committee Member, Committee on Committees (Faculty Senate). (September 1, 2017 – 2019).

Committee Member, Faculty Senate EC. (September 1, 2017 – 2019).

Committee Member, College PAC (CENG). (August 1, 2017 – 2019).

Committee Member, Graduate Committee. (September 1, 2015 – September 1, 2016).

Committee Member, Policy Review Committee. (September 1, 2014 – September 1, 2016).

Committee Chair, CENG PAC. (August 1, 2014 – August 1, 2016).

Committee Member, Faculty greivance committee. (2014 – 2015).

Committee Member, Faculty Senate. (September 1, 2010 – September 1, 2015).

Other, NSF/CBMS Regional Research Conference on Geometric Graph Theory. (2002 – 2002).

Session Chair, 50SEICCGTC. (2019 – Present).

Reviewer, Journal Article, Combinatorica, Euro. J. of Comb., IEEE TMC, Math. Prog., SIAM Journal on Disc. Math., Ars Combinatoria, Networks, Euro. J. of Oper. Res., J. Comb. Theory, J. of Combinatorial Opt., Journal of Operations Research, INFOR, Networks. (2015 – Present).

Other, AMS. (2007 – Present).

Session Chair, 46th Southeastern International Conference on Combinatorics, Graph Theory and Computing, 2016. (March 6, 2016 – March 6, 2016).

Editor, Journal Editor, Member of Editorial Borad:} ISRN Discrete Mathematics: 2010-2013.. (2010 – 2013).

Editor, Guest Editor, Algorithmica. (2011 – 2011).

Other, NSF. (2008 – 2008).

Other, Algorithmica. (2007 – 2007).

Program Organizer, Workshop on Algorithms, Combinatorics and Geometry (ACG) UNT, Nov 29, Dec 1 2007, UNT. (2007 – 2007).

Other, NSF. (2005 – 2005).

Other, 12th International Symposium on Graph Drawing. (2004 – 2004).

Program Organizer, Geometry Day, University of North Texas. (2004 – 2004).

Other, SIAM Conference in Discrete Mathematics. (2004 – 2004).

Committee Member, 11th International Symposium on Graph Drawing. (2003 – 2003).

Other, NSF. (2003 – 2003).

Program Organizer, CBMS/NSF Conference at UNT. (2002 – 2002).

Other, Discrete and Computational Geometry. (2002 – 2002).

Other, NSF. (2002 – 2002).

Other, AMS(special session in in Disc. and Comput. Geom., and Graph Drawing, Columbia, South Carolina. (2001 – 2001).

Program Organizer, 1997 Workshop on Algorithmic Research in Midsouthwest (WARM'97:UNT). (1997 – 1997).