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