Farhad Shahrokhi

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