default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNadja Betzler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
[b1]Nadja Betzler:
A Multivariate Complexity Analysis of Voting Problems. Friedrich Schiller University of Jena, 2010, ISBN 978-3-86853-723-9, pp. 1-236
Journal Articles
- 2014
- [j14]Nadja Betzler, Robert Bredereck
, Rolf Niedermeier:
Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation. Auton. Agents Multi Agent Syst. 28(5): 721-748 (2014) - [j13]Nadja Betzler, Hans L. Bodlaender, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion. Algorithmica 68(3): 715-738 (2014) - 2013
- [j12]Nadja Betzler, Arkadii Slinko, Johannes Uhlmann:
On the Computation of Fully Proportional Representation. J. Artif. Intell. Res. 47: 475-519 (2013) - 2012
- [j11]Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Bounded-Degree Vertex Deletion parameterized by treewidth. Discret. Appl. Math. 160(1-2): 53-60 (2012) - 2011
- [j10]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) - [j9]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. Biol. Bioinform. 8(5): 1296-1308 (2011) - 2010
- [j8]Nadja Betzler, Jiong Guo, Rolf Niedermeier:
Parameterized computational complexity of Dodgson and Young elections. Inf. Comput. 208(2): 165-177 (2010) - [j7]Falk Hüffner, Nadja Betzler, Rolf Niedermeier:
Separator-based data reduction for signed graph balancing. J. Comb. Optim. 20(4): 335-360 (2010) - [j6]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) - 2009
- [j5]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) - [j4]Nadja Betzler, Johannes Uhlmann:
Parameterized complexity of candidate control in elections and related digraph problems. Theor. Comput. Sci. 410(52): 5425-5442 (2009) - 2006
- [j3]Jochen Alber, Nadja Betzler, Rolf Niedermeier:
Experiments on data reduction for optimal domination in networks. Ann. Oper. Res. 146(1): 105-117 (2006) - [j2]Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree decompositions of graphs: Saving memory in dynamic programming. Discret. Optim. 3(3): 220-229 (2006) - 2004
- [j1]Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. Electron. Notes Discret. Math. 17: 57-62 (2004)
Conference and Workshop Papers
- 2012
- [c16]Nadja Betzler, Robert Bredereck, Jiehua Chen, Rolf Niedermeier:
Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. The Multivariate Algorithmic Revolution and Beyond 2012: 318-363 - 2011
- [c15]Nadja Betzler, Rolf Niedermeier, Gerhard J. Woeginger:
Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard. IJCAI 2011: 55-60 - [c14]Nadja Betzler, Robert Bredereck, Rolf Niedermeier, Johannes Uhlmann:
On Making a Distinguished Vertex Minimum Degree by Vertex Deletion. SOFSEM 2011: 123-134 - 2010
- [c13]Yoram Bachrach, Nadja Betzler, Piotr Faliszewski:
Probabilistic Possible Winner Determination. AAAI 2010: 697-702 - [c12]Nadja Betzler, Robert Bredereck, Rolf Niedermeier:
Partial Kernelization for Rank Aggregation: Theory and Experiments. IPEC 2010: 26-37 - [c11]Nadja Betzler, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier:
Average Parameterization and Partial Kernelization for Computing Medians. LATIN 2010: 60-71 - [c10]Nadja Betzler:
On Problem Kernels for Possible Winner Determination under the k-Approval Protocol. MFCS 2010: 114-125 - 2009
- [c9]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 - [c8]Nadja Betzler, Susanne Hemmann, Rolf Niedermeier:
A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes. IJCAI 2009: 53-58 - [c7]Nadja Betzler, Britta Dorn:
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. MFCS 2009: 124-136 - 2008
- [c6]Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Frances A. Rosamond:
Fixed-Parameter Algorithms for Kemeny Scores. AAIM 2008: 60-71 - [c5]Nadja Betzler, Johannes Uhlmann:
Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. COCOA 2008: 43-53 - [c4]Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, Rolf Niedermeier:
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems. CPM 2008: 31-43 - [c3]Nadja Betzler, Jiong Guo, Rolf Niedermeier:
Parameterized Computational Complexity of Dodgson and Young Elections. SWAT 2008: 402-413 - 2007
- [c2]Falk Hüffner, Nadja Betzler, Rolf Niedermeier:
Optimal Edge Deletions for Signed Graph Balancing. WEA 2007: 297-310 - 2004
- [c1]Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. CTW 2004: 56-60
Parts in Books or Collections
- 2010
- [p1]Nadja Betzler:
Eine Multivariate Komplexitätsanalyse von Wahlproblemen. Ausgezeichnete Informatikdissertationen 2010: 31-40
Informal and Other Publications
- 2014
- [i2]Nadja Betzler, Arkadii Slinko, Johannes Uhlmann:
On the Computation of Fully Proportional Representation. CoRR abs/1402.0580 (2014) - 2009
- [i1]Nadja Betzler, Britta Dorn:
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. CoRR abs/0911.3492 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
