Orders, Algorithms, and Applications [electronic resource] : International Workshop ORDAL '94 Lyon, France, July 4–8, 1994 Proceedings / edited by Vincent Bouchitté, Michel Morvan.

Bit-vector encoding for partially ordered sets -- Intervals and orders: What comes after interval orders? -- Dimension and algorithms -- Upward drawings to fit surfaces -- A cleanup on transitive orientation -- A characterization of graphs with vertex cover up to five -- Testing hereditary properties efficiently on average -- Orders, k-sets and fast halfplane search on paged memory -- Triangle graphs and their coloring -- Representation of an order as union of interval orders -- Minimal representation of semiorders with intervals of same length -- The computation of the jump number of convex graphs -- Fast lattice browsing on sparse representation.

This volume is the proceedings of the first International Workshop on Orders, Algorithms, and Applications, held at Lyon, France in July 1994. Ordered sets and the more specifically algorithmic aspects of order theory are of increasing importance, for example in graph theory. They enjoy a recognized place in computer science as well as in mathematics, due to various new developments in the last few years. The nine technical papers accepted for this volume and the four invited papers presented offer a representative perspective on theoretical and applicational aspects of orders and related algorithms.