We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchical networks. In particular, we construct optimal VLSI layouts for butterfly networks, generalized hypercubes, and star graphs that have areas within a factor of 1+ o(1) from their lower bounds. We also derive efficient ...

Information visualization offers an opportunity to provide quick overviews and support exploration of the information landscape. However, there are many visualization techniques and layouts to choose from and some designs work better than others. The poster presents four hierarchical layouts developed in our FrbrVis prototype to display bibliographic work families and looks at user’s perception...

A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering. A k-track layout of a graph consists of a vertex k-colouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. The sta...

Bourgain and Yehudayoff recently constructed O(1)-monotone bipartite expanders. By combining this result with a generalisation of the unraveling method of Kannan, we construct 3-monotone bipartite expanders, which is best possible. We then show that the same graphs admit 3-page book embeddings, 2-queue layouts, 4-track layouts, and have simple thickness 2. All these results are best possible.

The old Bulgarian keyboard standard BDS 5237-78 was developed for use mostly on typewriter machines. The wide distribution of the computers forced the update of this standard. On one hand this is because of the need to support symbols such as the Bulgarian quotation marks, the Cyrillic letter I with grave accent, the long dash, etc. On the other hand the so called"phonetic layout"became popular...

We consider orthogonal upward drawings of directed acyclic graphs with nodes of uniform width but node-specific height. One way to draw such graphs is to use a layering technique as provided by the Sugiyama framework [34]. To overcome one of the drawbacks of the Sugiyama Framework, namely, unnecessary edge crossings caused by an unfortunate layer assignment of the nodes, Chimani et al. integrat...

We explore the complexity of tiling finite subsets of the plane, which we call layouts, with a finite set of tiles. The tiles are inspired by Wang tiles and the domino game piece. Each tile is composed of a pair of faces. Each face is colored with one of possible colors. We want to know if a given layout is tileable by a given set of dominoes. In a tiling, dominoes that touch must do so at like...

Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs that access through pointers arbitrary memory objects such as local variables, single struct fields, or arrays slices. We present a logic for memory layouts that covers these applications and show how proof obligation...

Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displays by controlling the aspect ratios of the rectangles that make up a treemap. While these algorithms do improve visibility of small items in a single layout, they introduce instability over time in the display of dyna...

In the framework of the studies for the upgrade of the insertions of the CERN Large Hadron Collider, four optical layouts were proposed with the aim of reducing the beta-function at the collision point down to 25 cm. The different candidate layouts are presented. Results from the studies performed on mechanical and dynamic aperture are summarized, together with the evaluation of beam-beam effec...