- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Karlsruhe, Karlsruher Institut für Technologie (KIT), Dissertation, 2020
- Ereignis
-
Veröffentlichung
- (wo)
-
Karlsruhe
- (wer)
-
KIT-Bibliothek
- (wann)
-
2021
- Urheber
- Beteiligte Personen und Organisationen
-
Wagner, D.
- DOI
-
10.5445/IR/1000133317
- URN
-
urn:nbn:de:101:1-2021060904592967802088
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:56 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
- Hamann, Michael
- Wagner, D.
- KIT-Bibliothek
Entstanden
- 2021
Ähnliche Objekte (12)
Positioning and Scheduling of Wireless Sensor Networks : Models, Complexity, and Scalable Algorithms
Äußerungen aus unserem Leserkreise zu dem Aufsatze: "Hausbesuche und Elternabende" (Jahrg. 1902, Nr. 52) : (Schluß)
Engineering Graph Clustering Algorithms
New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity
Advancing Urban Mobility with Algorithm Engineering
Engineering Route Planning Algorithms for Battery Electric Vehicles
Combinatorial Problems in Energy Networks - Graph-theoretic Models and Algorithms
Planarity Variants for Directed Graphs
Engineering Algorithms for Route Planning in Multimodal Transportation Networks
Algorithm Engineering for Realistic Journey Planning in Transportation Networks
Graph Embeddings Motivated by Greedy Routing
Scheduling Algorithms for the Smart Grid
Positioning and Scheduling of Wireless Sensor Networks : Models, Complexity, and Scalable Algorithms
Äußerungen aus unserem Leserkreise zu dem Aufsatze: "Hausbesuche und Elternabende" (Jahrg. 1902, Nr. 52) : (Schluß)
Engineering Graph Clustering Algorithms
New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity
Advancing Urban Mobility with Algorithm Engineering
Engineering Route Planning Algorithms for Battery Electric Vehicles
Combinatorial Problems in Energy Networks - Graph-theoretic Models and Algorithms
Planarity Variants for Directed Graphs
Engineering Algorithms for Route Planning in Multimodal Transportation Networks
Algorithm Engineering for Realistic Journey Planning in Transportation Networks
Graph Embeddings Motivated by Greedy Routing
Scheduling Algorithms for the Smart Grid
Positioning and Scheduling of Wireless Sensor Networks : Models, Complexity, and Scalable Algorithms
Äußerungen aus unserem Leserkreise zu dem Aufsatze: "Hausbesuche und Elternabende" (Jahrg. 1902, Nr. 52) : (Schluß)
Engineering Graph Clustering Algorithms
New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity
Advancing Urban Mobility with Algorithm Engineering
Engineering Route Planning Algorithms for Battery Electric Vehicles
Combinatorial Problems in Energy Networks - Graph-theoretic Models and Algorithms
Planarity Variants for Directed Graphs
Engineering Algorithms for Route Planning in Multimodal Transportation Networks
Algorithm Engineering for Realistic Journey Planning in Transportation Networks
Graph Embeddings Motivated by Greedy Routing