10 citations · 12 across the 5 of their papers we have counts for
7 papers
Browsing Large Graphs with Tile Pyramids and Sleeve Routing in the Browser
Lev Nachmanson, Xiaoji Chen
We present a new way to visualize a large graph in the style of online geographic maps. The method builds a tile pyramid for semantic zoom: at every zoom level the labels of the hi…
A New Approach to GraphMaps, a System Browsing Large Graphs as Interactive Maps
Debajyoti Mondal, Lev Nachmanson
A GraphMaps is a system that visualizes a graph using zoom levels, which is similar to a geographic map visualization. GraphMaps reveals the structural properties of the graph and…
Node Overlap Removal by Growing a Tree
Lev Nachmanson, Arlind Nocaj, Sergey Bereg +2
Node overlap removal is a necessary step in many scenarios including laying out a graph, or visualizing a tag cloud. Our contribution is a new overlap removal algorithm that iterat…
Representing Permutations with Few Moves
Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson +1
Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call…
GraphMaps: Browsing Large Graphs as Interactive Maps
Lev Nachmanson, Roman Prutkin, Bongshin Lee +3
Algorithms for laying out large graphs have seen significant progress in the past decade. However, browsing large graphs remains a challenge. Rendering thousands of graphical eleme…
Drawing Permutations with Few Corners
Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson +1
A permutation may be represented by a collection of paths in the plane. We consider a natural class of such representations, which we call tangles, in which the paths consist of st…
Edge Routing with Ordered Bundles
Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson +1
Edge bundling reduces the visual clutter in a drawing of a graph by uniting the edges into bundles. We propose a method of edge bundling drawing each edge of a bundle separately as…