Pentagon Contact Representations. - Stefan Felsner; Hendrik Schrezenmaier; Raphael Steiner (Electron. Notes Discret. Math., 2017)

Equiangular Polygon Contact Representations. - Stefan Felsner; Hendrik Schrezenmaier; Raphael Steiner (WG, 2018)

Parametrised Algorithms for Directed Modular Width. - Raphael Steiner; Sebastian Wiederrecht (CoRR, 2019)

Parameterized Algorithms for Directed Modular Width. - Raphael Steiner; Sebastian Wiederrecht (CALDAM, 2020)

Complete Acyclic Colorings. - Stefan Felsner; Winfried Hochstättler; Kolja Knauer; Raphael Steiner (Electron. J. Comb., 2020)

A note on coloring digraphs of large girth. - Raphael Steiner (Discret. Appl. Math., 2020)

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

A Note on Graphs of Dichromatic Number 2. - Raphael Steiner (Discret. Math. Theor. Comput. Sci., 2020)

A Note on Universal Point Sets for Planar Graphs. - Manfred Scheucher; Hendrik Schrezenmaier; Raphael Steiner (J. Graph Algorithms Appl., 2020)

On the Average Complexity of the k-Level. - Raphael Steiner; Manfred Scheucher; Stefan Felsner; Pavel Valtr 001; Man-Kwun Chiu; Patrick Schnider (J. Comput. Geom., 2020)

Flip Distances Between Graph Orientations. - Oswin Aichholzer; Jean Cardinal; Tony Huynh; Kolja Knauer; Torsten Mütze; Raphael Steiner; Birgit Vogtenhuber (Algorithmica, 2021)

Majority Colorings of Sparse Digraphs. - Michael Anastos; Ander Lamaison; Raphael Steiner; Tibor Szabó (Electron. J. Comb., 2021)

Edge Partitions of Complete Geometric Graphs (Part 2). - Oswin Aichholzer; Johannes Obenaus; Joachim Orthaber; Rosna Paul; Patrick Schnider; Raphael Steiner; Tim Taubner; Birgit Vogtenhuber (CoRR, 2021)

Zero sum cycles in complete digraphs. - Tamás Mészáros 001; Raphael Steiner (Eur. J. Comb., 2021)

Edge Partitions of Complete Geometric Graphs. - Oswin Aichholzer; Johannes Obenaus; Joachim Orthaber; Rosna Paul; Patrick Schnider; Raphael Steiner; Tim Taubner; Birgit Vogtenhuber (SoCG, 2022)

Exact Matching in Graphs of Bounded Independence Number. - Nicolas El Maalouly; Raphael Steiner (MFCS, 2022)

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

Colouring Non-Even Digraphs. - Marcelo Garlet Millani; Raphael Steiner; Sebastian Wiederrecht (Electron. J. Comb., 2022)

Disproof of a Conjecture by Woodall on the Choosability of $K_{s, t}$-Minor-Free Graphs. - Raphael Steiner (Electron. J. Comb., 2022)

Even circuits in oriented matroids. - Karl Heuer; Raphael Steiner; Sebastian Wiederrecht (Comb. Theory, 2022)

Improved lower bound for the list chromatic number of graphs with no Kt minor. - Raphael Steiner (Comb. Probab. Comput., 2022)

Colorings of oriented planar graphs avoiding a monochromatic subgraph. - Helena Bergold; Winfried Hochstättler; Raphael Steiner (Discret. Appl. Math., 2022)

The star dichromatic number. - Winfried Hochstättler; Raphael Steiner (Discuss. Math. Graph Theory, 2022)

Dichromatic number and forced subdivisions. - Lior Gishboliner; Raphael Steiner; Tibor Szabó (J. Comb. Theory B, 2022)

Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant. - Raphael Steiner (J. Comb. Theory B, 2022)

Complete directed minors and chromatic number. - Tamás Mészáros 001; Raphael Steiner (J. Graph Theory, 2022)

Heroes in Orientations of Chordal Graphs. - Pierre Aboulker; Guillaume Aubian; Raphael Steiner (SIAM J. Discret. Math., 2022)

Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree. - Raphael Steiner (SIAM J. Discret. Math., 2022)

Oriented Cycles in Digraphs of Large Outdegree. - Lior Gishboliner; Raphael Steiner; Tibor Szabó (Comb., 2022)

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

A Logarithmic Bound for Simultaneous Embeddings of Planar Graphs. - Raphael Steiner (GD (2), 2023)

Exact Matching: Correct Parity and FPT Parameterized by Independence Number. - Nicolas El Maalouly; Raphael Steiner; Lasse Wulf (ISAAC, 2023)

Shortest paths on polymatroids and hypergraphic polytopes. - Jean Cardinal; Raphael Steiner (CoRR, 2023)

Matching theory and Barnette's conjecture. - Maximilian Gorsky; Raphael Steiner; Sebastian Wiederrecht (Discret. Math., 2023)

Odd Hadwiger for line-graphs. - Raphael Steiner (Discret. Math., 2023)

Cycle lengths modulo k in expanders. - Anders Martinsson; Raphael Steiner (Eur. J. Comb., 2023)

Improved bound for improper colourings of graphs with no odd clique minor. - Raphael Steiner (Comb. Probab. Comput., 2023)

On coloring digraphs with forbidden induced subgraphs. - Raphael Steiner (J. Graph Theory, 2023)

Hat Guessing Numbers of Strongly Degenerate Graphs. - Charlotte Knierim; Anders Martinsson; Raphael Steiner (SIAM J. Discret. Math., 2023)

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

On an Induced Version of Menger's Theorem. - Kevin Hendrey; Sergey Norin; Raphael Steiner; Jérémie Turcotte (Electron. J. Comb., 2024)

Hardness of circuit and monotone diameters of polytopes. - Christian Nöbel; Raphael Steiner (CoRR, 2024)

Longest cycles in vertex-transitive and highly connected graphs. - Carla Groenland; Sean Longbrake; Raphael Steiner; Jérémie Turcotte; Liana Yepremyan (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)

Coloring hypergraphs with excluded minors. - Raphael Steiner (Eur. J. Comb., 2024)

Hadwiger's conjecture and topological bounds. - Raphael Steiner (Eur. J. Comb., 2024)

Chromatic number is not tournament-local. - António Girão; Kevin Hendrey; Freddie Illingworth; Florian Lehner; Lukas Michel; Michael Savery; Raphael Steiner (J. Comb. Theory B, 2024)

On connectivity in random graph models with limited dependencies. - Johannes Lengler; Anders Martinsson; Kalina Petrova; Patrick Schnider; Raphael Steiner; Simon Weber 001; Emo Welzl (Random Struct. Algorithms, 2024)

Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs. - Anders Martinsson; Raphael Steiner (J. Comb. Theory B, 2024)

Subdigraphs of prescribed size and out-degree. - Raphael Steiner (J. Graph Theory, 2024)

Subdivisions with congruence constraints in digraphs of large chromatic number. - Raphael Steiner (J. Graph Theory, 2024)

On the choosability of -minor-free graphs. - Olivier Fischer; Raphael Steiner (Comb. Probab. Comput., 2024)

Tight bounds for divisible subdivisions. - Shagnik Das; Nemanja Draganic; Raphael Steiner (J. Comb. Theory B, 2024)

Geometric Realizations of Dichotomous Ordinal Graphs. - Patrizio Angelini; Sabine Cornelsen; Carolina Haase; Michael Hoffmann 001; Eleni Katsanou; Fabrizio Montecchiani; Raphael Steiner; Antonios Symvonis (SoCG, 2025)

Efficient Parallel Scheduling for Sparse Triangular Solvers. - Toni Böhnlein; Pál András Papp; Raphael S. Steiner; Albert-Jan Nicholas Yzelman (IPDPS (Workshops), 2025)

Complexity of polytope diameters via perfect matchings. - Christian Nöbel; Raphael Steiner (SODA, 2025)

A note on digraph splitting. - Micha Christoph; Kalina Petrova; Raphael Steiner (Comb. Probab. Comput., 2025)

Twin-width of sparse random graphs. - Kevin Hendrey; Sergey Norin; Raphael Steiner; Jérémie Turcotte (Comb. Probab. Comput., 2025)

Vertex-critical graphs far from edge-criticality. - Anders Martinsson; Raphael Steiner (Comb. Probab. Comput., 2025)

Optimal bounds for zero-sum cycles. I. Odd order. - Rutger Campbell; J. Pascal Gollin; Kevin Hendrey; Raphael Steiner (J. Comb. Theory B, 2025)

Finding dense minors using average degree. - Kevin Hendrey; Sergey Norin; Raphael Steiner; Jérémie Turcotte (J. Graph Theory, 2025)

Inapproximability of shortest paths on perfect matching polytopes. - Jean Cardinal; Raphael Steiner (Math. Program., 2025)

Optimal tables for asymmetric numeral systems. - Raphael S. Steiner; Mirko De Vita; Endri Bezati (CoRR, 2025)

Fractional Chromatic Number Vs. Hall Ratio. - Raphael Steiner (Comb., 2025)