11 citations · 66 across the 33 of their papers we have counts for
4 papers · 1 filter
On Graph Crossing Number and Edge Planarization
Julia Chuzhoy, Yury Makarychev, Anastasios Sidiropoulos
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their e…
Fat Polygonal Partitions with Applications to Visualization and Embeddings
Mark de Berg, Krzysztof Onak, Anastasios Sidiropoulos
Let be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular Treemap algorithm visualizes such a tr…
Optimal stochastic planarization
Anastasios Sidiropoulos
It has been shown by Indyk and Sidiropoulos [IS07] that any graph of genus g>0 can be stochastically embedded into a distribution over planar graphs with distortion 2^O(g). This bo…
Randomly removing g handles at once
Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos
Indyk and Sidiropoulos (2007) proved that any orientable graph of genus can be probabilistically embedded into a graph of genus with constant distortion. Viewing a graph…