We investigate two systems of fully proportional representation suggested by Chamberlin & Courant and Monroe. Both systems assign a representative to each voter so that the â€œsum ofâ€¦ (More)

Given an undirected graph G = (V,E) and a nonnegative integer k, the NPhard Cluster Editing problem asks whether G can be transformed into a disjoint union of cliques by modifying at most k edges. Inâ€¦ (More)

Given a bipartite graph G=(V c ,V t ,E) and a nonnegative integer k, the NP-complete Minimum-Flip Consensus Tree problem asks whether G can be transformed, using up toÂ k edge insertions andâ€¦ (More)

The Multicut problem is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimum set of edges or vertices whose removal disconnects each pair. We mainlyâ€¦ (More)

Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimum set of edges orâ€¦ (More)

The NP-hard Colorful Components problem is, given a vertex-colored graph, to delete a minimum number of edges such that no connected component contains two vertices of the same color. It hasâ€¦ (More)