The maximum concurrent flow problem (MCFP) is a multicommodity flow problem in which every pair of entities can send and receive flow concurrently. The ratio of the flow supplied between a pair ofâ€¦ (More)

The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is close to the minimumâ€¦ (More)

We give a survey of techniques for deriving lower bounds and algorithms for constructing upper bounds for several variations of the crossing number problem. 1 aim is to emphasize the more generalâ€¦ (More)

We show that any graph of <italic>n</italic> vertices that can be drawn in the plane with no <italic>k</italic>+1 pairwise crossing edges has at mostâ€¦ (More)

We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorphisms Î“ < Aut(G).â€¦ (More)

We give drawings of a complete graphK n withO(n 4 log2 g/g) many crossings on an orientable or nonorientable surface of genusg â‰¥ 2. We use these drawings ofK n and give a polynomial-time algorithmâ€¦ (More)

A universal representation theorem is derived that shows any graph is the intersection graph of one chordal graph, a number of co-bipartite graphs, and one unit interval graph. Central to the theâ€¦ (More)