Sciweavers

74 search results - page 1 / 15
» Trapezoid Graphs and Generalizations, Geometry and Algorithm...
Sort
View
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
13 years 9 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
COMPGEOM
1995
ACM
13 years 8 months ago
Representation and Computation of Boolean Combinations of Sculptured Models
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
Shankar Krishnan, Atul Narkhede, Dinesh Manocha
DOCENG
2006
ACM
13 years 10 months ago
Minimum sized text containment shapes
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...
Nathan Hurst, Kim Marriott, Peter Moulder
FSTTCS
2009
Springer
13 years 11 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 5 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos