Dorothea Baumeister

Available identifiers

zbMath Open baumeister.dorotheaMaRDI QIDQ372956

List of research outcomes

Publication	Date of Publication	Type
The possible winner with uncertain weights problem	2023-08-21	Paper
Complexity of manipulative interference in participatory budgeting	2023-03-31	Paper
https://portal.mardi4nfdi.de/entity/Q5039141	2022-10-12	Paper
Acceptance in incomplete argumentation frameworks	2021-11-02	Paper
Complexity of control in judgment aggregation for uniform premise-based quota rules	2020-06-09	Paper
https://portal.mardi4nfdi.de/entity/Q5215684	2020-02-12	Paper
Verification in incomplete argumentation frameworks	2019-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4583946	2018-08-29	Paper
Strategy-proofness of scoring allocation correspondences for indivisible goods	2018-03-28	Paper
https://portal.mardi4nfdi.de/entity/Q5282956	2017-07-18	Paper
Computational Aspects of Approval Voting	2016-11-08	Paper
Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules	2015-12-18	Paper
https://portal.mardi4nfdi.de/entity/Q3457207	2015-12-11	Paper
Verification in Attack-Incomplete Argumentation Frameworks	2015-11-04	Paper
Verification in Argument-Incomplete Argumentation Frameworks	2015-11-04	Paper
Complexity of Bribery and Control for Uniform Premise-Based Quota Rules Under Various Preference Types	2015-11-04	Paper
Winner Determination and Manipulation in Minisum and Minimax Committee Elections	2015-11-04	Paper
Computational Aspects of Manipulation and Control in Judgment Aggregation	2013-12-17	Paper
The complexity of computing minimal unidirectional covering sets	2013-10-21	Paper
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules	2012-05-04	Paper
How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation	2011-10-28	Paper
The complexity of computing minimal unidirectional covering sets	2010-05-28	Paper
The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions	2009-11-27	Paper
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem	2009-06-23	Paper
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem	2009-03-05	Paper
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions	2008-11-20	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Dorothea Baumeister