Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dr. rer. nat. Daniel Hernandez University of Stuttgart

An Ontology for the Reuse and Tracking of Prefabricated Building Components, , , , , and . Proceedings of the The 2nd International Workshop on Knowledge Graphs for Sustainability (KG4S 2024) colocated with the 21st Extended Semantic Web Conference (ESWC 2024), 3753, page 53-64. CEUR, (May 2024)
An Ontology for the Reuse and Tracking of Prefabricated Building Components, , , , , and . Proceedings of the The 2nd International Workshop on Knowledge Graphs for Sustainability (KG4S 2024) colocated with the 21st Extended Semantic Web Conference (ESWC 2024), 3753, page 53-64. CEUR, (May 2024)Proceedings of the The 2nd International Workshop on Knowledge Graphs for Sustainability (KG4S 2024) colocated with the 21st Extended Semantic Web Conference (ESWC 2024), , , , , and (Eds.) 3753, CEUR, (May 2024)

Daniel Widmann University of Stuttgart

A SiGe-HBT 2:1 analog multiplexer with more than 67 GHz bandwidth, , , , , , , , , and . 2017 IEEE Bipolar/BiCMOS Circuits and Technology Meeting (BCTM), page 146-149. 978-1-5090-6383-3 and 978-1-5090-6382-6 and 978-1-5090-6384-0, IEEE, (2017)
 

Other publications of authors with the same name

Robust Mobile Route Planning with Limited Connectivity., , , and . ALENEX, page 150-159. SIAM / Omnipress, (2012)Bidirectional A* search on time-dependent road networks., , , and . Networks, 59 (2): 240-251 (2012)SHARC: Fast and robust unidirectional routing., and . ACM Journal of Experimental Algorithmics, (2009)Parallel computation of best connections in public transportation networks., , and . ACM Journal of Experimental Algorithmics, (2012)Case Studies., , , and . Algorithm Engineering, volume 5971 of Lecture Notes in Computer Science, page 389-445. Springer, (2010)Landmark-Based Routing in Dynamic Graphs., and . WEA, volume 4525 of Lecture Notes in Computer Science, page 52-65. Springer, (2007)Customizable Route Planning., , , and . SEA, volume 6630 of Lecture Notes in Computer Science, page 376-387. Springer, (2011)Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm., , , , , and . WEA, volume 5038 of Lecture Notes in Computer Science, page 303-318. Springer, (2008)The Shortcut Problem - Complexity and Approximation., , , and . SOFSEM, volume 5404 of Lecture Notes in Computer Science, page 105-116. Springer, (2009)Scalable similarity estimation in social networks: closeness, node labels, and random edge lengths., , , , , and . COSN, page 131-142. ACM, (2013)