The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Farhad Shahrokhi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Farhad Shahrokhi
    An efficient flow routing algorithm to solve the maximum concurrent flow problem with applications to the packed switched telecommunication networks and cluster analysis (abstract). [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1986, pp:494- [Conf]
  2. Farhad Shahrokhi, David W. Matula
    On solving large maximum concurrent flow problems. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1987, pp:205-209 [Conf]
  3. Farhad Shahrokhi, Weiping Shi
    Efficient Deterministic Algorithms for Embedding Graphs on Books. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:162-168 [Conf]
  4. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Bounds for Convex Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:487-495 [Conf]
  5. János Pach, Farhad Shahrokhi, Mario Szegedy
    Applications of the Crossing Number. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:198-202 [Conf]
  6. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Bounds and Methods for k-Planar Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:37-46 [Conf]
  7. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Crossing Numbers of Meshes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:463-471 [Conf]
  8. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Bipartite Crossing Numbers of Meshes and Hypercubes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:37-46 [Conf]
  9. Farhad Shahrokhi, László A. Székely, Imrich Vrto
    Crossing Numbers of Graphs, Lower Bound Techniques. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:131-142 [Conf]
  10. Farhad Shahrokhi, Imrich Vrto
    On 3-Layer Crossings and Pseudo Arrangements. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:225-231 [Conf]
  11. Farhad Shahrokhi, László A. Székely
    Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:102-113 [Conf]
  12. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:55-68 [Conf]
  13. Farhad Shahrokhi, László A. Székely
    Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:327-337 [Conf]
  14. Farhad Shahrokhi, László A. Székely
    Integral Uniform Flows in Symmetric Networks. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:272-284 [Conf]
  15. Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
    Improving Bounds for the Crossing Numbers on Surfaces of Genus g. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:388-395 [Conf]
  16. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Book Embeddings and Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:256-268 [Conf]
  17. János Pach, Farhad Shahrokhi, Mario Szegedy
    Applications of the Crossing Number. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:1, pp:111-117 [Journal]
  18. Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
    Drawings of Graphs on Surfaces with Few Crossings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:1, pp:118-131 [Journal]
  19. Farhad Shahrokhi, László A. Székely
    On Canonical Concurrent Flows, Crossing Number and Graph Expansion. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:523-543 [Journal]
  20. Farhad Shahrokhi, László A. Székely
    Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:175-191 [Journal]
  21. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    On k-planar crossing numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:9, pp:1106-1115 [Journal]
  22. Farhad Shahrokhi, László A. Székely
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:447-448 [Journal]
  23. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    Intersection of Curves and Crossing Number of Cm x Cn on Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:2, pp:237-247 [Journal]
  24. L. H. Clark, Farhad Shahrokhi, László A. Székely
    A Linear Time Algorithm for Graph Partition Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:19-24 [Journal]
  25. G. Lindhorst, Farhad Shahrokhi
    On Renaming a Set of Clauses as a Horn Set. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:6, pp:289-293 [Journal]
  26. Farhad Shahrokhi, David W. Matula
    The Maximum Concurrent Flow Problem [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:2, pp:318-334 [Journal]
  27. Farhad Shahrokhi, Weiping Shi
    On Crossing Sets, Disjoint Sets, and Pagenumber. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:40-53 [Journal]
  28. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    On Bipartite Drawings and the Linear Arrangement Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1773-1789 [Journal]
  29. Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
    A new lower bound for the bipartite crossing number with applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:245, n:2, pp:281-294 [Journal]
  30. János Pach, Farhad Shahrokhi
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:4, pp:365- [Journal]

  31. Sparsest cuts and bottlenecks in graphs. [Citation Graph (, )][DBLP]


Search in 0.104secs, Finished in 0.105secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002