Hochschulschrift
Classic graph problems made temporal - a parameterized complexity analysis
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783798331723
3798331723
- Dimensions
-
21 cm, 465 g
- Extent
-
xii, 206 Seiten
- Language
-
Englisch
- Notes
-
Illustrationen
Technische Universität Berlin, Dissertation, 2019
- Bibliographic citation
-
Foundations of computing ; 13
- Classification
-
Informatik
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Universitätsverlag der TU Berlin
- (when)
-
2020
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 12:00 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
- Technische Universität Berlin. Universitätsbibliothek
- 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