default search action
Britta Dorn
Person information
- affiliation: University of Tübingen, Wilhelm-Schickard-Institute for Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j10]Sebastian Schneckenburger
, Britta Dorn, Ulle Endriss
Minimising inequality in multiagent resource allocation. Ann. Math. Artif. Intell. 90(4): 339-371 (2022) - [j9]Andreas Darmann, Janosch Döcker, Britta Dorn, Sebastian Schneckenburger:
Simplified group activity selection with group size constraints. Int. J. Game Theory 51(1): 169-212 (2022) - 2021
- [j8]Britta Dorn, Ronald de Haan, Ildikó Schlotter
Obtaining a Proportional Allocation by Deleting Items. Algorithmica 83(5): 1559-1603 (2021) - 2020
- [j7]Janosch Döcker, Britta Dorn, Simone Linz
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy. Theor. Comput. Sci. 822: 72-91 (2020)
2010 – 2019
- 2019
- [i9]Janosch Döcker, Britta Dorn, Simone Linz, Charles Semple:
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy. CoRR abs/1908.05361 (2019) - [i8]Magnus Bordewich, Britta Dorn, Simone Linz
Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443). Dagstuhl Reports 9(10): 134-151 (2019) - 2018
- [j6]Andreas Darmann, Janosch Döcker, Britta Dorn:
The Monotone Satisfiability Problem with Bounded Variable Appearances. Int. J. Found. Comput. Sci. 29(6): 979-993 (2018) - [c11]Janosch Döcker, Britta Dorn, Ulle Endriss, Ronald de Haan, Sebastian Schneckenburger:
Tool Auctions. AAAI 2018: 1015-1022 - 2017
- [c10]Andreas Darmann, Janosch Döcker, Britta Dorn, Jérôme Lang, Sebastian Schneckenburger:
On Simplified Group Activity Selection. ADT 2017: 255-269 - [c9]Britta Dorn, Ronald de Haan, Ildikó Schlotter:
Obtaining a Proportional Allocation by Deleting Items. ADT 2017: 284-299 - [c8]Sebastian Schneckenburger, Britta Dorn, Ulle Endriss:
The Atkinson Inequality Index in Multiagent Resource Allocation. AAMAS 2017: 272-280 - [i7]Britta Dorn, Ronald de Haan, Ildikó Schlotter:
Obtaining a Proportional Allocation by Deleting Items. CoRR abs/1705.11060 (2017) - 2016
- [j5]Britta Dorn, Dominikus Krüger:
On the hardness of bribery variants in voting with CP-nets. Ann. Math. Artif. Intell. 77(3-4): 251-279 (2016) - [c7]Janosch Döcker, Britta Dorn, Ulle Endriss
Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps. ECAI 2016: 802-809 - [i6]Andreas Darmann, Janosch Döcker, Britta Dorn:
On planar variants of the monotone satisfiability problem with bounded variable appearances. CoRR abs/1604.05588 (2016) - 2015
- [c6]Britta Dorn, Dominikus Krüger, Patrick Scharpfenecker:
Often Harder than in the Constructive Case: Destructive Bribery in CP-nets. WINE 2015: 314-327 - [i5]Britta Dorn, Dominikus Krüger, Patrick Scharpfenecker:
Often harder than in the Constructive Case: Destructive Bribery in CP-nets. CoRR abs/1509.08628 (2015) - [i4]Craig Boutilier, Britta Dorn, Nicolas Maudet, Vincent Merlin:
Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241). Dagstuhl Reports 5(6): 1-27 (2015) - 2014
- [i3]Britta Dorn, Dominikus Krüger:
On the Hardness of Bribery Variants in Voting with CP-Nets. CoRR abs/1410.5186 (2014) - 2013
- [j4]Fatih Bayazit, Britta Dorn, Marjeta Kramar Fijavz
Asymptotic periodicity of flows in time-depending networks. Networks Heterog. Media 8(4): 843-855 (2013) - [c5]Britta Dorn, Dominikus Krüger:
Being Caught between a Rock and a Hard Place in an Election - Voter Deterrence by Deletion of Candidates. SOFSEM 2013: 182-193 - 2012
- [j3]Britta Dorn, Ildikó Schlotter
Multivariate Complexity Analysis of Swap Bribery. Algorithmica 64(1): 126-151 (2012) - 2011
- [j2]Britta Dorn, Falk Hüffner
Exploiting bounded signal flow for graph orientation based on cause-effect pairs. Algorithms Mol. Biol. 6: 21 (2011) - [c4]Britta Dorn, Falk Hüffner
Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs. TAPAS 2011: 104-115 - 2010
- [j1]Nadja Betzler, Britta Dorn:
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules. J. Comput. Syst. Sci. 76(8): 812-836 (2010) - [c3]Britta Dorn, Ildikó Schlotter:
Multivariate Complexity Analysis of Swap Bribery. IPEC 2010: 107-122 - [i2]Britta Dorn, Ildikó Schlotter:
Multivariate Analyis of Swap Bribery. CoRR abs/1011.1338 (2010)
2000 – 2009
- 2009
- [c2]Nadja Betzler, Britta Dorn:
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. MFCS 2009: 124-136 - [i1]Nadja Betzler, Britta Dorn:
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules. CoRR abs/0911.3492 (2009) - 2006
- [c1]Jochen Alber, Britta Dorn, Rolf Niedermeier:
A General Data Reduction Scheme for Domination in Graphs. SOFSEM 2006: 137-147
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: