Farhad Shahrokhi

According to our database, Farhad Shahrokhi authored at least 44 papers between 1986 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2020

A performance study of some approximation algorithms for minimum dominating set in a graph.

Jonathan S. Li, Rohan Potru, Farhad Shahrokhi

CoRR, 2020

Bounding the trace function of a hypergraph with applications.

Farhad Shahrokhi

CoRR, 2020

A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph.

Jonathan Li, Rohan Potru, Farhad Shahrokhi

Algorithms, 2020

2018

Strong Pseudo Transitivity and Intersection Graphs.

Farhad Shahrokhi

CoRR, 2018

2017

Unit Incomparability Dimension and Clique Cover Width in Graphs.

Farhad Shahrokhi

CoRR, 2017

Algorithms For Longest Chains In Pseudo- Transitive Graphs.

Farhad Shahrokhi

CoRR, 2017

2015

New representation results for planar graphs.

Farhad Shahrokhi

CoRR, 2015

A new upper bound for the clique cover number with applications.

Farhad Shahrokhi

CoRR, 2015

Bounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid.

Farhad Shahrokhi

CoRR, 2015

A new separation theorem with geometric applications.

Farhad Shahrokhi

CoRR, 2015

New separation theorems and sub-exponential time algorithms for packing and piercing of fat objects.

Farhad Shahrokhi

CoRR, 2015

2011

Guest Editor's Foreword: Algorithms, Combinatorics, & Geometry.

Farhad Shahrokhi

Algorithmica, 2011

2007

On k-planar crossing numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Discret. Appl. Math., 2007

Guest Editors' Foreword.

János Pach, Farhad Shahrokhi

Algorithmica, 2007

2003

Bounds and Methods for k-Planar Crossing Numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, 11th International Symposium, 2003

Bounds for Convex Crossing Numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Guest Editors' Foreword.

Farhad Shahrokhi, László A. Székely

Discret. Comput. Geom., 2002

2001

Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem.

Farhad Shahrokhi, László A. Székely

Discret. Appl. Math., 2001

2000

A new lower bound for the bipartite crossing number with applications.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Theor. Comput. Sci., 2000

On Bipartite Drawings and the Linear Arrangement Problem.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

SIAM J. Comput., 2000

On Crossing Sets, Disjoint Sets, and Pagenumber.

Farhad Shahrokhi, Weiping Shi

J. Algorithms, 2000

1999

On 3-Layer Crossings and Pseudo Arrangements.

Farhad Shahrokhi, Imrich Vrto

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1998

Intersection of Curves and Crossing Number of C_m x C_n on Surfaces.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Discret. Comput. Geom., 1998

Integral Uniform Flows in Symmetric Networks.

Farhad Shahrokhi, László A. Székely

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997

On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Bipartite Crossing Numbers of Meshes and Hypercubes.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1996

The book crossing number of a graph.

Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrt'o

J. Graph Theory, 1996

Drawings of Graphs on Surfaces with Few Crossings.

Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto

Algorithmica, 1996

Applications of the Crossing Number.

János Pach, Farhad Shahrokhi, Mario Szegedy

Algorithmica, 1996

Efficient Deterministic Algorithms for Embedding Graphs on Books.

Farhad Shahrokhi, Weiping Shi

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Crossing Numbers of Meshes.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994

On Canonical Concurrent Flows, Crossing Number and Graph Expansion.

Farhad Shahrokhi, László A. Székely

Comb. Probab. Comput., 1994

Book Embeddings and Crossing Numbers.

Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1994

Crossing Numbers of Graphs, Lower Bound Techniques.

Farhad Shahrokhi, László A. Székely, Imrich Vrto

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Improving Bounds for the Crossing Numbers on Surfaces of Genus g.

Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version).

Farhad Shahrokhi, László A. Székely

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

A Linear Time Algorithm for Graph Partition Problems.

Lane H. Clark, Farhad Shahrokhi, László A. Székely

Inf. Process. Lett., 1992

Effective Lower Bounds for Crossing Number, Bisection Width and Balanced Vertex Separator in Terms of Symmetry.

Farhad Shahrokhi, László A. Székely

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1990

The Maximum Concurrent Flow Problem

Farhad Shahrokhi, David W. Matula

J. ACM, April, 1990

Sparsest cuts and bottlenecks in graphs.

David W. Matula, Farhad Shahrokhi

Discret. Appl. Math., 1990

1989

On Renaming a Set of Clauses as a Horn Set.

G. Lindhorst, Farhad Shahrokhi

Inf. Process. Lett., 1989

Approximation Algorithms for the Maximum Concurrent Flow Problem.

Farhad Shahrokhi

INFORMS J. Comput., 1989

1987

On solving large maximum concurrent flow problems.

Farhad Shahrokhi, David W. Matula

Proceedings of the 15th ACM Annual Conference on Computer Science, 1987

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

Proceedings of the 14th ACM Annual Conference on Computer Science, 1986