default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFarhad Shahrokhi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j19]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): 339 (2020)- [i10]Farhad Shahrokhi:
Bounding the trace function of a hypergraph with applications. CoRR abs/2007.13016 (2020) - [i9]Jonathan S. Li, Rohan Potru, Farhad Shahrokhi:
A performance study of some approximation algorithms for minimum dominating set in a graph. CoRR abs/2009.04636 (2020)
2010 – 2019
- 2018
- [i8]Farhad Shahrokhi:
Strong Pseudo Transitivity and Intersection Graphs. CoRR abs/1806.01378 (2018) - 2017
- [i7]Farhad Shahrokhi:
Algorithms For Longest Chains In Pseudo- Transitive Graphs. CoRR abs/1701.05286 (2017) - [i6]Farhad Shahrokhi:
Unit Incomparability Dimension and Clique Cover Width in Graphs. CoRR abs/1705.04395 (2017) - 2015
- [i5]Farhad Shahrokhi:
A new upper bound for the clique cover number with applications. CoRR abs/1502.06168 (2015) - [i4]Farhad Shahrokhi:
New representation results for planar graphs. CoRR abs/1502.06175 (2015) - [i3]Farhad Shahrokhi:
New separation theorems and sub-exponential time algorithms for packing and piercing of fat objects. CoRR abs/1502.06176 (2015) - [i2]Farhad Shahrokhi:
A new separation theorem with geometric applications. CoRR abs/1504.04938 (2015) - [i1]Farhad Shahrokhi:
Bounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid. CoRR abs/1506.06813 (2015) - 2011
- [j18]Farhad Shahrokhi:
Guest Editor's Foreword: Algorithms, Combinatorics, & Geometry. Algorithmica 60(3): 481-483 (2011)
2000 – 2009
- 2007
- [j17]János Pach, Farhad Shahrokhi:
Guest Editors' Foreword. Algorithmica 47(4): 365 (2007) - [j16]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
On k-planar crossing numbers. Discret. Appl. Math. 155(9): 1106-1115 (2007) - 2003
- [c16]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Bounds for Convex Crossing Numbers. COCOON 2003: 487-495 - [c15]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Bounds and Methods for k-Planar Crossing Numbers. GD 2003: 37-46 - 2002
- [j15]Farhad Shahrokhi, László A. Székely:
Guest Editors' Foreword. Discret. Comput. Geom. 28(4): 447-448 (2002) - 2001
- [j14]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): 175-191 (2001) - 2000
- [j13]Farhad Shahrokhi, Weiping Shi:
On Crossing Sets, Disjoint Sets, and Pagenumber. J. Algorithms 34(1): 40-53 (2000) - [j12]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): 1773-1789 (2000) - [j11]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): 281-294 (2000)
1990 – 1999
- 1999
- [c14]Farhad Shahrokhi, Imrich Vrto:
On 3-Layer Crossings and Pseudo Arrangements. GD 1999: 225-231 - 1998
- [j10]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Intersection of Curves and Crossing Number of Cm x Cn on Surfaces. Discret. Comput. Geom. 19(2): 237-247 (1998) - [c13]Farhad Shahrokhi, László A. Székely:
Integral Uniform Flows in Symmetric Networks. WG 1998: 272-284 - 1997
- [c12]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Bipartite Crossing Numbers of Meshes and Hypercubes. GD 1997: 37-46 - [c11]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: 55-68 - 1996
- [j9]János Pach, Farhad Shahrokhi, Mario Szegedy:
Applications of the Crossing Number. Algorithmica 16(1): 111-117 (1996) - [j8]Farhad Shahrokhi, László A. Székely, Ondrej Sýkora, Imrich Vrto:
Drawings of Graphs on Surfaces with Few Crossings. Algorithmica 16(1): 118-131 (1996) - [j7]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): 413-424 (1996) - [c10]Farhad Shahrokhi, Weiping Shi:
Efficient Deterministic Algorithms for Embedding Graphs on Books. COCOON 1996: 162-168 - 1995
- [c9]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Crossing Numbers of Meshes. GD 1995: 463-471 - 1994
- [j6]Farhad Shahrokhi, László A. Székely:
On Canonical Concurrent Flows, Crossing Number and Graph Expansion. Comb. Probab. Comput. 3: 523-543 (1994) - [c8]János Pach, Farhad Shahrokhi, Mario Szegedy:
Applications of the Crossing Number. SCG 1994: 198-202 - [c7]Farhad Shahrokhi, László A. Székely, Imrich Vrto:
Crossing Numbers of Graphs, Lower Bound Techniques. GD 1994: 131-142 - [c6]Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Book Embeddings and Crossing Numbers. WG 1994: 256-268 - 1993
- [c5]Farhad Shahrokhi, László A. Székely:
Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). WG 1993: 327-337 - [c4]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: 388-395 - 1992
- [j5]Lane H. Clark, Farhad Shahrokhi, László A. Székely:
A Linear Time Algorithm for Graph Partition Problems. Inf. Process. Lett. 42(1): 19-24 (1992) - [c3]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: 102-113 - 1990
- [j4]David W. Matula, Farhad Shahrokhi:
Sparsest cuts and bottlenecks in graphs. Discret. Appl. Math. 27(1-2): 113-123 (1990) - [j3]Farhad Shahrokhi, David W. Matula:
The Maximum Concurrent Flow Problem. J. ACM 37(2): 318-334 (1990)
1980 – 1989
- 1989
- [j2]Farhad Shahrokhi:
Approximation Algorithms for the Maximum Concurrent Flow Problem. INFORMS J. Comput. 1(2): 62-69 (1989) - [j1]G. Lindhorst, Farhad Shahrokhi:
On Renaming a Set of Clauses as a Horn Set. Inf. Process. Lett. 30(6): 289-293 (1989) - 1987
- [c2]Farhad Shahrokhi, David W. Matula:
On solving large maximum concurrent flow problems. ACM Conference on Computer Science 1987: 205-209 - 1986
- [c1]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: 494
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
