| The maximum concurrent flow problem F Shahrokhi, DW Matula J. ACM 37 (2), 318-334, 1990 | 582 | 1990 |
| Applications of the crossing number J Pach, F Shahrokhi, M Szegedy Proceedings of the tenth annual symposium on Computational geometry, 198-202, 1994 | 191 | 1994 |
| Sparsest cuts and bottlenecks in graphs DW Matula, F Shahrokhi Discrete Applied Mathematics 27 (1-2), 113-123, 1990 | 172* | 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 | 104 | 2001 |
| Crossing numbers: bounds and applications F Shahrokhi, O Sýkora, LA Székely, I Vrt’o Intuitive geometry 6, 179-206, 1995 | 66 | 1995 |
| 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 | 64 | 1996 |
| On crossing sets, disjoint sets, and pagenumber F Shahrokhi, W Shi Journal of Algorithms 34 (1), 40-53, 2000 | 52 | 2000 |
| Crossing numbers of graphs, lower bound techniques and algorithms: a survey F Shahrokhi, LA Székely, I Vrt'o Graph Drawing: DIMACS International Workshop, GD'94 Princeton, New Jersey …, 1995 | 33 | 1995 |
| The complexity of the bottleneck graph bipartition problem F Shahrokhi, LA Székely J. Combin. Math. Combin. Comp 15 (94), 221-226, 1994 | 29 | 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 | 28 | 1996 |
| Book embeddings and crossing numbers F Shahrokhi, O Sýkora, LA Székely, I Vrt'o Graph-Theoretic Concepts in Computer Science: 20th International Workshop …, 1995 | 28 | 1995 |
| 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 | 27 | 1998 |
| Drawings of graphs on surfaces with few crossings F Shahrokhi, LA Szekely, O Sýkora, I Vrt'o Algorithmica 16, 118-131, 1996 | 25 | 1996 |
| New representation results for planar graphs F Shahrokhi 29th European Workshop on Computational Geometry (EuroCG 2013). arXiv:1502 …, 2013 | 24 | 2013 |
| On k-planar crossing numbers F Shahrokhi, O Sýkora, LA Székely, I Vrt’o Discrete applied mathematics 155 (9), 1106-1115, 2007 | 22 | 2007 |
| On solving large maximum concurrent flow problems F Shahrokhi, DW Matula Proceedings of the 15th annual conference on Computer Science, 205-209, 1987 | 21 | 1987 |
| The gap between the crossing numbers and the convex crossing numbers F Shahrokhi, O Sykora, L Szekely, I Vrto Contemporary Mathematics 342, 249-258, 2004 | 20 | 2004 |
| 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 performance study of some approximation algorithms for computing a small dominating set in a graph J Li, R Potru, F Shahrokhi Algorithms 13 (12), 339, 2020 | 17 | 2020 |
| On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem F Shahrokhi, O Sýkora, LA Székely, I Vrt'o Algorithms and Data Structures: 5th International Workshop, WADS'97 Halifax …, 1997 | 17 | 1997 |
