275 search results - page 42 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
192
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
170
click to vote
IVC
2007
15 years 6 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
189
click to vote
SIGGRAPH
1995
ACM
15 years 10 months ago
1995
ACM
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals...
237
click to vote
MST
2010
15 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
167
click to vote
PODC
2005
ACM
15 years 12 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...