Dr. Nadja Betzler

• Nadja Betzler, Robert Bredereck, Rolf Niedermeier, and Johannes Uhlmann:
  On Bounded-Degree Vertex Deletion parameterized by treewidth.
  Discrete Applied Mathematics 160(1-2): 53-60 (2012)

• Nadja Betzler
  Multivariate Komplexitätsanalyse von Wahlproblemen
  Ausgezeichnete Informatikdissertationen 2010. Lecture Notes in Informatics (LNI) - Dissertations, Volume D-11, 2011.

• Nadja Betzler, Robert Bredereck, Rolf Niedermeier, and Johannes Uhlmann:
  On Making a Distinguished Vertex Minimum Degree by Vertex Deletion
  In Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11), Nový Smokovec, Slovakia, January 2011.
• Nadja Betzler, Rolf Niedermeier, and Gerhard J. Woeginger
  Unweighted Coalitional Manipulation under the Borda Rule Is NP-Hard.
  Proceedings of the 22th International Joint Conference on Artificial Intelligence (IJCAI'11), Barcelona, Catalonia, Spain, July 2011.
  Distinguished paper award.

• Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, and Rolf Niedermeier
  Parameterized Algorithmics for Finding Connected Motifs in Biological Networks.
  IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(5):1296–1308, 2011 (original publication).
• Nadja Betzler, Jiong Guo, Christian Komusiewicz, and Rolf Niedermeier
  Average Parameterization and Partial Kernelization for Computing Medians.
  Journal of Computer and System Sciences. 8(5): 1296–1308, 2011 . ( original publication)
  

• Nadja Betzler, Robert Bredereck, and Rolf Niedermeier
  Partial Kernelization for Rank Aggregation: Theory and Experiments.
  In Proceedings of the International Symposium on Parameterized and Exact Computation (IPEC'10), Chennai, India, December 2010.
• Nadja Betzler
  On Problem Kernels for Possible Winner Determination Under the k-Approval Protocol.
  In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), Brno, Czech Republic, August 2010.
  Volume 6281 in Lecture Notes in Computer Science, pages 114–125, Springer (original publication).
• Yoram Bachrach, Nadja Betzler, and Piotr Faliszewski
  Probabilistic Possible Winner Determination.
  In Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI-2010), Atlanta, Georgia, USA, July 2010. Pages 697–702, (original publication).
• Nadja Betzler, Jiong Guo, Christian Komusiewicz, and Rolf Niedermeier
  Average Parameterization and Partial Kernelization for Computing Medians.
  In Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN'10), Oaxaca, México, April 2010.
  Volume 6034 in Lecture Notes in Computer Science, pages 60–71, Springer (original publication).
  Journal version available.

• Nadja Betzler and Britta Dorn
  Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
  Journal of Computer and System Sciences 76(8):812-836, 2010 ( original publication)
  
• Nadja Betzler, Jiong Guo, and Rolf Niedermeier
  Parameterized Complexity of Dodgson and Young Elections.
  Information and Computation 208(2): 165-177, 2010 ( original publication)
  

• Nadja Betzler
  A Multivariate Complexity Analysis of Voting Problems.
  Dissertation, Friedrich-Schiller-Universität Jena, 2010.
  a hard copy version can be found at Verlag Dr. Hut
  

• Nadja Betzler and Britta Dorn
  Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
  In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS'09). Novy Smokovec, Slovakia, August 2009. Volume 5734 in Lecture Notes in Computer Science, pages 124-136.
  Journal version available.
• Nadja Betzler, Susanne Hemmann, and Rolf Niedermeier
  A Multivariate Complexity Analysis of Determining Possible Winners Given Incomplete Votes
  In Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 53-58, Pasadena, California, USA, July 2009.
  
• Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, and Frances A. Rosamond
  How similarity helps to efficiently compute Kemeny rankings.
  In Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'09), pp. 657-664, Budapest, Hungary, May 2009.
  A preliminary version of this paper has been presented at the 2nd International Workshop on Computational Social Choice (COMSOC'08), Liverpool, September 2008.
  Journal version available.

• Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, and Frances A. Rosamond
  Fixed-Parameter Algorithms for Kemeny Rankings.
  Theoretical Computer Science, 410(45):4554–4570, 2009 (original publication)
  
• Nadja Betzler and Johannes Uhlmann
  Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems.
  Theoretical Computer Science, 410(52):5425-5442, 2009 (original publication)
  
• Falk Hüffner, Nadja Betzler, and Rolf Niedermeier:
  Separator-based data reduction for signed graph balancing.
  Journal of Combinatorial Optimization.
  Accepted for publication, January 2009. (original publication)
  

• Nadja Betzler and Johannes Uhlmann
  Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems.
  In Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08), St. John's, Newfoundland, Canada. August 2008.
  Volume 5165 in Lecture Notes in Computer Science, pages 43–53, Springer (original publication). Journal version available.
• Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, and Frances A. Rosamond:
  Fixed-Parameter Algorithms for Kemeny Scores.
  In Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08), Shanghai, China. June 2008.
  Volume 5034 in Lecture Notes in Computer Science, pages 60–71, Springer (original publication). Journal version available.
• Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, and Rolf Niedermeier:
  Parameterized algorithms and hardness results for some graph motif problems.
  In Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching (CPM'08), Pisa, Italy. June 2008.
  Volume 5029 in Lecture Notes in Computer Science, pages 31–43, Springer (original publication). Journal version available.
• Nadja Betzler, Jiong Guo, and Rolf Niedermeier:
  Parameterized computational complexity of Dodgson and Young elections.
  In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08), Gothenburg, Sweden. July 2008.
  Volume 5124 in Lecture Notes in Computer Science, pages 402–413, Springer (original publication). Journal version available.

• Falk Hüffner, Nadja Betzler, and Rolf Niedermeier:
  Optimal edge deletions for signed graph balancing.
  In Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07), Rome, Italy. June 2007.
  Volume 4525 in Lecture Notes in Computer Science, pages 297–310, Springer (original publication). Journal version available.

• Jochen Alber, Nadja Betzler, and Rolf Niedermeier:
  Experiments on data reduction for optimal domination in networks.
  Annals of Operations Research, 146(1): 105–117, 2006 (original publication).
• Nadja Betzler, Rolf Niedermeier, and Johannes Uhlmann:
  Tree decompositions of graphs: saving memory in dynamic programming.
  Discrete Optimization, 3(3): 220–229, 2006 (original publication).

• Nadja Betzler
  Steiner Tree Problems in the Analysis of Biological Networks.
  Diplomarbeit, Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, 2006.

• Nadja Betzler, Rolf Niedermeier, and Johannes Uhlmann:
  Tree decompositions of graphs: saving memory in dynamic programming.
  In Proceedings of the Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW'04), Milano, Italy. May/June 2004. Journal version available.

• Jochen Alber, Nadja Betzler, and Rolf Niedermeier:
  Experiments on data reduction for optimal domination in networks.
  In Proceedings of the International Network Optimization Conference (INOC'03), Evry/Paris, France. October 2003. Journal version available.