#### Filter Results:

- Full text PDF available (27)

#### Publication Year

2004

2013

- This year (0)
- Last 5 years (2)
- Last 10 years (28)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Nadja Betzler, Arkadii M. Slinko, Johannes Uhlmann
- J. Artif. Intell. Res.
- 2013

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)

- Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger
- IJCAI
- 2011

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. A Borda winner is a candidate… (More)

- Falk Hüffner, Nadja Betzler, Rolf Niedermeier
- WEA
- 2007

The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social networks, systems… (More)

We study the NP-complete Graph Motif problem: given a vertex-colored graph G = (V, E) and a multiset M of colors, does there exist an S ⊆ V such that G[S] is connected and carries exactly (also with… (More)

- Yoram Bachrach, Nadja Betzler, Piotr Faliszewski
- AAAI
- 2010

We study the computational complexity of the counting version of the POSSIBLE-WINNER problem for elections. In the POSSIBLE-WINNER problem we are given a profile of voters, each with a partial… (More)

- Falk Hüffner, Nadja Betzler, Rolf Niedermeier
- J. Comb. Optim.
- 2010

Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this approach to handle… (More)

The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “consensus permutation”… (More)

- Nadja Betzler, Britta Dorn
- MFCS
- 2009

To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated according to a voting… (More)

- Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond
- Theor. Comput. Sci.
- 2009

The computation of Kemeny rankings is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “consensus… (More)

- Jochen Alber, Nadja Betzler, Rolf Niedermeier
- Annals OR
- 2006

We present empirical results on computing optimal dominating sets in networks by means of data reduction through preprocessing rules. Thus, we demonstrate the usefulness of so far only theoretically… (More)