Castenow, J., Harbig, J., Jung, D., Knollmann, T., &; Meyer auf der Heide, F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for Chain-Formation. Theoretical Computer Science, 939, 261–291.https://doi.org/10.1016/j.tcs.2022.10.031 

Silva, H. O. M., Rubert, D. P., Araujo, E., Steffen, E., Doerr, D., &; Martinez, F. V. (2023). Algorithms for the genome median under a restricted measure of rearrangement. RAIRO - Operations Research, 57(3), 1045–1058.https://doi.org/10.1051/ro/2023052 

Schade, R., Kenter, T., Elgabarty, H., Lass, M., Kühne, T., &; Plessl, C. (2023). Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics. The International Journal of High Performance Computing Applications, Article 109434202311776.https://doi.org/10.1177/10943420231177631 

Gräßler, I., Bodden, E., Wiechel, D., &; Pottebaum, J. (2023). Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security. Konstruktion, 75(11–12), 60–65.https://doi.org/10.37544/0720-5953-2023-11-12-60 

Steffen, E., &; Wolf, I. H. (2023). Rotation r-graphs. Discrete Mathematics, Article 113457.https://doi.org/10.1016/j.disc.2023.113457 

Castenow, J., Kling, P., Knollmann, T., &; Meyer auf der Heide, F. (2022). A Discrete and Continuous Study of the Max-Chain-Formation Problem. Information and Computation, Article 104877.https://doi.org/10.1016/j.ic.2022.104877 

Gharibian, S., Santha, M., Sikora, J., Sundaram, A., &; Yirka, J. (2022). Quantum generalizations of the polynomial hierarchy with applications to QMA(2). Computational Complexity, 31(2), Article 13.https://doi.org/10.1007/s00037-022-00231-8 

Steffen, E., &; Wolf, I. H. (2022). Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices. Graphs and Combinatorics, 38(3), Article 104.https://doi.org/10.1007/s00373-022-02506-x 

Kontinen, J., Meier, A., &; Mahmood, Y. (2022). A parameterized view on the complexity of dependence and independence logic. Journal of Logic and Computation, 32(8), 1624–1644.https://doi.org/10.1093/logcom/exac070 

Schade, R., Kenter, T., Elgabarty, H., Lass, M., Schütt, O., Lazzaro, A., Pabst, H., Mohr, S., Hutter, J., Kühne, T., &; Plessl, C. (2022). Towards electronic structure-based ab-initio molecular dynamics simulations with hundreds of millions of atoms. Parallel Computing, 111, Article 102920.https://doi.org/10.1016/j.parco.2022.102920 

Rodriguez, A., Otero, A., Platzner, M., &; De la Torre, E. (2021). Exploiting Hardware-Based Data-Parallel and Multithreading Models for Smart Edge Computing in Reconfigurable FPGAs. IEEE Transactions on Computers, 1–1.https://doi.org/10.1109/tc.2021.3107196 

Li, J., Ma, Y., Miao, Z., Shi, Y., Wang, W., &; Zhang, C.-Q. (2021). Nowhere-zero 3-flows in toroidal graphs. Journal of Combinatorial Theory, Series B, 153, 61–80.https://doi.org/10.1016/j.jctb.2021.11.001 

Stieglitz, S., Mirbabaie, M., Möllmann, N. R. J., &; Rzyski, J. (2021). Collaborating with Virtual Assistants in Organizations: Analyzing Social Loafing Tendencies and Responsibility Attribution. Information Systems Frontiers, 24(3), 745–770.https://doi.org/10.1007/s10796-021-10201-0 

Winkler, M. (2021). $L^1$ solutions to parabolic Keller-Segel systems involving arbitrary superlinear degradation. ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE, 141–172.https://doi.org/10.2422/2036-2145.202005_016 

Mahmood, Y., Meier, A., &; Schmidt, J. (2020). Parameterized complexity of abduction in Schaefer’s framework. Journal of Logic and Computation, 31(1), 266–296.https://doi.org/10.1093/logcom/exaa079 

Alizadeh, B., Behnam, P., &; Sadeghi-Kohan, S. (2014). A Scalable Formal Debugging Approach with Auto-Correction Capability based on Static Slicing and Dynamic Ranking for RTL Datapath Designs. IEEE Transactions on Computers, 1–1.https://doi.org/10.1109/tc.2014.2329687