Farhad Shahrokhi

Professor, Department of Computer Science & Engineering

Office: NTDP F276

E-Mail: farhad.shahrokhi@unt.edu

Short Vita

Research: Graph Theory, Algorithms and Combinatorial Optimization

I am developing new graph theoretical concepts that can aid algorithm design and may be of independent interest to the discrete mathematics and computational geometry communities. Ongoing projects include deriving separation theorems for dense graphs with respect to different measures, developing new intersection graph models, and analyzing the performance of a new heuristics for the set cover problem. My past research on crossing numbers was funded by NSF. My Erdos number is two. Google Scholar reports 79 publications, 1367 citations and an h-index of 18.

Teaching Fall 2017:

CSCE 4110

CSCE 5150

Some of events that I organized (or co-organized):

Special Session in Disc. and Comp. Geometry, and Graph Drawing, AMS meeting, Columbia SC, March 2001 (Jointly Organized with L.A. Szekely)

▹Special issue of DCG devoted to the AMS Special Session

NSF-CBMS Regional Research Conference on Geometric Graph Theory at UNT (UNT, May 28 - June 1, 2002)

Geometry Day at UNT (UNT, October 25, 2003)

12th International Symposium on Graph Drawing (City College, NY Sep 29 - Oct 2, 2004, Organizers: J. Pach Chair, P. Brass and F. Shahrokhi co-Chairs, G. Bloom)

▹Special issue of Algorithmica devoted to GD2004

Workshop on Algorithms, combinatorics and geometry (ACG)(UNT, November 29 to December 1, 2007)

▹Special issue of Algorithmica devoted to ACG

Recent Papers:

Algorithms For Longest Chains In Pseudo-Transitive Graphs

A new separation theorem with geometric applications

Largest reduced neighborhood clique cover number revisited

New separation theorems and sub-exponential time algorithms for packing and piercing of fat objects

New representation results for planar graphs

A new upper bound for the clique cover number with applications

Bounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid

On the largest reduced neighborhood clique cover number of a graph

Unit Incomparability Dimension and Clique Cover Width in Graphs

Clique Cover Width and Clique Sum