9842 search results - page 1645 / 1969 » The Complexity of the Matching-Cut Problem |
162
Voted
WABI
2005
Springer
16 years 5 days ago
2005
Springer
d Abstract] Tamir Tuller , Efrat Oron , Erez Makavy , Daniel A. Chamovitz † , and Benny Chor ‡ Tel-Aviv University, Tel-Aviv 69978, Israel. Abstract. We study gene expression d...
162
click to vote
WINE
2005
Springer
16 years 4 days ago
2005
Springer
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
167
click to vote
COMPGEOM
2004
ACM
16 years 3 days ago
2004
ACM
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
172
click to vote
COMPGEOM
2004
ACM
16 years 3 days ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
157
click to vote
PDC
2004
ACM
16 years 3 days ago
2004
ACM
Design is a ubiquitous activity. The complexity of design problems requires communities rather than individuals to address, frame, and solve them. These design communities have to...