In this paper, we give a formula for computing the number of different planat embeddings of any planar biconnected graph. The enumeration method used in deriving the formula readily gives rise to efficient algorithms for the ranking, unranking and random generation of embeddings of the given graph. We also give linear time algorithms for checking planarity and constructing any particular embedding.

No abstract

No abstract

No abstract

The Web Community tolerates bad markup for visual effect even when the practice excludes partially sighted users. This paper describes a two-phase process to recondition websites: deconstruction and building a new skin. It uses cascading style sheets. Deconstruction replaces developer styles with good defaults for partially sighted users. Building a new skin customizes the site for individual preferences. It adjusts font size, font family, color configuration, line height, word spacing and letter spacing. Its styles for lists and tables aid navigation. The process works best on sites that conform to W3C standards. Even marginal sites can be transformed so that the new interface is pleasant so long as the site developer does not misuse markup too aggressively.