Publications in Refereed Journals

1.
Shahrokhi, F., Sýkora, O., Székely, L.A., and Vrto, I., On bipartite drawings and linear arrangement problem. To appear in SIAM Journal on Computing. This work is supported by NSF grant CCR 9528228.

2.
Shahrokhi, F., Sýkora, O., Székely, L.A., and Vrto, I., A New Lower Bound for Bipartite Crossing Number with Algorithmic Applications, Theoretical Computer Science, 245, 2, (2000), 281-294. This work is supported by NSF grant CCR 9528228.

3.
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.

4.
Shahrokhi, F., Shi, W., On Crossing Sets, Disjoint Sets and Pagenumber, Journal of Algorithms, 34, 1 (2000), 40-53. This work is supported by NSF grant CCR 9528228.

5.
Shahrokhi, F., Sýkora, O., Székely, L.A., and Vrto, I., Intersection of Curves and Crossing Number of $C_n\times C_m$ on a Surface, Disc. Comp. Geometry, 19 (1998), 237-247. This work is supported by NSF grant CCR 9528228.

6.
Shahrokhi, F. and Székely, L.A., Integral Multicommodity Flows in Product Graphs, Congressus Numerantium, 122 (1996), 67-89.

7.
Shahrokhi, F., Sýkora, O., Székely, L.A., and Vrto, I., The Book Crossing Number of Graphs, Journal of Graph Theory, 21, 4 (1996), 413-424.

8.
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, Advances in Mathematics, 123, 2 (1996), 105-119.

9.
Shahrokhi, F., Sýkora, O., Székely, L.A., and Vrto, I., Drawing of Graphs With a Few Crossings on the Surfaces, Algorithmica, 16 (1996), 118-131.

10.
Pach, J., Shahrokhi, F. and Szegedy, M., Applications of Crossing Number, Algorithmica, 16 (1996), 111-117.

11.
Shahrokhi, F. and Székely, L.A., On Canonical Concurrent Flows, Crossing Number, and Graph Expansion, Combinatorics, Probability and Computing 3 (1994), 1-21.

12.
Shahrokhi, F., and Székely. L.A., On the Complexity of Bottleneck Bipartite Problem, Journal of Combinatorial Mathematics and Combinatorial Computing, 15 (1994), 221-226.

13.
Shahrokhi, F. and Székely, L.A., Integral Multicommodity Flow and Packet Routing, Congressus Numerantium, 97 (1993), 2-16.

14.
Clark, L., Shahrokhi, F. and Székely, L.A., A Linear Time Algorithm for Graph Partition Problems, Information Processing Letters, 42 (1992),19-24.

15.
Shahrokhi, F. and Matula, D. W., The Maximum Concurrent Flow Problem, Journal of Association for Computing Machinery, 37 (1990), 318-334.

16.
Matula, D. W. and Shahrokhi, F., Sparsest Cuts and Bottlenecks in Graphs, Journal of Disc. Applied Math., 27 (1990), 113-123.

17.
Shahrokhi, F., Approximation Algorithms for the Maximum Concurrent Flow Problem, ORSA Journal on Computing, 1:2 (1989), 62-69.

18.
Lindhorst, G. and Shahrokhi, F., On Renaming a Set of Clauses as a Horn Set, Information Processing Letters, 30 (1989) 298-303.

Publications in Refereed Conferences

19.
Shahrokhi, F., Vrto, I., On 3-layer drawings and pseudo-arrangements, to appear in Proc. of Graph Drawing 99, (GD99), LNCS, Springer Verlag, 1999, 225-231. This work is supported by NSF grant CCR 9528228.

20.
Shahrokhi, F. and Székely, L.A., Integral uniform flows in symmetric networks, Proc. of International Workshop on Graph-Theoretic Concepts in Computer Science, WG1998, LNCS, Springer Verlag, 1998, 272-284. This work is supported by NSF grant CCR 9528228.

21.
Shahrokhi, F., Székely, L.A., Vrto, I., Bipartite crossing numbers of meshes and cubes, Proc. of Graph Drawing 97, (GD97), LNCS 1353, Springer Verlag, 1997, 37-46. This work is supported by NSF grant CCR 9528228.

22.
Shahrokhi, F., Sýkora, O., Székely, L. A., Vrto, I., On bipartite crossings, biplanar subgraphs, and the linear arrangement problem, in Proc. 5th Workshop Algorithms and Data Structures, (WADS'97), LNCS 1272, Springer-Verlag, 1997, 55-68. This work is supported by NSF grant CCR 9528228.

23.
Shahrokhi, F., Sýkora, O., Székely, L.A., and Vrto, I., Crossing Number Problems: Bounds and Applications, invited paper, in Intuitive Geometry eds. I. Bárány and K. Böröczky, Bolyai Society Mathematical Studies 6, 1997, 179-206. This work is supported by NSF grant CCR 9528228.

24.
Shahrokhi, F., Shi, W., Efficient Algorithms for Embedding Graphs on Books, Proceedings of COCOON 96, LNCS Springer-Verlag, 1996, 162-168.

25.
Shahrokhi, F., Sýkora, O., Székely, L.A., and Vrto, I., Crossing Number of Meshes, in Proceedings of Graph drawing 95 (GD95), LNCS 1027, Springer-Verlag, 1996, 197-209.

26.
Shahrokhi, F. and Székely, L.A., On Group Invariant Flows and Applications, Graph Theory, Combinatorics, and Applications Proceedings of the 7th International Conference on Theory and Applications of Graphs, Wiley and Sons, 1995, 1033-1042.

27.
Shahrokhi, F., Sýkora, O., Székely, L.A., and Vrto, I., Book embedding and Crossing Numbers, in Proceedings of 20th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 903, Springer-Verlag, 1995, 112-122.

28.
Shahrokhi, F., Székely L.A., and Vrto, I., Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: A Survey, Proc. of Graph Drawing 94 (GD94), LNCS, 894, Spring Verlag, 1995, 131-142.

29.
Shahrokhi, F., Sýkora, O., Székely, L.A., and Vrto, I., Improved Bounds for Crossing Number of a Graph on a Compact 2-Manifold, Proceedings of 19th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS, 790, Springer-Verlag, 1993, 388-395.

30.
Shahrokhi, F. and Székely, L.A., Packet Routing in Graphs, Proceedings of 19th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS 790, Springer-Verlag, 1993, 327-337.

31.
Pach, J., Shahrokhi, F. and Szegedy, M., Applications of Crossing Number, Proceedings of Tenth Annual ACM Symposium on Computational Geometry, May 1994.

32.
Shahrokhi, F. and Székely, L.A. A New Approach to the Uniform Multicommodity Flow Problem, 14th International Symposium on Mathematical Programming, Amsterdam, Aug. 1991. ( acceptance rate was 20%.)
33.
Shahrokhi, F. and Székely, L.A., Effective Lower Bounds for the Crossing Number, Bisection Width and Balanced Vertex Separators in Terms of Symmetry, Proceedings of the Second Conference in Integer Programming and Combinatorial Optimization, 1992, CMU Press, Pittsburgh, 102-114.

34.
Shahrokhi, F., Duality Theorems for the Maximum Concurrent Flow Problem, Proceedings of the Sixth International Conference on Theory and Applications of Graphs, Wiley and Sons, 1991, 1075-1082.

35.
Shahrokhi, F. and Matula, D. W., On Solving Large Maximum Concurrent Flow Problems, Proceedings of ACM 1987 National Conference, 205-209.

Unpublished Technical Reports

1.
Shahrokhi, F., Shi, W. Polynomial time deterministic algorithms for pagenumber, crossing and disjoint sets. DIMACS Tech. Report TR:98-46, 1998.

2.
Shahrokhi, F., Székely, L.A, Uniform Concurrent Multicommodity Flow in Product Graphs, Report 92744, Institut Für Ökonometrie Und Operations Research Rheinische Friedrich-Wilhelms-Universität, Bonn, 1992.

3.
Shahrokhi, F., Székely, L.A, An Algebraic Approach to the Uniform Multicommodity Flow Problem: Theory and Applications, Report 92745, Institut Für Ökonometrie Und Operations Research Rheinische Friedrich-Wilhelms-Universität, Bonn, 1992.



 
Farhad Shahrohki
2000-09-26