Monografie
Algorithmic aspects of manipulation and anonymization in social choice and social networks
- Sprache
-
Englisch
- Identifier
-
1156180945
- Reihe
-
Foundations of computing; 4
Thema
Kollektiventscheidung ; Soziales Netzwerk ; Manipulation ; Berechnungskomplexität ; Parametrisierte Komplexität ; NP-hartes Problem ; Approximationsalgorithmus ; Anonymisierung ; Privatsphäre ; Datensicherung
Beteiligte Personen und Organisationen
- DOI
-
10.14279/depositonce-4941
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:57 MEZ
Objekttyp
- Monografie
Beteiligte
- Talmon, Nimrod
- Niedermeier, Rolf
- Niedermeier, Rolf
- Rosenschein, Jeffrey S.
- Shachnai, Hadas
Ähnliche Objekte (12)
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Exploiting structure in computationally hard voting problems
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fine-grained complexity analysis of some combinatorial data science problems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Parameterized Algorithmics for Network Analysis: Clustering & Querying
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Multivariate complexity analysis of team management problems
Exploiting structure in computationally hard voting problems
Privacy enhancing technologies : 11th international symposium ; proceedings
G3P - good privacy protection practice in clinical research : principles of pseudonymization and anonymization
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Exploiting structure in computationally hard voting problems
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fine-grained complexity analysis of some combinatorial data science problems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Parameterized Algorithmics for Network Analysis: Clustering & Querying
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Multivariate complexity analysis of team management problems
Exploiting structure in computationally hard voting problems
Privacy enhancing technologies : 11th international symposium ; proceedings
G3P - good privacy protection practice in clinical research : principles of pseudonymization and anonymization
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Exploiting structure in computationally hard voting problems
Be sparse! Be dense! Be robust! : elements of parameterized algorithmics
Fine-grained complexity analysis of some combinatorial data science problems
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Parameterized Algorithmics for Network Analysis: Clustering & Querying
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Multivariate complexity analysis of team management problems
Exploiting structure in computationally hard voting problems
Privacy enhancing technologies : 11th international symposium ; proceedings