Nadja Betzler

Technische Universität Berlin — Germany

Computer Science · Physical Sciences

21h-index1.3kcitations37works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(23), Game Theory and Voting Systems(21), Advanced Graph Theory Research(17), Logic, Reasoning, and Knowledge(6), Auction Theory and Applications(6)

Publications37 total

Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation
Autonomous Agents and Multi-Agent Systems·2013· 53 cited
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion
Algorithmica·2012· 8 cited
Studies in computational aspects of voting: open problems of downey and fellows
Springer eBooks·2012· 1 cited
Studies in Computational Aspects of Voting
Lecture notes in computer science·2012· 22 cited
Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective.
2012· 47 cited
On Bounded-Degree Vertex Deletion parameterized by treewidth
Discrete Applied Mathematics·2011· 47 cited
A multivariate complexity analysis of voting problems
Common Library Network (Der Gemeinsame Bibliotheksverbund)·2011· 12 citedOpen Access
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics·2011· 59 cited
On the Computation of Fully Proportional Representation
SSRN Electronic Journal·2011· 7 citedOpen Access
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion
Lecture notes in computer science·2011· 6 cited
Unweighted coalitional manipulation under the Borda rule is NP-hard
TU/e Research Portal·2011· 97 cited
Average parameterization and partial kernelization for computing medians
Journal of Computer and System Sciences·2010· 44 cited
Probabilistic Possible Winner Determination
Proceedings of the AAAI Conference on Artificial Intelligence·2010· 58 citedOpen Access
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
Journal of Computer and System Sciences·2010· 86 citedOpen Access
Eine Multivariate Komplexitätsanalyse von Wahlproblemen.
Ausgezeichnete Informatikdissertationen·2010
Partial Kernelization for Rank Aggregation: Theory and Experiments
Lecture notes in computer science·2010· 21 cited
Average Parameterization and Partial Kernelization for Computing Medians
Lecture notes in computer science·2010· 8 cited
On Problem Kernels for Possible Winner Determination under the k-Approval Protocol
Lecture notes in computer science·2010· 11 cited
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
arXiv (Cornell University)·2009· 1 citedOpen Access
Parameterized computational complexity of Dodgson and Young elections
Information and Computation·2009· 53 cited
page 1 of 2Next →

Frequent Co-authors

Rolf Niedermeier(25), Johannes Uhlmann(8), Robert Bredereck(8), Michael R. Fellows(7), Jiong Guo(7), Frances Rosamond(5), Christian Komusiewicz(4), Britta Dorn(3), Jiehua Chen(3), Falk Hüffner(2), Jochen Alber(1), Gerhard J. Woeginger(1), Susanne Hemmann(1), René van Bevern(1), Yoram Bachrach(1), Piotr Faliszewski(1), Jiong Guo(1), Hans L. Bodlaender(1), Arkadii Slinko(1), Jiaxing Guo(1)