Trapezoid graphs and their coloring

Burstein, 1986, Channel routing, 132

Corneil, 1987, Extensions of permutation and interval graphs, Proceedings 18th Southeastern Conference on Combinatorics, Graph Theory and Computing

Even, 1972, Permutation graphs and transitive graphs, J. Assoc. Comput. Mach., 19, 400, 10.1145/321707.321710

Fishburn, 1985

Golumbic, 1980

Golumbic, 1986, Algorithmic aspects of intersection graphs and representation hypergraphs, Proceedings First International Japan Conference on Graph Theory and Applications

Golumbic, 1984, Tolerance graphs, Discrete Appl. Math., 9, 157, 10.1016/0166-218X(84)90016-7

Golumbic, 1983, Comparability graphs and intersection graphs, Discrete Math., 43, 37, 10.1016/0012-365X(83)90019-5

Hoffman, 1985, On greedy algorithms that succeed, 97

Johnson, 1985, The NP-completeness column: An ongoing guide, J. Algorithms, 6, 434, 10.1016/0196-6774(85)90012-4

Leiserson, 1983, Optimal placement for river routing, SIAM J Comput., 12, 447, 10.1137/0212029

Pinter, 1982, The impact of layer assignment methods on layout algorithms for integrated circuits

Pinter, 1983, River routing: Methodology and analysis, Proceedings Third Caltech Conference on VLSI, 141, 10.1007/978-3-642-95432-0_9

West, 1985, Parameters of partial orders and graphs: packing, covering and representation, 267

Yannakakis, 1982, The complexity of the partial order dimension problem, SIAM J. Algebraic Discrete Methods, 3, 351, 10.1137/0603036