- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Operations research letters 49(6): 908-913 (2021)
- Ereignis
-
Veröffentlichung
- (wo)
-
Hamburg
- (wer)
-
Universitätsbibliothek der Technischen Universität Hamburg-Harburg
- (wann)
-
2021
- Urheber
- DOI
-
10.15480/882.3942
- URN
-
urn:nbn:de:gbv:830-882.0160653
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:29 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.
Beteiligte
- Knop, Dušan
- Koutecký, Martin
- Levin, Asaf
- Mnich, Matthias
- Onn, Shmuel
- Universitätsbibliothek der Technischen Universität Hamburg-Harburg
Entstanden
- 2021
Ähnliche Objekte (12)
Parameterized complexity
Parameterized complexity theory
Parameterized Algorithms for Integer Linear Programs and Their Applications for Allocation Problems
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized Complexity of Graph Burning
Commutativity simplifies proofs of parameterized programs
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
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
Parameterized complexity theory
Parameterized Algorithms for Integer Linear Programs and Their Applications for Allocation Problems
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized Complexity of Graph Burning
Commutativity simplifies proofs of parameterized programs
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
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
Parameterized complexity theory
Parameterized Algorithms for Integer Linear Programs and Their Applications for Allocation Problems
Parameterized Complexity of Diameter
Parameterized Complexity of Diameter
Parameterized Complexity of Graph Burning
Commutativity simplifies proofs of parameterized programs
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized Complexity of Directed Spanner Problems
Parameterized complexity of constraint satisfaction problems