- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Logical Methods in Computer Science, 11.2015, issue 4, paper 17, S. 1–44, DOI: 10.2168/LMCS-11(4:17)2015
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Frankfurt am Main
- (who)
-
Universitätsbibliothek Johann Christian Senckenberg
- (when)
-
2015
- Creator
-
Harwath, Frederik
Heimberg, Lucas
Schweikardt, Nicole
- URN
-
urn:nbn:de:hebis:30:3-306349
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:57 PM CET
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
- Harwath, Frederik
- Heimberg, Lucas
- Schweikardt, Nicole
- Universitätsbibliothek Johann Christian Senckenberg
Time of origin
- 2015
Other Objects (12)
Bounded degree spanning trees
Decomposition theorems
L(Q)-preservation theorems
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Complexity of Normal Forms on Structures of Bounded Degree
Embedding spanning bounded degree graphs in randomly perturbed graphs
Preservation theorems for finite support iterations I.
Preservation theorems for finite support iterations II.
Decomposition of bilinear forms as sums of bounded forms
Proof of the tree packing conjecture for bounded degree trees
Universality for bounded degree spanning trees in randomly perturbed graphs
Bounded degree spanning trees
Decomposition theorems
L(Q)-preservation theorems
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Complexity of Normal Forms on Structures of Bounded Degree
Embedding spanning bounded degree graphs in randomly perturbed graphs
Preservation theorems for finite support iterations I.
Preservation theorems for finite support iterations II.
Decomposition of bilinear forms as sums of bounded forms
Proof of the tree packing conjecture for bounded degree trees
Universality for bounded degree spanning trees in randomly perturbed graphs
Bounded degree spanning trees
Decomposition theorems
L(Q)-preservation theorems
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Complexity of Normal Forms on Structures of Bounded Degree
Embedding spanning bounded degree graphs in randomly perturbed graphs
Preservation theorems for finite support iterations I.
Preservation theorems for finite support iterations II.
Decomposition of bilinear forms as sums of bounded forms
Proof of the tree packing conjecture for bounded degree trees