# Farhad Shahrokhi

According to our database

Collaborative distances:

^{1}, Farhad Shahrokhi authored at least 44 papers between 1986 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2020

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

CoRR, 2020

CoRR, 2020

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

Algorithms, 2020

2018

CoRR, 2018

2017

CoRR, 2017

CoRR, 2017

2015

CoRR, 2015

CoRR, 2015

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

CoRR, 2015

CoRR, 2015

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

CoRR, 2015

2011

Algorithmica, 2011

2007

Discret. Appl. Math., 2007

Algorithmica, 2007

2003

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

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

2002

Discret. Comput. Geom., 2002

2001

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

Discret. Appl. Math., 2001

2000

Theor. Comput. Sci., 2000

SIAM J. Comput., 2000

J. Algorithms, 2000

1999

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

1998

Intersection of Curves and Crossing Number of C<sub>m</sub> x C<sub>n</sub> on Surfaces.

Discret. Comput. Geom., 1998

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

1997

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

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

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

1996

J. Graph Theory, 1996

Algorithmica, 1996

Algorithmica, 1996

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

1995

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

1994

Comb. Probab. Comput., 1994

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

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

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

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

1992

Inf. Process. Lett., 1992

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

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

1990

J. ACM, April, 1990

Discret. Appl. Math., 1990

1989

Inf. Process. Lett., 1989

INFORMS J. Comput., 1989

1987

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).

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