- Sprache
-
Englisch
- Anmerkungen
-
Berlin, Technische Universität Berlin, Diss., 2014
- Identifier
-
1075547113
- Reihe
-
Foundations of computing; 3
Thema
Teamwork ; Komplexität ; Multivariate Analyse ; Hochschulschrift
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:57 MEZ
Objekttyp
- Monografie
Ähnliche Objekte (12)
Multivariate complexity analysis of team management problems
Degree-constrained editing of small-degree graphs
Exploiting structure in computationally hard voting problems
A multivariate complexity analysis of the material consumption scheduling problem
Classic graph problems made temporal – a parameterized complexity analysis
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Multivariate Algorithmics in Biological Data Analysis
Fine-grained complexity analysis of some combinatorial data science problems
Exploiting structure in computationally hard voting problems
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Multivariate complexity analysis of team management problems
Degree-constrained editing of small-degree graphs
Exploiting structure in computationally hard voting problems
A multivariate complexity analysis of the material consumption scheduling problem
Classic graph problems made temporal – a parameterized complexity analysis
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Multivariate Algorithmics in Biological Data Analysis
Fine-grained complexity analysis of some combinatorial data science problems
Exploiting structure in computationally hard voting problems
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Multivariate complexity analysis of team management problems
Degree-constrained editing of small-degree graphs
Exploiting structure in computationally hard voting problems
A multivariate complexity analysis of the material consumption scheduling problem
Classic graph problems made temporal – a parameterized complexity analysis
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Algorithmic aspects of manipulation and anonymization in social choice and social networks
Nowhere dense classes of graphs : characterisations and algorithmic meta-theorems
Multivariate Algorithmics in Biological Data Analysis
Fine-grained complexity analysis of some combinatorial data science problems
Exploiting structure in computationally hard voting problems