- Alternative title
-
Ausnutzung von Strukturen in berechnungsschweren Wahlproblemen
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Berlin, Technische Universität Berlin, Dissertation, 2015
- Bibliographic citation
-
Foundations of computing ; 6
- Keyword
-
Entscheidungsproblem
Wahlverfahren
Wahlverhalten
Präferenz
Kollektiventscheidung
Berechenbarkeit
Parametrisierte Komplexität
NP-hartes Problem
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Universitätsverlag der TU Berlin
- (when)
-
2016
- Creator
- Contributor
- DOI
-
10.14279/depositonce-5113
- Handle
-
11303/5438
- URN
-
urn:nbn:de:101:1-201804183383
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:03 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Chen, Jiehua
- Niedermeier, Rolf
- Lang, Jérôme
- Elkind, Edith
- Technische Universität Berlin. Universitätsbibliothek
- Universitätsverlag der TU Berlin
Time of origin
- 2016
Other Objects (12)
Exploiting structure in computationally hard voting problems
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Preprocessing to Deal with Hard Problems
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
A refined complexity analysis of fair districting over graphs
Modification-fair cluster editing
Exploiting structure in computationally hard voting problems
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Preprocessing to Deal with Hard Problems
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
A refined complexity analysis of fair districting over graphs
Modification-fair cluster editing
Exploiting structure in computationally hard voting problems
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Preprocessing to Deal with Hard Problems
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
Exploiting bounded signal flow for graph orientation based on cause–effect pairs
The Power of Linear-Time Data Reduction for Maximum Matching
Majority Relations and Tournament Solutions : A Computational Study
A refined complexity analysis of fair districting over graphs