Degree choosable signed graphs. - Thomas Schweser; Michael Stiebitz (Discret. Math., 2017)

Partitions of multigraphs under minimum degree constraints. - Thomas Schweser; Michael Stiebitz (Discret. Appl. Math., 2019)

DP-degree colorable hypergraphs. - Thomas Schweser (Theor. Comput. Sci., 2019)

Hajós and Ore Constructions for Digraphs. - Jørgen Bang-Jensen; Thomas Bellitto; Thomas Schweser; Michael Stiebitz (Electron. J. Comb., 2020)

On DP-coloring of digraphs. - Jørgen Bang-Jensen; Thomas Bellitto; Thomas Schweser; Michael Stiebitz (J. Graph Theory, 2020)

Generalized hypergraph coloring. - Thomas Schweser (Discuss. Math. Graph Theory, 2021)

Vertex partition of hypergraphs and maximum degenerate subhypergraphs. - Thomas Schweser; Michael Stiebitz (Electron. J. Graph Theory Appl., 2021)

Partitions of hypergraphs under variable degeneracy constraints. - Thomas Schweser; Michael Stiebitz (J. Graph Theory, 2021)

Point partition numbers: Decomposable and indecomposable critical graphs. - Justus von Postel; Thomas Schweser; Michael Stiebitz (Discret. Math., 2022)

Point Partition Numbers: Perfect Graphs. - Justus von Postel; Thomas Schweser; Michael Stiebitz (Graphs Comb., 2022)

Digraphs and Variable Degeneracy. - Jørgen Bang-Jensen; Thomas Schweser; Michael Stiebitz (SIAM J. Discret. Math., 2022)

Generalized DP-colorings of graphs. - Alexandr V. Kostochka; Thomas Schweser; Michael Stiebitz (Discret. Math., 2023)

Beyond the Data Warehouse: Modern and fast Data Analytics in Actian Vector. - Steffen Kläbe; Stefan Hagedorn; Francis Gropengießer; Thomas Schweser (BTW, 2025)