9842 search results - page 436 / 1969 » The Complexity of the Matching-Cut Problem |
113
click to vote
ORL
2008
15 years 4 months ago
2008
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
130
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved eff...
134
click to vote
GIS
2010
ACM
15 years 3 months ago
2010
ACM
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally define different spatio-temporal criteria under ...
146
click to vote
WDAG
2010
Springer
15 years 3 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
170
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we reso...