The following pages link to Farhad Shahrokhi (Q169303):
Displaying 20 items.
- Sparsest cuts and bottlenecks in graphs (Q810053) (← links)
- On \(k\)-planar crossing numbers (Q885282) (← links)
- On renaming a set of clauses as a Horn set (Q1120278) (← links)
- (Q1198015) (redirect page) (← links)
- A linear time algorithm for graph partition problems (Q1198016) (← links)
- The crossing number of a graph on a compact 2-manifold (Q1352278) (← links)
- Intersection of curves and crossing number of \(C_m\times C_n\) on surfaces (Q1380778) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- Applications of the crossing number (Q1920423) (← links)
- Drawings of graphs on surfaces with few crossings (Q1920424) (← links)
- Bounding the trace function of a hypergraph with applications (Q2089531) (← links)
- On Bipartite Drawings and the Linear Arrangement Problem (Q2706134) (← links)
- Bounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid (Q2799850) (← links)
- Unit Incomparability Dimension and Clique Cover Width in Graphs (Q2869387) (← links)
- On the largest reduced neighborhood clique cover number of a graph (Q2971258) (← links)
- A new upper bound for the clique cover number with applications (Q3015613) (← links)
- (Q3015662) (← links)
- Bounds for Convex Crossing Numbers (Q3082956) (← links)
- The maximum concurrent flow problem (Q3474283) (← links)
- On Crossing Sets, Disjoint Sets, and Pagenumber (Q4943069) (← links)
