Hochschulschrift
Classic graph problems made temporal – a parameterized complexity analysis
- Alternative title
-
Klassische Graphenprobleme im temporalen Kontext – eine parametrisierte Komplexitätsanalyse
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Berlin, Technische Universität Berlin, Dissertation, 2019
- Bibliographic citation
-
Foundations of Computing ; 13
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Universitätsverlag der TU Berlin
- (when)
-
2020
- Creator
- Contributor
-
Niedermeier, Rolf
Niedermeier, Rolf
Erlebach, Thomas
Klasing, Ralf
- DOI
-
10.14279/depositonce-10551
- Handle
-
11303/11663
- URN
-
urn:nbn:de:101:1-2020120901012282017374
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:52 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Molter, Hendrik
- Niedermeier, Rolf
- Erlebach, Thomas
- Klasing, Ralf
- Universitätsverlag der TU Berlin
Time of origin
- 2020
Other Objects (12)
Classic graph problems made temporal - a parameterized complexity analysis
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of weighted team definability
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Min-Power Asymmetric Connectivity
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
Complexity and approximability of parameterized MAX-CSPs
Classic graph problems made temporal - a parameterized complexity analysis
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of weighted team definability
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Min-Power Asymmetric Connectivity
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
Complexity and approximability of parameterized MAX-CSPs
Classic graph problems made temporal - a parameterized complexity analysis
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Parameterized complexity of configuration integer programs
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of weighted team definability
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Min-Power Asymmetric Connectivity
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity