- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Jena, Friedrich-Schiller-Universität Jena, Dissertation, 2009
- Ereignis
-
Veröffentlichung
- (wo)
-
Jena
- (wer)
-
Friedrich-Schiller-Universität Jena
- (wann)
-
2009
- Urheber
- Beteiligte Personen und Organisationen
-
Hempel, Harald
Hertrampf, Ulrich
Niedermeier, Rolf
- URN
-
urn:nbn:de:gbv:27-20090309-101953-4
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:03 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Berg, Tobias
- Hempel, Harald
- Hertrampf, Ulrich
- Niedermeier, Rolf
- Friedrich-Schiller-Universität Jena
Entstanden
- 2009
Ähnliche Objekte (12)
A refined complexity analysis of fair districting over graphs
A refined complexity analysis of fair districting over graphs
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Multivariate complexity analysis of team management problems
Classic graph problems made temporal – a parameterized complexity analysis
Fine-grained complexity analysis of some combinatorial data science problems
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Stable matchings beyond stable marriage: models, algorithms, complexity
The power of linear-time data reduction for maximum matching
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
A refined complexity analysis of fair districting over graphs
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Multivariate complexity analysis of team management problems
Classic graph problems made temporal – a parameterized complexity analysis
Fine-grained complexity analysis of some combinatorial data science problems
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Stable matchings beyond stable marriage: models, algorithms, complexity
The power of linear-time data reduction for maximum matching
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
A refined complexity analysis of fair districting over graphs
From Election Fraud to Finding the Dream Team: A Study of the Computational Complexity in Voting Problems and Stability in Hedonic Games
Aspects of Preprocessing Applied to Combinatorial Graph Problems
Multivariate complexity analysis of team management problems
Classic graph problems made temporal – a parameterized complexity analysis
Fine-grained complexity analysis of some combinatorial data science problems
41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Stable matchings beyond stable marriage: models, algorithms, complexity
The power of linear-time data reduction for maximum matching
The Power of Linear-Time Data Reduction for Maximum Matching