Institut für Mathematik
Algorithmische und Diskrete Mathematik
Diskrete Mathematik
Raphael Steiner
Contact
Email: lastname[at]domain, math.tu-berlin.de = domain
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 research group Diskrete Mathematik of Stefan Felsner, where I started in September 2018. I am a member of the DFG-Research Training Group Facets of Complexity. Starting from September 2021, I will be an ETH Postdoctoral Fellow working in Angelika Steger's Combinatorial Structures and Algorithms group at ETH Zürich. Besides thinking about math problems I love to sing, play chess and play quoridor. My Erdős-number is 2 (via Pavel Valtr).
List of Publications and Preprints
- M. Gorsky, R. Steiner and S. Wiederrecht. Strongly Pfaffian graphs, 2021. [pdf] Extended abstract, to appear in Proceedings of EuroComb 2021.
- M.-K. Chiu, S. Felsner, M. Scheucher, F. Schröder, R. Steiner and B. Vogtenhuber. Coloring circle arrangements: New 4-chromatic planar graphs, 2021. [pdf] Extended abstract, presented at EuroCG 2021 and to appear in Proceedings of EuroComb 2021.
- T. Mészáros and R. Steiner. Zero sum cycles in complete digraphs, 2021. European Journal of Combinatorics, Volume 98, 103399, 2021. [doi]
- R. Steiner. On coloring digraphs with forbidden induced subgraphs, 2021. [arXiv:2103.04191] (submitted).
- T. Mészáros and R. Steiner. Complete minors in digraphs with given dichromatic number, 2021. [arXiv:2101.04590] (submitted).
- 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). Extended abstract presented at EuroCG 2021.
- H. Bergold, S. Felsner, M. Scheucher, F. Schröder and R. Steiner. Topological Drawings meet Classical Theorems from Convex Geometry, 2019. [arXiv:2005.12568] 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. Electronic Journal of Combinatorics, Volume 28, Issue 2, 2021. [doi]
- R. Steiner. A Note on Graphs of Dichromatic Number 2, Discrete Mathematics and Theoretical Computer Science, vol. 22 no 4. [doi]
- 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]
Conferences and Workshops
- Eurocomb 2017, Vienna, Austria: Pentagon Contact Representations. [Conference Website]
- Kolkom (Colloquium on Combinatorics) 2017, Paderborn, Germany: Neumann-Lara-Flows and the Two-Colour-Conjecture. [Conference Website]
- WG (Workshop on Graph Theoretic Concepts in Computer Science) 2018, Cottbus, Germany: Equiangular Contact Representations. [Conference Website]
- Workshop Cycles and Colourings 2018, Nový Smokovec, Slovakia: Circular Colourings of Digraphs. [Conference Website]
- Geometric Graphs Week 2018, Haus Tornow am See, Berlin, Germany. [Conference Website]
- Fall School Order and Geometry, Gutshof Sauen, Berlin, Germany. [Website]
- Workshop Order and Geometry 2018, Ciazén Palace, Poland. [Conference Website]
- Kolkom (Colloquium on Combinatorics) 2018, Paderborn, Germany: Metric Colourings of Graphs. [Conference Website]
- DACH-Workshop 2019, Graz, Austria. [Website]
- 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]
- DACH-Workshop 2019, Wergenstein, Switzerland. [Website]
- EUROCOMB 2019, Bratislava, Slovakia: Colouring Non-Even Digraphs [Website]
- Workshop Cycles and Colourings 2019, Novy Smokovec, High Tatras, Slovakia: Even Dicuts and Cut Minors [Website]
- Annual Workshop Facets of Complexity 2019, Doellnsee, Germany: Colouring Non-Even Digraphs.
- Annual Workshop 2019 of the Combinatorics and Graph Theory group at FU Berlin.
- Research Visit at the Department of Mathematics and Computer Science of Jagellionian University, Krakow. (December 2019)
- Problem-Solving-Workshop of the Research-Training group Facets of Complexity at Kloster Chorin. (December 2019)
- DACH-Workshop 2020, Malchow, Germany. [Website]
- Joint Tel-Aviv-FUB-Workshop on Ramsey Theory, Tel Aviv, Israel. (March 2020)
- Annual Workshop 2020 of the Combinatorics and Graph Theory group at FU Berlin, Wilhelmsaue. (August 2020)
- Workshop Order and Geometry 2020, Lutherstadt Wittenberg. (September 2020)
- Workshop Discrete Geometry, Oberwolfach. (September 2020)
- Jahrestagung 2020 des Graduiertenkollegs Facets of Complexity, Bad Belzig. (September 2020)
- Online-Talk at Matroid-Union, [YouTube]