- Language
-
Englisch
- Extent
-
xxi, 257 Seiten
- ISBN
-
978-3-7983-2825-9
- Identifier
-
1119091098
- Series
-
Foundations of computing; volume 6
Subject
Entscheidungsproblem ; Wahlverfahren ; Wahlverhalten ; Präferenz ; Kollektiventscheidung ; Berechenbarkeit ; Parametrisierte Komplexität ; NP-hartes Problem ; Hochschulschrift
- Table of contents
- Rights
-
Der Zugriff auf Teile des Objekts ist unbeschränkt möglich.
- Last update
-
15.04.2024, 8:44 AM CEST
Object type
- Monografie
Other Objects (12)
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Fine-grained complexity analysis of some combinatorial data science problems
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Multivariate complexity analysis of team management problems
Multivariate complexity analysis of team management problems
Anonymous distributed computing : computability, randomization and checkability
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Fine-grained complexity analysis of some combinatorial data science problems
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Multivariate complexity analysis of team management problems
Multivariate complexity analysis of team management problems
Anonymous distributed computing : computability, randomization and checkability
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Fine-grained complexity analysis of some combinatorial data science problems
Fixed-parameter linear-time algorithms for NP-hard graph and hypergraph problems arising in industrial applications
Multivariate complexity analysis of team management problems
Multivariate complexity analysis of team management problems
Anonymous distributed computing : computability, randomization and checkability
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics