The Borda voting rule is a positional scoring rule where, for m candidates, for every vote the first candidate receives m- 1 points, the second m- 2 points and so on.Expand

We show that Possible Winner is NP-complete for all pure scoring rules except plurality, veto, and the scoring rule defined by the scoring vector (2,1,...,1,0).Expand

We study the NP-complete Graph Motif problem: given a vertex-colored graph G= (V,E) and a multiset Mof colors, does there exist an Si¾? Vsuch that G[S] is connected and carries exactly (also with… Expand

We study the NP-hard LIST-COLORED GRAPH MOTIF problem which, given an undirected list-colored graph G = (V, E) and a multiset M of colors, asks for maximum-cardinality sets S ⊆ V and M' ⊇ M such that G[S] is connected and contains exactly (with respect to multiplicity) the colors in M'.Expand