Nadja Betzler

	2012
28		Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann: On Bounded-Degree Vertex Deletion parameterized by treewidth. Discrete Applied Mathematics 160(1-2): 53-60 (2012)
	2011
27		Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger: Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. IJCAI 2011: 55-60
26		Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann: On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. SOFSEM 2011: 123-134
25		Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier: Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE/ACM Trans. Comput. Biology Bioinform. 8(5): 1296-1308 (2011)
24		Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier: Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. 77(4): 774-789 (2011)
	2010
23		Yoram Bachrach, Nadja Betzler, Piotr Faliszewski: Probabilistic Possible Winner Determination. AAAI 2010
22		Nadja Betzler, Robert Bredereck, Rolf Niedermeier: Partial Kernelization for Rank Aggregation: Theory and Experiments. IPEC 2010: 26-37
21		Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier: Average Parameterization and Partial Kernelization for Computing Medians. LATIN 2010: 60-71
20		Nadja Betzler: On Problem Kernels for Possible Winner Determination under the k-Approval Protocol. MFCS 2010: 114-125
19		Nadja Betzler, Jiong Guo, Rolf Niedermeier: Parameterized computational complexity of Dodgson and Young elections. Inf. Comput. 208(2): 165-177 (2010)
18		Falk Hüffner, Nadja Betzler, Rolf Niedermeier: Separator-based data reduction for signed graph balancing. J. Comb. Optim. 20(4): 335-360 (2010)
17		Nadja Betzler, Britta Dorn: Towards a dichotomy for the Possible Winner problem in elections based on scoring rules. J. Comput. Syst. Sci. 76(8): 812-836 (2010)
16		Nadja Betzler: A Multivariate Complexity Analysis of Voting Problems. Friedrich Schiller University of Jena 2010: 1-236
	2009
15		Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: How similarity helps to efficiently compute Kemeny rankings. AAMAS (1) 2009: 657-664
14		Nadja Betzler, Susanne Hemmann, Rolf Niedermeier: A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. IJCAI 2009: 53-58
13		Nadja Betzler, Britta Dorn: Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. MFCS 2009: 124-136
12		Nadja Betzler, Britta Dorn: Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules CoRR abs/0911.3492: (2009)
11		Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-parameter algorithms for Kemeny rankings. Theor. Comput. Sci. 410(45): 4554-4570 (2009)
10		Nadja Betzler, Johannes Uhlmann: Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52): 5425-5442 (2009)
	2008
9		Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond: Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71
8		Nadja Betzler, Johannes Uhlmann: Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. COCOA 2008: 43-53
7		Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier: Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM 2008: 31-43
6		Nadja Betzler, Jiong Guo, Rolf Niedermeier: Parameterized Computational Complexity of Dodgson and Young Elections. SWAT 2008: 402-413
	2007
5		Falk Hüffner, Nadja Betzler, Rolf Niedermeier: Optimal Edge Deletions for Signed Graph Balancing. WEA 2007: 297-310
	2006
4		Jochen Alber, Nadja Betzler, Rolf Niedermeier: Experiments on data reduction for optimal domination in networks. Annals OR 146(1): 105-117 (2006)
3		Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann: Tree decompositions of graphs: Saving memory in dynamic programming. Discrete Optimization 3(3): 220-229 (2006)
	2004
2		Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann: Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. CTW 2004: 56-60
1		Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann: Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Electronic Notes in Discrete Mathematics 17: 57-62 (2004)

Coauthor Index

1	Jochen Alber	[4]
2	Yoram Bachrach	[23]
3	René van Bevern	[25]
4	Robert Bredereck	[22] [26] [28]
5	Britta Dorn	[12] [13] [17]
6	Piotr Faliszewski	[23]
7	Michael R. Fellows (Mike Fellows)	[7] [9] [11] [15] [25]
8	Jiong Guo	[6] [9] [11] [15] [19] [21] [24]
9	Susanne Hemmann	[14]
10	Falk Hüffner	[5] [18]
11	Christian Komusiewicz	[7] [21] [24] [25]
12	Rolf Niedermeier	[1] [2] [3] [4] [5] [6] [7] [9] [11] [14] [15] [18] [19] [21] [22] [24] [25] [26] [27] [28]
13	Frances A. Rosamond	[9] [11] [15]
14	Johannes Uhlmann	[1] [2] [3] [8] [10] [26] [28]
15	Gerhard J. Woeginger	[27]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page