A General Data Reduction Scheme for Domination in Graphs. - Jochen Alber; Britta Dorn; Rolf Niedermeier (SOFSEM, 2006)

Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. - Nadja Betzler; Britta Dorn (MFCS, 2009)

Multivariate Analyis of Swap Bribery - Britta Dorn; Ildikó Schlotter (CoRR, 2010)

Towards a dichotomy for the Possible Winner problem in elections based on scoring rules. - Nadja Betzler; Britta Dorn (J. Comput. Syst. Sci., 2010)

Exploiting bounded signal flow for graph orientation based on cause-effect pairs. - Britta Dorn; Falk Hüffner; Dominikus Krüger; Rolf Niedermeier; Johannes Uhlmann (Algorithms Mol. Biol., 2011)

Multivariate Complexity Analysis of Swap Bribery. - Britta Dorn; Ildikó Schlotter (Algorithmica, 2012)

Being Caught between a Rock and a Hard Place in an Election - Voter Deterrence by Deletion of Candidates. - Britta Dorn; Dominikus Krüger (SOFSEM, 2013)

Asymptotic periodicity of flows in time-depending networks. - Fatih Bayazit; Britta Dorn; Marjeta Kramar Fijavz (Networks Heterog. Media, 2013)

Often Harder than in the Constructive Case: Destructive Bribery in CP-nets. - Britta Dorn; Dominikus Krüger; Patrick Scharpfenecker (WINE, 2015)

Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241). - Craig Boutilier; Britta Dorn; Nicolas Maudet; Vincent Merlin (Dagstuhl Reports, 2015)

Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps. - Janosch Döcker; Britta Dorn; Ulle Endriss; Dominikus Krüger (ECAI, 2016)

On the hardness of bribery variants in voting with CP-nets. - Britta Dorn; Dominikus Krüger (Ann. Math. Artif. Intell., 2016)

On planar variants of the monotone satisfiability problem with bounded variable appearances. - Andreas Darmann; Janosch Döcker; Britta Dorn (CoRR, 2016)

On Simplified Group Activity Selection. - Andreas Darmann; Janosch Döcker; Britta Dorn; Jérôme Lang; Sebastian Schneckenburger (ADT, 2017)

The Atkinson Inequality Index in Multiagent Resource Allocation. - Sebastian Schneckenburger; Britta Dorn; Ulle Endriss (AAMAS, 2017)

Tool Auctions. - Janosch Döcker; Britta Dorn; Ulle Endriss; Ronald de Haan; Sebastian Schneckenburger (AAAI, 2018)

The Monotone Satisfiability Problem with Bounded Variable Appearances. - Andreas Darmann; Janosch Döcker; Britta Dorn (Int. J. Found. Comput. Sci., 2018)

Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443). - Magnus Bordewich; Britta Dorn; Simone Linz; Rolf Niedermeier (Dagstuhl Reports, 2019)

Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy. - Janosch Döcker; Britta Dorn; Simone Linz; Charles Semple (Theor. Comput. Sci., 2020)

Obtaining a Proportional Allocation by Deleting Items. - Britta Dorn; Ronald de Haan; Ildikó Schlotter (Algorithmica, 2021)

Minimising inequality in multiagent resource allocation. - Sebastian Schneckenburger; Britta Dorn; Ulle Endriss (Ann. Math. Artif. Intell., 2022)

Simplified group activity selection with group size constraints. - Andreas Darmann; Janosch Döcker; Britta Dorn; Sebastian Schneckenburger (Int. J. Game Theory, 2022)

An even simpler hard variant of Not-All-Equal 3-SAT. - Andreas Darmann; Janosch Döcker; Britta Dorn (CoRR, 2024)