- Sprache
-
Englisch
- Identifier
-
1156336538
- Reihe
-
Foundations of computing; 6
Thema
Entscheidungsproblem ; Wahlverfahren ; Wahlverhalten ; Präferenz ; Kollektiventscheidung ; Berechenbarkeit ; Parametrisierte Komplexität ; NP-hartes Problem
Beteiligte Personen und Organisationen
- DOI
-
10.14279/depositonce-5113
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:54 MEZ
Objekttyp
- Monografie
Ähnliche Objekte (12)
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Fine-grained complexity analysis of some combinatorial data science problems
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Multivariate complexity analysis of team management problems
Application-oriented collective decision making: experimental toolbox and dynamic environments
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Parameterized algorithmics for time-evolving structures: temporalizing and multistaging
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Fine-grained complexity analysis of some combinatorial data science problems
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Multivariate complexity analysis of team management problems
Application-oriented collective decision making: experimental toolbox and dynamic environments
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Parameterized algorithmics for time-evolving structures: temporalizing and multistaging
Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments
Exploiting structure in computationally hard voting problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Fine-grained complexity analysis of some combinatorial data science problems
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Multivariate complexity analysis of team management problems
Application-oriented collective decision making: experimental toolbox and dynamic environments
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Parameterized algorithmics for time-evolving structures: temporalizing and multistaging