Farhad Shahrokhi

Available identifiers

zbMath Open shahrokhi.farhadMaRDI QIDQ169303

List of research outcomes

Publication	Date of Publication	Type
Efficient deterministic algorithms for embedding graphs on books	2024-01-29	Paper
Concurrent flows and packet routing in Cayley graphs (Preliminary version)	2024-01-05	Paper
Book embeddings and crossing numbers	2024-01-05	Paper
Improved bounds for the crossing numbers on surfaces of genus g	2024-01-05	Paper
Bounding the trace function of a hypergraph with applications	2022-10-22	Paper
On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem	2022-08-19	Paper
Bounding the edge cover of a hypergraph	2021-08-18	Paper
Strong Pseudo Transitivity and Intersection Graphs	2019-07-24	Paper
Largest reduced neighborhood clique cover number revisited	2018-04-23	Paper
On the largest reduced neighborhood clique cover number of a graph	2017-04-04	Paper
Bounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid	2016-04-13	Paper
Algorithms For Longest Chains In Pseudo- Transitive Graphs	2015-05-21	Paper
New representation results for planar graphs	2015-02-21	Paper
Clique Cover Width and Clique Sum	2014-04-02	Paper
Unit Incomparability Dimension and Clique Cover Width in Graphs	2014-01-03	Paper
A new upper bound for the clique cover number with applications	2011-07-13	Paper
https://portal.mardi4nfdi.de/entity/Q3015662	2011-07-13	Paper
Bounds for Convex Crossing Numbers	2011-03-18	Paper
Graph Drawing	2009-08-11	Paper
On \(k\)-planar crossing numbers	2007-06-08	Paper
https://portal.mardi4nfdi.de/entity/Q4657594	2005-03-14	Paper
Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem	2001-07-03	Paper
On Bipartite Drawings and the Linear Arrangement Problem	2001-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4501706	2000-09-04	Paper
A new lower bound for the bipartite crossing number with applications	2000-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q4304355	2000-08-14	Paper
On Crossing Sets, Disjoint Sets, and Pagenumber	2000-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4232794	1999-06-15	Paper
https://portal.mardi4nfdi.de/entity/Q4387700	1998-08-10	Paper
Intersection of curves and crossing number of \(C_m\times C_n\) on surfaces	1998-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4352316	1997-10-07	Paper
The crossing number of a graph on a compact 2-manifold	1997-07-07	Paper
https://portal.mardi4nfdi.de/entity/Q4879178	1996-10-29	Paper
Drawings of graphs on surfaces with few crossings	1996-10-20	Paper
Applications of the crossing number	1996-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4871065	1996-05-21	Paper
https://portal.mardi4nfdi.de/entity/Q4873777	1996-04-22	Paper
On Canonical Concurrent Flows, Crossing Number and Graph Expansion	1995-03-30	Paper
https://portal.mardi4nfdi.de/entity/Q4304557	1994-10-13	Paper
A linear time algorithm for graph partition problems	1993-01-16	Paper
Approximation Algorithms for the Maximum Concurrent Flow Problem	1993-01-16	Paper
Sparsest cuts and bottlenecks in graphs	1990-01-01	Paper
The maximum concurrent flow problem	1990-01-01	Paper
On renaming a set of clauses as a Horn set	1989-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Farhad Shahrokhi