REFERENCES 449
[ENRS95] G. Even, J. Naor, S. Rao, and B. Schieber. Divide-and-conquer approxi-
mation algorithms via spreading metrics. In Proceedings of the 36th An-
nual IEEE Symposium on Foundations of Computer Science, pages 62–71,
1995.
[ES90] P. Eades and K. Sugiyama. How to draw a directed graph. Journal of
Information Processing, 13(4):424–437, 1990.
[EW94] P. Eades and N. C. Wormald. Edge crossings in drawings of bipartite
graphs. Algorithmica, 11:379–403, 1994.
[FH96] P. C. Fishburn and P. L. Hammer. Bipartite dimensions and bipartite
degree of graphs. Discrete Mathematics, 160:127–148, 1996.
[Flo90] M. M. Flood. Exact and heuristic algorithms for the weighted feedback
arc set problem: A special case of the skew-symetric quadratic assignmen ...