フォロー
Farhad Shahrokhi
Farhad Shahrokhi
確認したメール アドレス: unt.edu - ホームページ
タイトル
引用先
引用先
The maximum concurrent flow problem
F Shahrokhi, DW Matula
J. ACM 37 (2), 318-334, 1990
5791990
Applications of the crossing number
J Pach, F Shahrokhi, M Szegedy
Proceedings of the tenth annual symposium on Computational geometry, 198-202, 1994
1871994
Sparsest cuts and bottlenecks in graphs
DW Matula, F Shahrokhi
Discrete Applied Mathematics 27 (1-2), 113-123, 1990
170*1990
On bipartite drawings and the linear arrangement problem
F Shahrokhi, O Sýkora, LA Székely, I Vrto
SIAM Journal on Computing 30 (6), 1773-1789, 2001
992001
Crossing numbers: bounds and applications
F Shahrokhi, O Sýkora, LA Székely, I Vrt’o
Intuitive geometry 6, 179-206, 1995
651995
The book crossing number of a graph
F Shahrokhi, LA Székely, O Sýkora, I Vrt'o
Journal of Graph Theory 21 (4), 413-424, 1996
621996
On crossing sets, disjoint sets, and pagenumber
F Shahrokhi, W Shi
Journal of Algorithms 34 (1), 40-53, 2000
472000
Crossing numbers of graphs, lower bound techniques and algorithms: a survey
F Shahrokhi, LA Székely, I Vrt'o
Graph Drawing: DIMACS International Workshop, GD'94 Princeton, New Jersey …, 1995
331995
Intersection of curves and crossing number of C m× C n on surfaces
F Shahrokhi, O Sýkora, LA Székely, I Vrt'o
Discrete & Computational Geometry 19 (2), 237-247, 1998
291998
The complexity of the bottleneck graph bipartition problem
F Shahrokhi, LA Székely
J. Combin. Math. Combin. Comp 15 (94), 221-226, 1994
291994
The crossing number of a graph on a compact 2-manifold
F Shahrokhi, O Sýkora, LA Székely, I Vrťo
advances in mathematics 123 (2), 105-119, 1996
281996
Book embeddings and crossing numbers
F Shahrokhi, O Sýkora, LA Székely, I Vrt'o
Graph-Theoretic Concepts in Computer Science: 20th International Workshop …, 1995
281995
Drawings of graphs on surfaces with few crossings
F Shahrokhi, LA Szekely, O Sýkora, I Vrt'o
Algorithmica 16, 118-131, 1996
241996
On solving large maximum concurrent flow problems
F Shahrokhi, DW Matula
Proceedings of the 15th annual conference on Computer Science, 205-209, 1987
241987
On k-planar crossing numbers
F Shahrokhi, O Sýkora, LA Székely, I Vrt’o
Discrete applied mathematics 155 (9), 1106-1115, 2007
222007
New representation results for planar graphs
F Shahrokhi
29th European Workshop on Computational Geometry (EuroCG 2013). arXiv:1502 …, 2013
202013
A new lower bound for the bipartite crossing number with applications
F Shahrokhi, O Sýkora, LA Székely, I Vrt'o
Theoretical Computer Science 245 (2), 281-294, 2000
202000
The gap between the crossing numbers and the convex crossing numbers
F Shahrokhi, O Sykora, L Szekely, I Vrto
Contemporary Mathematics 342, 249-258, 2004
182004
An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications
F Shahrokhi, LA Székely
Forschungsinst. für Diskrete Mathematik, 1991
181991
On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
F Shahrokhi, O Sýkora, LA Székely, I Vrt'o
Algorithms and Data Structures: 5th International Workshop, WADS'97 Halifax …, 1997
171997
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20