Britta Dorn

Affiliations:
  • University of Tübingen, Wilhelm-Schickard-Institute for Computer Science, Germany


According to our database1, Britta Dorn authored at least 22 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Simplified group activity selection with group size constraints.
Int. J. Game Theory, 2022

Minimising inequality in multiagent resource allocation.
Ann. Math. Artif. Intell., 2022

2021
Obtaining a Proportional Allocation by Deleting Items.
Algorithmica, 2021

2020
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy.
Theor. Comput. Sci., 2020

2019
Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443).
Dagstuhl Reports, 2019

2018
The Monotone Satisfiability Problem with Bounded Variable Appearances.
Int. J. Found. Comput. Sci., 2018

Tool Auctions.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
The Atkinson Inequality Index in Multiagent Resource Allocation.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

On Simplified Group Activity Selection.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

2016
On planar variants of the monotone satisfiability problem with bounded variable appearances.
CoRR, 2016

On the hardness of bribery variants in voting with CP-nets.
Ann. Math. Artif. Intell., 2016

Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015
Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241).
Dagstuhl Reports, 2015

Often Harder than in the Constructive Case: Destructive Bribery in CP-nets.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

2013
Asymptotic periodicity of flows in time-depending networks.
Networks Heterog. Media, 2013

Being Caught between a Rock and a Hard Place in an Election - Voter Deterrence by Deletion of Candidates.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

2012
Multivariate Complexity Analysis of Swap Bribery.
Algorithmica, 2012

2011
Exploiting bounded signal flow for graph orientation based on cause-effect pairs.
Algorithms Mol. Biol., 2011

2010
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules.
J. Comput. Syst. Sci., 2010

Multivariate Analyis of Swap Bribery
CoRR, 2010

2009
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2006
A General Data Reduction Scheme for Domination in Graphs.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006


  Loading...