Raphael Steiner

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 72

Top Topics

Engineering Drawings

Monotone Dnf Formulas

Top Venues

Electron. J. Comb.

J. Graph Theory

Publications

Raphael Steiner
Hadwiger's conjecture and topological bounds. Eur. J. Comb. 122 (2024)
Anders Martinsson, Raphael Steiner
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs. J. Comb. Theory, Ser. B 164 (2024)
Raphael Steiner
Subdigraphs of prescribed size and out-degree. J. Graph Theory 105 (1) (2024)
Olivier Fischer, Raphael Steiner
On the choosability of -minor-free graphs. Comb. Probab. Comput. 33 (2) (2024)
António Girão, Kevin Hendrey, Freddie Illingworth, Florian Lehner, Lukas Michel, Michael Savery, Raphael Steiner
Chromatic number is not tournament-local. J. Comb. Theory B 168 (2024)
Raphael Steiner
Subdivisions with congruence constraints in digraphs of large chromatic number. J. Graph Theory 105 (1) (2024)
Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner, Birgit Vogtenhuber
Coloring circle arrangements: New 4-chromatic planar graphs. Eur. J. Comb. 121 (2024)
Raphael Steiner
Coloring hypergraphs with excluded minors. Eur. J. Comb. 120 (2024)
Christian Nöbel, Raphael Steiner
Hardness of circuit and monotone diameters of polytopes. CoRR (2024)
Shagnik Das, Nemanja Draganic, Raphael Steiner
Tight bounds for divisible subdivisions. J. Comb. Theory, Ser. B 165 (2024)
Nicolas El Maalouly, Raphael Steiner, Lasse Wulf
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. ISAAC (2023)
Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner
Topological Drawings Meet Classical Theorems from Convex Geometry. Discret. Comput. Geom. 70 (3) (2023)
Raphael Steiner
Improved bound for improper colourings of graphs with no odd clique minor. Comb. Probab. Comput. 32 (2) (2023)
Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder, Raphael Steiner
Linear Size Universal Point Sets for Classes of Planar Graphs. SoCG (2023)
Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte
Twin-width of sparse random graphs. CoRR (2023)
Maximilian Gorsky, Raphael Steiner, Sebastian Wiederrecht
Matching theory and Barnette's conjecture. Discret. Math. 346 (2) (2023)
Raphael Steiner
Odd Hadwiger for line-graphs. Discret. Math. 346 (1) (2023)
Jean Cardinal, Raphael Steiner
Shortest paths on polymatroids and hypergraphic polytopes. CoRR (2023)
Jean Cardinal, Raphael Steiner
Inapproximability of Shortest Paths on Perfect Matching Polytopes. IPCO (2023)
Anders Martinsson, Raphael Steiner
Cycle lengths modulo k in expanders. Eur. J. Comb. 109 (2023)
Raphael Steiner
On coloring digraphs with forbidden induced subgraphs. J. Graph Theory 103 (2) (2023)
Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder, Raphael Steiner
Linear Size Universal Point Sets for Classes of Planar Graphs. CoRR (2023)
Raphael Steiner
A Logarithmic Bound for Simultaneous Embeddings of Planar Graphs. GD (2) (2023)
Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl
On Connectivity in Random Graph Models with Limited Dependencies. APPROX/RANDOM (2023)
Charlotte Knierim, Anders Martinsson, Raphael Steiner
Hat Guessing Numbers of Strongly Degenerate Graphs. SIAM J. Discret. Math. 37 (2) (2023)
Raphael Steiner
Disproof of a Conjecture by Woodall on the Choosability of $K_{s, t}$-Minor-Free Graphs. Electron. J. Comb. 29 (3) (2022)
Raphael Steiner
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree. SIAM J. Discret. Math. 36 (2) (2022)
Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, Birgit Vogtenhuber
Edge Partitions of Complete Geometric Graphs. SoCG (2022)
Lior Gishboliner, Raphael Steiner, Tibor Szabó
Oriented Cycles in Digraphs of Large Outdegree. Comb. 42 (6) (2022)
Pierre Aboulker, Guillaume Aubian, Raphael Steiner
Heroes in Orientations of Chordal Graphs. SIAM J. Discret. Math. 36 (4) (2022)
Pierre Aboulker, Guillaume Aubian, Raphael Steiner
Heroes in orientations of chordal graphs. CoRR (2022)
Lior Gishboliner, Raphael Steiner, Tibor Szabó
Dichromatic number and forced subdivisions. J. Comb. Theory, Ser. B 153 (2022)
Christoph Hertrich, Felix Schröder, Raphael Steiner
Coloring Drawings of Graphs. Electron. J. Comb. 29 (1) (2022)
Nicolas El Maalouly, Raphael Steiner
Exact Matching in Graphs of Bounded Independence Number. CoRR (2022)
Nicolas El Maalouly, Raphael Steiner, Lasse Wulf
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. CoRR (2022)
Nicolas El Maalouly, Raphael Steiner
Exact Matching in Graphs of Bounded Independence Number. MFCS (2022)
Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht
Colouring Non-Even Digraphs. Electron. J. Comb. 29 (4) (2022)
Helena Bergold, Winfried Hochstättler, Raphael Steiner
Colorings of oriented planar graphs avoiding a monochromatic subgraph. Discret. Appl. Math. 320 (2022)
Winfried Hochstättler, Raphael Steiner
The star dichromatic number. Discuss. Math. Graph Theory 42 (1) (2022)
Raphael Steiner
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant. J. Comb. Theory, Ser. B 155 (2022)
Maximilian Gorsky, Raphael Steiner, Sebastian Wiederrecht
Matching Theory and Barnette's Conjecture. CoRR (2022)
Jean Cardinal, Raphael Steiner
Inapproximability of shortest paths on perfect matching polytopes. CoRR (2022)
Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner, Birgit Vogtenhuber
Coloring circle arrangements: New 4-chromatic planar graphs. CoRR (2022)
Raphael Steiner
Improved lower bound for the list chromatic number of graphs with no Kt minor. Comb. Probab. Comput. 31 (6) (2022)
Tamás Mészáros, Raphael Steiner
Complete directed minors and chromatic number. J. Graph Theory 101 (4) (2022)
Michael Anastos, Ander Lamaison, Raphael Steiner, Tibor Szabó
Majority Colorings of Sparse Digraphs. Electron. J. Comb. 28 (2) (2021)
Tamás Mészáros, Raphael Steiner
Zero sum cycles in complete digraphs. Eur. J. Comb. 98 (2021)
Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, Birgit Vogtenhuber
Edge Partitions of Complete Geometric Graphs (Part 2). CoRR (2021)
Raphael Steiner
Asymptotic Equivalence of Hadwiger's Conjecture and its Odd Minor-Variant. CoRR (2021)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip Distances Between Graph Orientations. Algorithmica 83 (1) (2021)
Raphael Steiner, Sebastian Wiederrecht
Parameterized Algorithms for Directed Modular Width. CALDAM (2020)
Stefan Felsner, Winfried Hochstättler, Kolja Knauer, Raphael Steiner
Complete Acyclic Colorings. Electron. J. Comb. 27 (2) (2020)
Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner
Topological Drawings meet Classical Theorems from Convex Geometry. CoRR (2020)
Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner
A Note on Universal Point Sets for Planar Graphs. J. Graph Algorithms Appl. 24 (3) (2020)
Christoph Hertrich, Felix Schröder, Raphael Steiner
Coloring Drawings of Graphs. CoRR (2020)
Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner
Topological Drawings Meet Classical Theorems from Convex Geometry. Graph Drawing (2020)
Raphael Steiner
A note on coloring digraphs of large girth. Discret. Appl. Math. 287 (2020)
Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner
Pentagon contact representations. CoRR (2020)
Raphael Steiner, Manfred Scheucher, Stefan Felsner, Pavel Valtr, Man-Kwun Chiu, Patrick Schnider
On the Average Complexity of the k-Level. J. Comput. Geom. 11 (1) (2020)
Karl Heuer, Raphael Steiner, Sebastian Wiederrecht
Even Circuits in Oriented Matroids. CoRR (2020)
Winfried Hochstättler, Felix Schröder, Raphael Steiner
On the Complexity of Digraph Colourings and Vertex Arboricity. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
Raphael Steiner
A Note on Graphs of Dichromatic Number 2. Discret. Math. Theor. Comput. Sci. 22 (4) (2020)
Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Patrick Schnider, Raphael Steiner, Pavel Valtr
On the Average Complexity of the k-Level. CoRR (2019)
Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner
A Note on Universal Point Sets for Planar Graphs. Graph Drawing (2019)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip distances between graph orientations. CoRR (2019)
Raphael Steiner, Sebastian Wiederrecht
Parametrised Algorithms for Directed Modular Width. CoRR (2019)
Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht
Colouring Non-Even Digraphs. CoRR (2019)
Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber
Flip Distances Between Graph Orientations. WG (2019)
Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner
Equiangular Polygon Contact Representations. WG (2018)
Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner
A Note On Universal Point Sets for Planar Graphs. CoRR (2018)
Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner
Pentagon Contact Representations. Electron. J. Comb. 25 (3) (2018)
Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner
Pentagon Contact Representations. Electron. Notes Discret. Math. 61 (2017)