Dr. Britta Dorn

Juniordozentin

• Computational Social Choice
• Parameterized Complexity
• Flows in Networks

Sommersemester 2019

• Mathematik II für Informatik, Bioinformatik, Medieninformatik, Medizininformatik und Kognitionswissenschaften
• Mathematischer Vorbereitungskurs
• Proseminar Kryptologie

Ältere Lehrveranstaltungen sind im Menü unter 'Teaching' zu finden.

Editorial work, book chapters

• Britta Dorn, Ildikó Schlotter. Having a Hard Time? Explore Parameterized Complexity! In U. Endriss, editor, Trends in Computational Social Choice, AI Access. To appear in 2017.
• Craig Boutilier, Britta Dorn, Nicolas Maudet, Vincent Merlin. Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241). Dagstuhl Reports, 5(6), 1-27 (2015).

Journal articles

• Andreas Darmann, Janosch Döcker, Britta Dorn. The monotone satisfiability problem with bounded variable appearances. International Journal of Foundations of Computer Science 29(6), 979-993, 2018.
• Britta Dorn, Dominikus Krüger. On the hardness of bribery variants in voting with CP-nets. Annals of Mathematics and Artificial Intelligence, 77(3), 251-279 (2016) (original publication).
• Fatih Bayazit, Britta Dorn, Marjeta Kramar Fijavz. Asymptotic periodicity of flows in time-depending networks, Networks and Heterogeneous Media 8(4), 843-855 (2013) (original publication).
• Fatih Bayazit, Britta Dorn, Abdelaziz Rhandi. Flows in networks with delay in the vertices, Mathematische Nachrichten 285(13), 1603–1615 (2012) (original publication).
• Britta Dorn, Ildikó Schlotter. Multivariate complexity of Swap Bribery. Algorithmica, 64 (2012), 126-151, 2012 (original publication).
• Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann. Exploiting bounded signal flow for graph orientation based on cause-effect pairs. Algorithms for Molecular Biology, 6:21, 2011 (original publication).

• Nadja Betzler, Britta Dorn. Towards a dichotomy for possible winners in elections based on scoring rules. Journal of Computer and System Sciences 76 (2010), 812-836 (original publication).

• Britta Dorn, Marjeta Kramar Fijavz, Rainer Nagel, and Agnes Radl, The semigroup approach to transport processes in networks. Physica D 239 (2010) 1416-1421 (original publication).

• Britta Dorn, Vera Keicher, and Eszter Sikolya, Asymptotic periodicity of recurrent flows in infinite networks. Mathematische Zeitschrift 263 (2009), 69- 87 (original publication).

• Britta Dorn, Semigroups for flows in infinite networks. Semigroup Forum 76 (2008), 341-356.

Conference articles

• Janosch Döcker, Britta Dorn, Ulle Endriss, Ronald de Haan, and Sebastian Schneckenburger. Tool Auctions. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI-2018), February 2018.
• Andreas Darmann, Janosch Döcker, Britta Dorn, Jérôme Lang, Sebastian Schneckenburger. On Simplified Group Activity Selection. In Proceedings of the 5th International Conference on Algorithmic Decision Theory (ADT 2017), 2017.

• Britta Dorn, Ronald de Haan, Ildikó Schlotter. Obtaining a Proportional Allocation by Deleting Items. In Proceedings of the 5th International Conference on Algorithmic Decision Theory (ADT 2017), 2017.

• Sebastian Schneckenburger, Britta Dorn, Ulle Endriss. The Atkinson Inequality Index in Multiagent Resource Allocation. In Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2017), IFAAMAS, May 2017.

• Janosch Döcker, Britta Dorn, Ulle Endriss, Dominikus Krüger. Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps. In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI-2016), August 2016.

• Britta Dorn, Dominikus Krüger, Patrick Scharpfenecker. Often harder than in the Constructive Case: Destructive Bribery in CP-nets. In Proceedings of the 11th International Conference on Web and Internet Economics (WINE'15), Volume 9470 in Lecture Notes in Computer Science, 2014, 314-327.

• Britta Dorn, Dominikus Krüger. Being caught between a rock and a hard place in an election – voter deterrence by deletion of candidates. In Proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'13), Špindlerův Mlýn, Czech Republic, January 2013. Volume 7741 in Lecture Notes in Computer Science, 2013, 182-193, Springer.

• Britta Dorn, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, Johannes Uhlmann. Exploiting bounded signal flow for graph orientation based on cause-effect pairs. 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS'11), Rome, Italy, April 2011.

• Britta Dorn, Ildikó Schlotter. Multivariate Complexity Analysis for Swap Bribery. Proceedings of the International Symposium on Parameterized and Exact Computation (IPEC'10), Chennai, India, December 2010.

• Nadja Betzler, Britta Dorn. Towards a dichotomy for possible winners in elections based on scoring rules. Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS’09), Slovakia, August 2009. Lecture Notes in Computer Science 5734 (2009), 124-136.

• Jochen Alber, Britta Dorn, and Rolf Niedermeier, A general data reduction scheme for domination in graphs, In Proceedings of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'06), Merin, Czech Republic, January 2006. Volume 3831 in Lecture Notes in Computer Science, pages 137–147, Springer (original publication).