- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Deutsch
- Notes
-
Berlin, Humboldt-Universität zu Berlin, Dissertation, 2023
- Keyword
-
Graph
Berechnungskomplexität
Dekomposition
NP-hartes Problem
Effizienter Algorithmus
- Event
-
Veröffentlichung
- (where)
-
Berlin
- (who)
-
Humboldt-Universität zu Berlin
- (when)
-
2023
- Creator
- Contributor
-
Kratsch, Stefan
Siebertz, Sebastian
Nederlof, Jesper
- DOI
-
10.18452/27478
- URN
-
urn:nbn:de:kobv:11-110-18452/28211-7
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:58 AM CEST
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.
Associated
- Hegerfeld, Falko
- Kratsch, Stefan
- Siebertz, Sebastian
- Nederlof, Jesper
- Humboldt-Universität zu Berlin
Time of origin
- 2023
Other Objects (12)
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Fine-grained multilayer virtualized systems analysis
Fine-Grained Complexity of Safety Verification
Generating fine-grained surrogate temporal networks
How to emulate fine-grained multithreading
b-Coloring Parameterized by Clique-Width
Parallel parameterized algorithms
Fine-grained Distributed Application Monitoring Using LTTng
Distributed representations for fine-grained entity typing
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Fine-grained multilayer virtualized systems analysis
Fine-Grained Complexity of Safety Verification
Generating fine-grained surrogate temporal networks
How to emulate fine-grained multithreading
b-Coloring Parameterized by Clique-Width
Parallel parameterized algorithms
Fine-grained Distributed Application Monitoring Using LTTng
Distributed representations for fine-grained entity typing
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Visual fine-grained recognition
Fine-grained transactions for NVRAM
Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
Fine-grained multilayer virtualized systems analysis
Fine-Grained Complexity of Safety Verification
Generating fine-grained surrogate temporal networks
How to emulate fine-grained multithreading
b-Coloring Parameterized by Clique-Width
Parallel parameterized algorithms
Fine-grained Distributed Application Monitoring Using LTTng