- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 10.4230/LIPIcs.ICALP.2018.67
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2018
- Urheber
- DOI
-
10.18154/RWTH-2018-231959
- URN
-
urn:nbn:de:101:1-2020051913550739952996
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:50 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
- Grohe, Martin
- Neuen, Daniel
- Schweitzer, Pascal
- Wiebking, Daniel
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2018
Ähnliche Objekte (12)
Canonizing Graphs of Bounded Tree Width in Logspace
The excluded minor structure theorem, and linkages in large graphs of bounded tree-width
Structures of bounded partition width
Structures of bounded partition width
Universality for bounded degree spanning trees in randomly perturbed graphs
Bounded degree spanning trees
Tree-width for first order formulae
Connected Tree-width and Infinite Gammoids
Minimum-width graph layering revisited
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width: Q/A Session F - Paper F5.D
Proof of the tree packing conjecture for bounded degree trees
Embedding spanning bounded degree graphs in randomly perturbed graphs
Canonizing Graphs of Bounded Tree Width in Logspace
The excluded minor structure theorem, and linkages in large graphs of bounded tree-width
Structures of bounded partition width
Structures of bounded partition width
Universality for bounded degree spanning trees in randomly perturbed graphs
Bounded degree spanning trees
Tree-width for first order formulae
Connected Tree-width and Infinite Gammoids
Minimum-width graph layering revisited
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width: Q/A Session F - Paper F5.D
Proof of the tree packing conjecture for bounded degree trees
Embedding spanning bounded degree graphs in randomly perturbed graphs
Canonizing Graphs of Bounded Tree Width in Logspace
The excluded minor structure theorem, and linkages in large graphs of bounded tree-width
Structures of bounded partition width
Structures of bounded partition width
Universality for bounded degree spanning trees in randomly perturbed graphs
Bounded degree spanning trees
Tree-width for first order formulae
Connected Tree-width and Infinite Gammoids
Minimum-width graph layering revisited
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width: Q/A Session F - Paper F5.D
Proof of the tree packing conjecture for bounded degree trees