Farhad Shahrokhi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2020

A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a GraphJonathan Li, Rohan Potru, Farhad Shahrokhi. algorithms, 13(12):339, 2020. [doi]

2011

Guest Editor s Foreword: Algorithms, Combinatorics, & GeometryFarhad Shahrokhi. algorithmica, 60(3):481-483, 2011. [doi]

2007

Guest Editors ForewordJános Pach, Farhad Shahrokhi. algorithmica, 47(4):365, 2007. [doi]

On k-planar crossing numbersFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. DAM, 155(9):1106-1115, 2007. [doi]

2003

Bounds for Convex Crossing NumbersFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. cocoon 2003: 487-495 [doi]

Bounds and Methods for k-Planar Crossing NumbersFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. gd 2004: 37-46 [doi]

2002

Guest Editors ForewordFarhad Shahrokhi, László A. Székely. dcg, 28(4):447-448, 2002. [doi]

2001

Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problemFarhad Shahrokhi, László A. Székely. DAM, 108(1-2):175-191, 2001.

2000

On Bipartite Drawings and the Linear Arrangement ProblemFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. SICOMP, 30(6):1773-1789, 2000. [doi]

A new lower bound for the bipartite crossing number with applicationsFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. TCS, 245(2):281-294, 2000. [doi]

On Crossing Sets, Disjoint Sets, and PagenumberFarhad Shahrokhi, Weiping Shi. jal, 34(1):40-53, 2000.

1999

On 3-Layer Crossings and Pseudo ArrangementsFarhad Shahrokhi, Imrich Vrto. gd 1999: 225-231 [doi]

1998

Integral Uniform Flows in Symmetric NetworksFarhad Shahrokhi, László A. Székely. criwg 1998: 272-284

Intersection of Curves and Crossing Number of C::m:: x C::n:: on SurfacesFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. dcg, 19(2):237-247, 1998. [doi]

1997

On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement ProblemFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. wads 1997: 55-68

Bipartite Crossing Numbers of Meshes and HypercubesFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. gd 1997: 37-46

1996

Applications of the Crossing NumberJános Pach, Farhad Shahrokhi, Mario Szegedy. algorithmica, 16(1):111-117, 1996.

Drawings of Graphs on Surfaces with Few CrossingsFarhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto. algorithmica, 16(1):118-131, 1996.

The book crossing number of a graphFarhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrt'o. jgt, 21(4):413-424, 1996. [doi]

Efficient Deterministic Algorithms for Embedding Graphs on BooksFarhad Shahrokhi, Weiping Shi. cocoon 1996: 162-168

1995

Crossing Numbers of MeshesFarhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto. gd 1996: 463-471

1994

1993

Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version)Farhad Shahrokhi, László A. Székely. criwg 1994: 327-337

Improving Bounds for the Crossing Numbers on Surfaces of Genus gFarhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto. criwg 1994: 388-395

1992

A Linear Time Algorithm for Graph Partition ProblemsL. H. Clark, Farhad Shahrokhi, László A. Székely. ipl, 42(1):19-24, 1992.

Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of SymmetryFarhad Shahrokhi, László A. Székely. ipco 1992: 102-113

1990

Sparsest cuts and bottlenecks in graphsDavid W. Matula, Farhad Shahrokhi. DAM, 27(1-2):113-123, 1990. [doi]

The Maximum Concurrent Flow ProblemFarhad Shahrokhi, David W. Matula. JACM, 37(2):318-334, April 1990. [doi]

1989

On Renaming a Set of Clauses as a Horn SetG. Lindhorst, Farhad Shahrokhi. ipl, 30(6):289-293, 1989.

Approximation Algorithms for the Maximum Concurrent Flow ProblemFarhad Shahrokhi. informs, 1(2):62-69, 1989. [doi]

1987

On solving large maximum concurrent flow problemsFarhad Shahrokhi, David W. Matula. acm 1987: 205-209 [doi]

1986

An efficient flow routing algorithm to solve the maximum concurrent flow problem with applications to the packed switched telecommunication networks and cluster analysis (abstract)Farhad Shahrokhi. acm 1986: 494 [doi]

Sign in or sign up to see more results.

runs on WebDSL