On the Edge-Vertex Ratio of Maximal Thrackles. - Oswin Aichholzer; Linda Kleist; Boris Klemz; Felix Schröder; Birgit Vogtenhuber (GD, 2019)

Improved bounds for centered colorings. - Michal Debski; Stefan Felsner; Piotr Micek; Felix Schröder (SODA, 2020)

On the Complexity of Digraph Colourings and Vertex Arboricity. - Winfried Hochstättler; Felix Schröder; Raphael Steiner (Discret. Math. Theor. Comput. Sci., 2020)

Coloring Drawings of Graphs. - Christoph Hertrich; Felix Schröder; Raphael Steiner (Electron. J. Comb., 2022)

Linear Size Universal Point Sets for Classes of Planar Graphs. - Stefan Felsner; Hendrik Schrezenmaier; Felix Schröder; Raphael Steiner (SoCG, 2023)

Simplifying Non-Simple Fan-Planar Drawings. - Boris Klemz; Kristin Knorr; Meghana M. Reddy; Felix Schröder (J. Graph Algorithms Appl., 2023)

Topological Drawings Meet Classical Theorems from Convex Geometry. - Helena Bergold; Stefan Felsner; Manfred Scheucher; Felix Schröder; Raphael Steiner (Discret. Comput. Geom., 2023)

The Density Formula: One Lemma to Bound Them All. - Michael Kaufmann 001; Boris Klemz; Kristin Knorr; Meghana M. Reddy; Felix Schröder; Torsten Ueckerdt (GD, 2024)

Holes in Convex and Simple Drawings. - Helena Bergold; Joachim Orthaber; Manfred Scheucher; Felix Schröder (GD, 2024)

Finding hardness reductions automatically using SAT solvers. - Helena Bergold; Manfred Scheucher; Felix Schröder (CoRR, 2024)

Coloring circle arrangements: New 4-chromatic planar graphs. - Man-Kwun Chiu; Stefan Felsner; Manfred Scheucher; Felix Schröder; Raphael Steiner; Birgit Vogtenhuber (Eur. J. Comb., 2024)

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. - Marcin Brianski; Martin Koutecký; Daniel Král'; Kristýna Pekárková; Felix Schröder (Math. Program., 2024)

On Triangular Separation of Bichromatic Point Sets. - Helena Bergold; Arun Kumar Das 001; Robert Lauff; Manfred Scheucher; Felix Schröder; Marie Diana Sieper (CoRR, 2025)