Address:
Technische Universität Berlin
Institut für Mathematik
Sekretariat MA 5-1
Strasse des 17. Juni 136
D-10623 Berlin, Germany
Office:
MA 509
Phone:
+49 (0)30 314 28 553
Ad Personam
I am a PhD student at Technische Universität Berlin in the Workgroup Diskrete Mathematik of Stefan Felsner, where I started in September 2018. I am a member of the DFG-Research Training Group Facets of Complexity. I am currently doing an internship at Tibor Szabó's Combinatorics and Graph Theory group at Freie Universität Berlin. Besides thinking about math problems I love to play chess and quoridor. My Erdős-number is 2.
T. Mészáros and R. Steiner.
Complete minors in digraphs with given dichromatic number, 2021.
[arXiv:2101.04590]
R. Steiner.
Disjoint cycles with length constraints in digraphs of large connectivity or minimum degree, 2020.
[arXiv:2011.11605] (submitted).
K. Heuer, R. Steiner and S. Wiederrecht.
Even circuits in oriented matroids, 2020.
[arXiv:2010.08988] (submitted).
L. Gishboliner, R. Steiner and T. Szabó.
Oriented cycles in digraphs of large outdegree, 2020.
[arXiv:2008.13224] (submitted).
L. Gishboliner, R. Steiner and T. Szabó.
Dichromatic number and forced subdivisions, 2020.
[arXiv:2008.09888] (submitted).
R. Steiner.
A note on coloring digraphs of large girth, Discrete Applied Mathematics, 287, pp. 62-64, 2020. [doi][arXiv:2004.01925].
C. Hertrich, Schröder and R. Steiner.
Coloring Drawings of Graphs, 2020.
[arXiv:2008.09692] (submitted).
H. Bergold, S. Felsner, M. Scheucher, F. Schröder and R. Steiner.
Topological Drawings meet Classical Theorems from Convex Geometry, 2019.
[arXiv:2005.12568] To appear in Proceedings GD 2020, LNCS.
M.-K. Chiu, S. Felsner, M. Scheucher, P. Schnider, R. Steiner and P. Valtr.
On the Average Complexity of the k-Level.
Journal of Computational Geometry (JoCG), Volume 11, Issue 1, 2020, pp. 493-506.
M. Anastos, A. Lamaison, R. Steiner and T. Szabó.
Majority Colorings of Sparse Digraphs, 2019.
[arXiv:1911.01954] (submitted).
R. Steiner.
A Note on Graphs of Dichromatic Number 2, Discrete Mathematics and Theoretical Computer Science, vol. 22 no 4.
R. Steiner and S. Wiederrecht.
Parametrised Algorithms for Directed Modular Width, 2019.
[arXiv:1905.13203] In Proceedings CALDAM 2020, LNCS. [doi]
S. Felsner, W. Hochstättler, K. Knauer and R. Steiner.
Complete Acyclic Colorings.
Electronic Journal of Combinatorics, Volume 27, Issue 2, 2020.
[doi]
M. Millani, R. Steiner and S. Wiederrecht.
Colouring Non-Even Digraphs, 2019.
[arXiv:1903.02872] (submitted).
M. Millani, R. Steiner and S. Wiederrecht.
Colouring Non-Even Digraphs, 2019.
[extended abstract] Acta Mathematica Universitatis Comenianae, 88(3), 941-945. (Extended Abstract at Eurocomb 2019).
M. Scheucher, H. Schrezenmaier and R. Steiner.
A Note On Universal Point Sets for Planar Graphs, Journal of Graph Algorithms and Applications, 24(3), 247--267, [doi]
M. Scheucher, H. Schrezenmaier and R. Steiner.
A Note On Universal Point Sets for Planar Graphs, 2018.
[arXiv: 1811.06482]. [Extended Abstract] at EuroCG 2019, In Proceedings GraphDrawing 2019, LNCS.
O. Aichholzer, J. Cardinal, T. Huynh, K. Knauer, T. Mütze, R. Steiner and B. Vogtenhuber.
Flip Distances Between Graph Orientations, Algorithmica, 2020. [doi]
O. Aichholzer, J. Cardinal, T. Huynh, K. Knauer, T. Mütze, R. Steiner and B. Vogtenhuber.
Flip Distances Between Graph Orientations, 2018.
[arXiv:1902.06103] In Proceedings WG 2019, LNCS. [doi]
W. Hochstättler, F. Schröder and R. Steiner.
On the Complexity of Digraph Colourings and Vertex Arboricity, Discrete Mathematics and Theoretical Computer Science, vol. 22 no. 1 (2019).
[doi].
W. Hochstättler and R. Steiner.
The Star Dichromatic Number, 2018.
[arXiv: 1809.00142] to appear in Discussiones Mathematicae Graph Theory [doi]
R. Steiner.
Neumann-Lara-Flows and the Two-Colour-Conjecture.
Master's thesis,
Faculty of Mathematics and Computer Science,
FernUniversität in Hagen, Germany, 2018.
[pdf]
S. Felsner, H. Schrezenmaier, R. Steiner.
Equiangular Contact Representations.
In Graph Theoretic Concepts in Computer Science,
Proceedings of the 44th International Workshop WG 2018.
[pdf][doi]
S. Felsner, H. Schrezenmaier, R. Steiner.
Pentagon Contact Representations.
Electronic Journal of Combinatorics, Volume 25, Issue 3, 2018.
[doi]
S. Felsner, H. Schrezenmaier, R. Steiner.
Pentagon Contact Representations.
Extended Abstract in ENDM issue Eurocomb 2017.
[doi]
R. Steiner.
Existenz und Konstruktion von Dreieckszerlegungen triangulierter Graphen und Schnyder Woods.
Bachelor's thesis,
Faculty of Mathematics and Computer Science,
FernUniversität in Hagen, Germany, 2016.
[pdf]
EuroCG 2019, Utrecht, Netherlands: A Note On Universal Point Sets for Planar Graphs. [Conference Website]
WG (Workshop on Graph Theoretic Concepts in Computer Science) 2019, Val de Nuria, Catalonia, Spain: Flip Distances between Graph Orientations. [Conference Website]
GGTW (Ghent Graph Theory Workshop on Structure and Algorithms) 2019, Ghent, Belgium: Complete Acyclic Colourings. [Conference Website]