-
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.
-
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),
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.
-
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).
-
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.
|
Talks
| Conferences and Workshops |
-
8th International Conference on Autonomous Agents and Multiagent Systems
(AAMAS'09), Budapest, Hungary, May 2009.
How similarity helps to efficiently compute Kemeny rankings.
-
Dagstuhl Seminar 09171 Adaptive, Output Sensitive, Online and Parameterized Algorithms , Dagstuhl, Germany, April 2009.
Parameterized complexity of Kemeny rankings.
-
56. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen
(Theorietag 2009), Ulm, Germany, February 2009.
Parameterisierte Komplexität von Wahlsystemen
-
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 |
|
Last modified: Mon Jun 8 18:27:35 CEST 2009
|
| |