Nadja Betzler

• Nadja Betzler, Michael R. Fellows, Jiong Guo, Rolf Niedermeier, and Frances A. Rosamond:
  Computing Kemeny rankings, parameterized by the average KT-distance.
  In Proceedings of the 2nd International Workshop on Computational Social Choice (COMSOC'08), Liverpool, September 2008.
  Informal workshop notes.
• 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).
• 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).
• 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).
• 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).
• 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).
• 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.

• 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.

Talks

Conferences and Workshops

2nd International Workshop on Computational Social Choice (COMSOC'08), Liverpool, September 2008. Computing Kemeny rankings, parameterized by the average KT-distance. 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08), St. John's, Newfoundland, Canada. August 2008. Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. 11th Scandinavian Workshop on Algorithm Theory (SWAT'08), Gothenburg, Sweden. July 2008. Parameterized computational complexity of Dodgson and Young elections. 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08), Shanghai, China. June 2008. Fixed-Parameter Algorithms for Kemeny Scores. Dagstuhl Seminar 07431 Computational Issues in Social Choice , Dagstuhl, Germany, October 2007. Parameterized computational complexity of Dodgson and Young elections. International Network Optimization Conference (INOC '03), Evry / Paris, France, October 2003. Experiments on data reduction for optimal domination in networks.

Other things

Girlsday 2007 Wahlkontrolle und Lewis Carrolls Wahlsystem (in german, for high school students) Girlsday 2008 Condorcet, Borda und Kemeny (in german, for high school students) Last modified: Tue Oct 28 14:27:22 CET 2008