Online Strip Packing with Polynomial Migration. - Klaus Jansen; Kim-Manuel Klein; Maria Kosche; Leon Ladewig (APPROX-RANDOM, 2017)

The Edit Distance to k-Subsequence Universality. - Pamela Fleischmann; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (CoRR, 2020)

Robust Online Algorithms for Dynamic Choosing Problems. - Sebastian Berndt 001; Kilian Grage; Klaus Jansen; Lukas Johannsen; Maria Kosche (CiE, 2021)

Efficiently Testing Simon's Congruence. - Pawel Gawrychowski; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (STACS, 2021)

Subsequences with Gap Constraints: Complexity Bounds for Matching and Analysis Problems. - Joel D. Day; Maria Kosche; Florin Manea; Markus L. Schmid (ISAAC, 2022)

Subsequences in Bounded Ranges: Matching and Analysis Problems. - Maria Kosche; Tore Koß; Florin Manea; Viktoriya Pak (RP, 2022)

Combinatorial Algorithms for Subsequence Matching: A Survey. - Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (NCMA, 2022)

Absent Subsequences in Words. - Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (Fundam. Informaticae, 2022)

Longest Common Subsequence with Gap Constraints. - Duncan Adamson; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (WORDS, 2023)

On the Number of Factors in the LZ-End Factorization. - Pawel Gawrychowski; Maria Kosche; Florin Manea (SPIRE, 2023)

The edit distance to k-subsequence universality. - Joel D. Day; Pamela Fleischmann; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (J. Comput. Syst. Sci., 2025)

Longest Common Subsequence with Gap Constraints. - Duncan Adamson; Paul Sarnighausen-Cahn; Marius Dumitran; Maria Kosche; Tore Koß; Florin Manea; Stefan Siemer (Theory Comput. Syst., 2025)