| The maximum concurrent flow problem F Shahrokhi, DW Matula J. ACM 37 (2), 318-334, 1990 | 560 | 1990 |
| Applications of the crossing number J Pach, F Shahrokhi, M Szegedy Algorithmica 16 (1), 111-117, 1996 | 169 | 1996 |
| Applications of the crossing number J Pach, F Shahrokhi, M Szegedy Algorithmica 16 (1), 111-116, 1996 | 169 | 1996 |
| Sparsest cuts and bottlenecks in graphs DW Matula, F Shahrokhi Discrete Applied Mathematics 27 (1-2), 113-123, 1990 | 124 | 1990 |
| On bipartite drawings and the linear arrangement problem F Shahrokhi, O Sýkora, LA Székely, I Vrto SIAM Journal on Computing 30 (6), 1773-1789, 2001 | 99 | 2001 |
| The book crossing number of a graph F Shahrokhi, LA Székely, O Sýkora, I Vrt'o Journal of Graph Theory 21 (4), 413-424, 1996 | 62 | 1996 |
| Crossing numbers: bounds and applications F Shahrokhi, O Sýkora, LA Székely, I Vrt’o Intuitive geometry 6, 179-206, 1995 | 60 | 1995 |
| On crossing sets, disjoint sets, and pagenumber F Shahrokhi, W Shi Journal of Algorithms 34 (1), 40-53, 2000 | 48 | 2000 |
| On Crossing Sets, Disjoint Sets and the Pagenumber F Shahrokhi, W Shi | 48 | 1998 |
| Crossing numbers of graphs, lower bound techniques and algorithms: a survey F Shahrokhi, LA Székely, I Vrt'o International Symposium on Graph Drawing, 131-142, 1994 | 31 | 1994 |
| Intersection of curves and crossing number of C m× C n on surfaces F Shahrokhi, O Sýkora, LA Székely, I Vrt'o Discrete & Computational Geometry 19 (2), 237-247, 1998 | 29 | 1998 |
| The complexity of the bottleneck graph bipartition problem F Shahrokhi, LA Székely J. Combin. Math. Combin. Comp 15 (94), 221-226, 1994 | 28 | 1994 |
| The crossing number of a graph on a compact 2-manifold F Shahrokhi, O Sýkora, LA Székely, I Vrťo advances in mathematics 123 (2), 105-119, 1996 | 26 | 1996 |
| On solving large maximum concurrent flow problems F Shahrokhi, DW Matula Proceedings of the 15th annual conference on Computer Science, 205-209, 1987 | 24 | 1987 |
| The Macimum concurrent Flow problems and sparsest cuts DW Matula Tech. Report, Southern Methodist Univ., 1986 | 24 | 1986 |
| Drawings of graphs on surfaces with few crossings F Shahrokhi, LA Szekely, O Sýkora, I Vrt'o Algorithmica 16 (1), 118-131, 1996 | 23 | 1996 |
| Book embeddings and crossing numbers F Shahrokhi, O Sýkora, LA Székely, I Vrt'o International Workshop on Graph-Theoretic Concepts in Computer Science, 256-268, 1994 | 23 | 1994 |
| A new lower bound for the bipartite crossing number with applications F Shahrokhi, O Sýkora, LA Székely, I Vrt'o Theoretical Computer Science 245 (2), 281-294, 2000 | 20 | 2000 |
| A New Lower Bound for the Bipartite Crossing Number with Applications F Shahrokhi, O Sýkora, LA Székely, I Vrt'o | 20 | 1998 |
| On k-planar crossing numbers F Shahrokhi, O Sýkora, LA Székely, I Vrt’o Discrete applied mathematics 155 (9), 1106-1115, 2007 | 19 | 2007 |
