@misc{FrankeSeeligerStomporetal.2026, author = {Franke, Fabian and Seeliger, Frank and Stompor, Tomasz and Wawra, Steffen}, title = {K{\"u}nstliche Intelligenz in Bibliotheken}, volume = {13}, journal = {o-bib. Das offene Bibliotheksjournal}, number = {1}, issn = {2363-9814}, doi = {https://doi.org/10.5282/o-bib/6231}, pages = {1 -- 6}, year = {2026}, abstract = {Der Bibliotheksverbund Bayern und der Kooperative Bibliotheksverbund Berlin-Brandenburg haben in einem gemeinsamen Ideenworkshop im Mai 2025 Potenziale, Herausforderungen, Projekteans{\"a}tze und Handlungsbedarfe bei Anwendung K{\"u}nstlicher Intelligenz in Bibliotheken analysiert und diskutiert. F{\"u}r die Handlungsfelder Interne Gesch{\"a}ftsg{\"a}nge, Bibliotheksdienste, Forschungsnahe Dienste, Informationskompetenz und Analyse von Nutzungsdaten wurden Bedarfe identifiziert, Projektideen entwickelt und Handlungsempfehlungen formuliert.}, language = {de} } @article{VuXuNguyen2025, author = {Vu, Thi Huong and Xu, Hong-Kun and Nguyen, Dong Yen}, title = {Stability of nonhomogeneous split equality and split feasibility problems with possibly nonconvex constraint sets}, journal = {Optimization}, arxiv = {http://arxiv.org/abs/2411.11019}, doi = {10.1080/02331934.2025.2508499}, pages = {1 -- 19}, year = {2025}, abstract = {By applying some techniques of set-valued and variational analysis, we study solution stability of nonhomogeneous split equality problems and nonhomogeneous split feasibility problems, where the constraint sets need not be convex. Necessary and sufficient conditions for the Lipschitz-likeness of the solution maps of the problems are given and illustrated by concrete examples. The obtained results complement those given in [Huong VT, Xu HK, Yen ND. Stability analysis of split equality and split feasibility problems. arXiv:2410.16856.], where classical split equality problems and split feasibility problems have been considered.}, language = {en} } @article{RongChenKochetal.2026, author = {Rong, Guoyang and Chen, Ying and Koch, Thorsten and Honda, Keisuke}, title = {Assessing data quality in citation analysis: A case study of web of science and Crossref}, volume = {20}, journal = {Journal of Informetrics}, number = {1}, publisher = {Elsevier BV}, issn = {1751-1577}, doi = {10.1016/j.joi.2026.101775}, year = {2026}, language = {en} } @inproceedings{DingerGerberGnypetal.2026, author = {Dinger, Patrick and Gerber, Anja and Gnyp, Anna and von Hagel, Frank and Hohmann, Georg and Krause, Celia and Wagner, Sarah and Winkler, Alexander}, title = {Sammlungsdaten als Forschungsdaten in den Digital Humanities}, booktitle = {Book of Abstracts - DHd 2026}, doi = {10.5281/zenodo.18702753}, pages = {69 -- 74}, year = {2026}, language = {de} } @inproceedings{Kunt2025, author = {Kunt, Tim}, title = {Solving the n-Queens Problem in Higher Dimensions}, booktitle = {Operations Research Proceedings 2024. OR 2024}, doi = {10.1007/978-3-031-92575-7_29}, pages = {205 -- 211}, year = {2025}, abstract = {How many mutually non-attacking queens can be placed on a d-dimensional chessboard of size n? The n-queens problem in higher dimensions is a generalization of the well-known n-queens problem. We present an integer programming formulation of the n-queens problem in higher dimensions and several strengthenings through additional valid inequalities. Compared to recent benchmarks, we achieve a speedup in computational time between 15-70x over all instances of the integer programs. Our computational results prove optimality of certificates for several large instances. Breaking additional, previously unsolved instances with the proposed methods is likely possible. On the primal side, we further discuss heuristic approaches to constructing solutions that turn out to be optimal when compared to the IP.}, language = {en} } @inproceedings{KuntBuchholzKhebourietal.2025, author = {Kunt, Tim and Buchholz, Annika and Khebouri, Imene and Koch, Thorsten and Litzel, Ida and Vu, Thi Huong}, title = {Mapping the Web of Science, a large-scale graph and text-based dataset with LLM embeddings}, booktitle = {Operations Research Proceedings 2025. OR 2025}, issn = {1438-0064}, doi = {10.12752/10064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-100646}, year = {2025}, abstract = {Large text data sets, such as publications, websites, and other text-based media, inherit two distinct types of features: (1) the text itself, its information conveyed through semantics, and (2) its relationship to other texts through links, references, or shared attributes. While the latter can be described as a graph structure and can be handled by a range of established algorithms for classification and prediction, the former has recently gained new potential through the use of LLM embedding models. Demonstrating these possibilities and their practicability, we investigate the Web of Science dataset, containing ~56 million scientific publications through the lens of our proposed embedding method, revealing a self-structured landscape of texts.}, language = {en} }