Farhad Shahrokhi

Publication Activity (10 Years)

Years Active: 1986-2020
Publications (10 Years): 11

Top Topics

Facility Location Problem

Top Venues

Publications

Jonathan Li, Rohan Potru, Farhad Shahrokhi
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph. Algorithms 13 (12) (2020)
Jonathan S. Li, Rohan Potru, Farhad Shahrokhi
A performance study of some approximation algorithms for minimum dominating set in a graph. CoRR (2020)
Farhad Shahrokhi
Bounding the trace function of a hypergraph with applications. CoRR (2020)
Farhad Shahrokhi
Strong Pseudo Transitivity and Intersection Graphs. CoRR (2018)
Farhad Shahrokhi
Unit Incomparability Dimension and Clique Cover Width in Graphs. CoRR (2017)
Farhad Shahrokhi
Algorithms For Longest Chains In Pseudo- Transitive Graphs. CoRR (2017)
Farhad Shahrokhi
A new separation theorem with geometric applications. CoRR (2015)
Farhad Shahrokhi
New separation theorems and sub-exponential time algorithms for packing and piercing of fat objects. CoRR (2015)
Farhad Shahrokhi
Bounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid. CoRR (2015)
Farhad Shahrokhi
A new upper bound for the clique cover number with applications. CoRR (2015)
Farhad Shahrokhi
New representation results for planar graphs. CoRR (2015)
Farhad Shahrokhi
Guest Editor's Foreword: Algorithms, Combinatorics, & Geometry. Algorithmica 60 (3) (2011)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
On k-planar crossing numbers. Discret. Appl. Math. 155 (9) (2007)
János Pach, Farhad Shahrokhi
Guest Editors' Foreword. Algorithmica 47 (4) (2007)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bounds and Methods for k-Planar Crossing Numbers. Graph Drawing (2003)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bounds for Convex Crossing Numbers. COCOON (2003)
Farhad Shahrokhi, László A. Székely
Guest Editors' Foreword. Discret. Comput. Geom. 28 (4) (2002)
Farhad Shahrokhi, László A. Székely
Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem. Discret. Appl. Math. 108 (1-2) (2001)
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) (2000)
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) (2000)
Farhad Shahrokhi, Weiping Shi
On Crossing Sets, Disjoint Sets, and Pagenumber. J. Algorithms 34 (1) (2000)
Farhad Shahrokhi, Imrich Vrto
On 3-Layer Crossings and Pseudo Arrangements. Graph Drawing (1999)
Farhad Shahrokhi, László A. Székely
Integral Uniform Flows in Symmetric Networks. WG (1998)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
on Surfaces. Discret. Comput. Geom. 19 (2) (1998)
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)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Bipartite Crossing Numbers of Meshes and Hypercubes. Graph Drawing (1997)
János Pach, Farhad Shahrokhi, Mario Szegedy
Applications of the Crossing Number. Algorithmica 16 (1) (1996)
Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrt'o
The book crossing number of a graph. J. Graph Theory 21 (4) (1996)
Farhad Shahrokhi, Weiping Shi
Efficient Deterministic Algorithms for Embedding Graphs on Books. COCOON (1996)
Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto
Drawings of Graphs on Surfaces with Few Crossings. Algorithmica 16 (1) (1996)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Crossing Numbers of Meshes. Graph Drawing (1995)
Farhad Shahrokhi, László A. Székely
On Canonical Concurrent Flows, Crossing Number and Graph Expansion. Comb. Probab. Comput. 3 (1994)
János Pach, Farhad Shahrokhi, Mario Szegedy
Applications of the Crossing Number. SCG (1994)
Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
Book Embeddings and Crossing Numbers. WG (1994)
Farhad Shahrokhi, László A. Székely, Imrich Vrto
Crossing Numbers of Graphs, Lower Bound Techniques. Graph Drawing (1994)
Farhad Shahrokhi, László A. Székely
Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). WG (1993)
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)
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)
Lane H. Clark, Farhad Shahrokhi, László A. Székely
A Linear Time Algorithm for Graph Partition Problems. Inf. Process. Lett. 42 (1) (1992)
David W. Matula, Farhad Shahrokhi
Sparsest cuts and bottlenecks in graphs. Discret. Appl. Math. 27 (1-2) (1990)
Farhad Shahrokhi, David W. Matula
The Maximum Concurrent Flow Problem J. ACM 37 (2) (1990)
Farhad Shahrokhi
Approximation Algorithms for the Maximum Concurrent Flow Problem. INFORMS J. Comput. 1 (2) (1989)
G. Lindhorst, Farhad Shahrokhi
On Renaming a Set of Clauses as a Horn Set. Inf. Process. Lett. 30 (6) (1989)
Farhad Shahrokhi, David W. Matula
On solving large maximum concurrent flow problems. ACM Conference on Computer Science (1987)
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)