C. Bauer et al., “Noctua 2 Supercomputer,”10.17815/jlsrf-8-187 __Journal of large-scale research facilities, vol. 9, 2024, doi:10.17815/jlsrf-8-187  .
LibreCat: /record/53663
DOI: 10.17815/jlsrf-8-187 

A. Khatibi and S. Krauter, “Comparison and Validation of Irradiance Data: Satellite Meteorological Dataset MERRA-2 vs. Meteonorm and German Weather Service (DWD),”10.4229/EUPVSEC20212021-5BV.4.11__in Proceedings of the 38th European Photovoltaic Solar Energy Conference and Exhibition (EUPVSEC 2021), 2021, pp. 1141–1147, doi:10.4229/EUPVSEC20212021-5BV.4.11 .
LibreCat: /record/24551
DOI: 10.4229/EUPVSEC20212021-5BV.4.11

A. Khatibi and S. Krauter, “Validation and Performance of Satellite Meteorological Dataset MERRA-2 for Solar and Wind Applications,”10.3390/en14040882__Energies, vol. 14, no. 4, Art. no. 882, 2021, doi:10.3390/en14040882 .
LibreCat: /record/21265
DOI: 10.3390/en14040882

J. Ludwig, C. Kykal, and H.-J. Schmid, “Assessing spreading and removal of virus laden aerosols in different settings using an aerosol method (Presentation),” in Book of abstracts for the 2021 European Aerosol Conference, 2021.
LibreCat: /record/27551

S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2),”10.4230/LIPIcs.MFCS.2018.58__in 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), Liverpool, UK, 2018, vol. 117, p. 58:1-58:16, doi:10.4230/LIPIcs.MFCS.2018.58 .
LibreCat: /record/8161
DOI: 10.4230/LIPIcs.MFCS.2018.58
arXiv: 1805.11139

N. de Beaudrap and S. Gharibian, “A Linear Time Algorithm for Quantum 2-SAT,”10.4230/LIPIcs.CCC.2016.27__in Proceedings of the 31st Conference on Computational Complexity (CCC 2016), Tokyo, Japan, 2016, vol. 50, p. 27:1–17:21, doi:10.4230/LIPIcs.CCC.2016.27 .
LibreCat: /record/8159
DOI: 10.4230/LIPIcs.CCC.2016.27
arXiv: 1508.07338

O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann, “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem,”10.1007/s10472-013-9341-2__Annals of Mathematics and Artificial Intelligence, vol. 69, no. 2, pp. 151–182, 2013, doi:10.1007/s10472-013-9341-2 .
LibreCat: /record/48889
DOI: 10.1007/s10472-013-9341-2

O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann, “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness,” in Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219, 2012, pp. 115–129.
LibreCat: /record/48890