10 citations · 12 across the 5 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
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…
cs.GR2015
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…