- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Parameterized Complexity of Diameter ; day:5 ; month:9 ; year:2022 ; pages:1-27
Algorithmica ; (5.9.2022), 1-27
- Creator
-
Bentert, Matthias
Nichterlein, André
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-022-01032-9
- URN
-
urn:nbn:de:101:1-2022112221023154592774
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:21 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
- Bentert, Matthias
- Nichterlein, André
- SpringerLink (Online service)
Other Objects (12)
Parameterized Complexity of Diameter
Parameterized Complexity of Streaming Diameter and Connectivity Problems
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Graph Burning
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized Complexity of Directed Spanner Problems
Parameterized complexity of constraint satisfaction problems
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Min-Power Asymmetric Connectivity
Parameterized Complexity of Diameter
Parameterized Complexity of Streaming Diameter and Connectivity Problems
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Graph Burning
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized Complexity of Directed Spanner Problems
Parameterized complexity of constraint satisfaction problems
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Min-Power Asymmetric Connectivity
Parameterized Complexity of Diameter
Parameterized Complexity of Streaming Diameter and Connectivity Problems
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Graph Burning
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized Complexity of Directed Spanner Problems
Parameterized complexity of constraint satisfaction problems
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy