Scientific Publications

Becker, R.; Cenzato, D.; Kim, S.-H.; Kociumaka, T.; Kodric, B.; Policriti, A.; Prezza, N.: On the Complexity of Computing the Co-lexicographic Width of a Regular Language. Journal of Computer and System Sciences 158, 103759 (2026)

Dao, H.; Shinde, A.; Athar, S.; Gosain, D.: Clicking into Exposure: Uncovering Privacy Risks of Google Click Identifier in YouTube Ads. Proceedings on Privacy Enhancing Technologies Symposium (accepted)

Zeng, R.; Zhu, X.; Peng, W.; Cao, J.; Guo, Y.; Wang, Z.; Jiang, Q.: Amplitude Exchanging Network for Unsupervised Underwater Image Enhancement. Pattern Recognition 175, 113119 (2026)

Cembrano, J.; Fischer, F.; Klimm, M.: Optimal Impartial Correspondences. Social Choice and Welfare (2025)

Cembrano, J.; Correa, J.; Díaz, G.; Verdugo, V.: Proportionality in Multiple Dimensions to Design Electoral Systems. Social Choice and Welfare (2025)

Cembrano, J.; Fischer, F.; Klimm, M.: Improved Bounds for Single-Nomination Impartial Selection. Mathematics of Operations Research (2025)

Focke, J.; Marx, D.; Inerney, F. M.; Neuen, D.; Sankar, G. S.; Schepper, P.; Wellnitz, P.: Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. ACM Transactions on Algorithms (2025)

Nassajian Mojarrad, F.: A New Approximation Method for Solving Stochastic Differential Equations. Iranian Journal of Science (2025)

Akrami, H.; Ray Chaudhury, B.; Hoefer, M.; Mehlhorn, K.; Schmalhofer, M.; Shahkarami, G.; Varricchio, G.; Vermande, Q.; van Wijland, E.: Maximizing Nash Social Welfare in 2-Value Instances: Delineating Tractability. Mathematics of Operations Research (2025)

Agnihotri, S.; Caspary, J. Y.; Schwarz, L.; Gao, X.; Schmalfuss, J.; Bruhn, A.; Keuper, M.: FlowBench: Benchmarking Optical Flow Estimation Methods for Reliability and Generalization. Transactions on Machine Learning Research 2025 (2025)

Ahmad, J.; AliAbbasi, E.; Sormoli, M. A.; Basdogan, C.: Effect of Finger Orientation on Contact Stiffness and Area During Sliding. IEEE Transactions on Haptics 18 (1), pp. 175 - 187 (2025)

Amiri, S. A.; Popa, A.; Roghani, M.; Shahkarami, G.; Soltani, R.; Vahidi, H.: Complexity of Computing the Anti-Ramsey Numbers for Paths. Theoretical Computer Science 1044, 115271 (2025)

Andres, B.; Di Gregorio, S.; Irmai, J.; Lange, J.-H.: Corrigendum to “A polyhedral study of lifted multicuts” [Discrete Optim. 47 (2023) 100757]. Discrete Optimization 55, 100876 (2025)

Arslan, N.; Reuter, B.; Büch, J.; Lengauer, T.; Obermeier, M.; Kaiser, R.; Pfeifer, N.: Hepatitis C Virus Saint Petersburg Variant Detection With Machine Learning Methods. Journal of Medical Virology 92 (2), e70169 (2025)

Bemana, M.; Leimkühler, T.; Myszkowski, K.; Seidel, H.-P.; Ritschel, T.: Bracket Diffusion: HDR Image Generation by Consistent LDR Denoising. Computer Graphics Forum 44 (2), e70086, pp. 1 - 13 (2025)

Bergeron, G.; Krasnopol, F.; Tourret, S.: A Modular Splitting Framework for Saturation Theorem Proving. Archive of Formal Proofs (2025)

Bernstein, A.; Nanongkai, D.; Wulff-Nilsen, C.: Negative-Weight Single-Source Shortest Paths in Near-Linear Time. Communications of the ACM 68 (2), pp. 87 - 94 (2025)

Bernstein, A.; Nanongkai, D.; Wulff-Nilsen, C.: Negative-Weight Single-Source Shortest Paths in Near-linear Time. Journal of the ACM 72 (4), 23, pp. 1 - 34 (2025)

Bringmann, K.; Carmeli, N.: Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries. Logical Methods in Computer Science 21 (1), 29, pp. 1 - 33 (2025)

Bringmann, K.; Carmeli, N.; Mengel, S.: Tight Fine-Grained Bounds for Direct Access on Join Queries. ACM Transactions on Database Systems 50 (11), 1, pp. 1 - 44 (2025)