- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 10th International Symposium on Parameterized and Exact Computation (IPEC 2015), S. 294-306
- Erschienen in
-
LIPIcs - Leibniz International Proceedings in Informatics ; 43
- Ereignis
-
Veröffentlichung
- (wo)
-
Augsburg, Wadern
- (wer)
-
Universität Augsburg, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
- (wann)
-
2015
- Urheber
- Beteiligte Personen und Organisationen
-
Husfeldt, Thore
Kanj, Iyad
- DOI
-
10.4230/LIPIcs.IPEC.2015.294
- URN
-
urn:nbn:de:bvb:384-opus4-870053
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:49 MEZ
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
- Dell, Holger
- Kim, Eun Jung
- Lampis, Michael
- Mitsou, Valia
- Mömke, Tobias
- Husfeldt, Thore
- Kanj, Iyad
- Universität Augsburg, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
Entstanden
- 2015
Ähnliche Objekte (12)
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Min-Power Asymmetric Connectivity
On the space and circuit complexity of parameterized problems
A Parameterized Complexity View on Collapsing k-Cores
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Min-Power Asymmetric Connectivity
On the space and circuit complexity of parameterized problems
A Parameterized Complexity View on Collapsing k-Cores
Parameterized complexity
Parameterized complexity theory
Parameterized Complexity of Diameter
Model-checking problems, machines and parameterized complexity
Model-checking problems, machines and parameterized complexity
Parameterized complexity of weighted team definability
Computational Complexity of Verifying Parameterized Systems
Parameterized complexity of configuration integer programs
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Parameterized Complexity of Min-Power Asymmetric Connectivity
On the space and circuit complexity of parameterized problems