Minor Embedding in Broken Chimera and Pegasus Graphs is NP-complete. - Elisabeth Lobe; Annette Lutz (CoRR, 2021)

SIMD vectorization for simultaneous solution of locally varying linear systems with multiple right-hand sides. - Martin Joachim Kühn; Johannes Holke; Annette Lutz; Jonas Thies; Melven Röhrig-Zöllner; Alexander Bleh; Jan Backhaus; Achim Basermann (J. Supercomput., 2023)

Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem. - Yann Disser; Svenja M. Griesbach; Max Klimm; Annette Lutz (ESA, 2024)

Minor embedding in broken chimera and derived graphs is NP-complete. - Elisabeth Lobe; Annette Lutz (Theor. Comput. Sci., 2024)

Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows. - Yann Disser; Max Klimm; Annette Lutz; David Weckbecker (SIAM J. Discret. Math., 2024)

Valid Cuts for the Design of Potential-Based Flow Networks. - Pascal Börner; Max Klimm; Annette Lutz; Marc E. Pfetsch; Martin Skutella; Lea Strubberg (IPCO, 2025)

Symmetry Classes of Hamiltonian Cycles. - Júlia Baligács; Sofia Brenner; Annette Lutz; Lena Volk (MFCS, 2025)

Incremental-Decremental Maximization. - Yann Disser; Max Klimm; Annette Lutz; Lea Strubberg (CoRR, 2025)