Sciweavers

33 search results - page 7 / 7
» fsttcs 2004
Sort
View
73
Voted
FSTTCS
2004
Springer
15 years 3 months ago
Short-Cuts on Star, Source and Planar Unfoldings
When studying a 3D polyhedron, it is often easier to cut it open and atten in on the plane. There are several ways to perform this unfolding. Standard unfoldings which have been u...
Vijay Chandru, Ramesh Hariharan, Narasimha M. Kris...
97
Voted
FSTTCS
2009
Springer
15 years 2 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
116
Voted
ISBRA
2009
Springer
15 years 5 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...