According to our database
1,
Raphael Steiner
authored at least 58 papers
between 2017 and 2025.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2025
Finding dense minors using average degree.
J. Graph Theory, January, 2025
Vertex-critical graphs far from edge-criticality.
Comb. Probab. Comput., 2025
Complexity of polytope diameters via perfect matchings.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
Tight bounds for divisible subdivisions.
J. Comb. Theory B, March, 2024
On the choosability of -minor-free graphs.
Comb. Probab. Comput., March, 2024
Subdivisions with congruence constraints in digraphs of large chromatic number.
J. Graph Theory, January, 2024
Subdigraphs of prescribed size and out-degree.
J. Graph Theory, January, 2024
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs.
J. Comb. Theory B, January, 2024
Chromatic number is not tournament-local.
J. Comb. Theory B, 2024
Hadwiger's conjecture and topological bounds.
Eur. J. Comb., 2024
Coloring hypergraphs with excluded minors.
Eur. J. Comb., 2024
Coloring circle arrangements: New 4-chromatic planar graphs.
Eur. J. Comb., 2024
Longest cycles in vertex-transitive and highly connected graphs.
CoRR, 2024
Hardness of circuit and monotone diameters of polytopes.
CoRR, 2024
On an Induced Version of Menger's Theorem.
Electron. J. Comb., 2024
2023
Topological Drawings Meet Classical Theorems from Convex Geometry.
Discret. Comput. Geom., October, 2023
Hat Guessing Numbers of Strongly Degenerate Graphs.
SIAM J. Discret. Math., June, 2023
On coloring digraphs with forbidden induced subgraphs.
J. Graph Theory, June, 2023
Improved bound for improper colourings of graphs with no odd clique minor.
Comb. Probab. Comput., March, 2023
Cycle lengths modulo k in expanders.
Eur. J. Comb., 2023
Odd Hadwiger for line-graphs.
Discret. Math., 2023
Matching theory and Barnette's conjecture.
Discret. Math., 2023
Twin-width of sparse random graphs.
CoRR, 2023
Shortest paths on polymatroids and hypergraphic polytopes.
CoRR, 2023
Exact Matching: Correct Parity and FPT Parameterized by Independence Number.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023
Inapproximability of Shortest Paths on Perfect Matching Polytopes.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023
A Logarithmic Bound for Simultaneous Embeddings of Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023
Linear Size Universal Point Sets for Classes of Planar Graphs.
Proceedings of the 39th International Symposium on Computational Geometry, 2023
On Connectivity in Random Graph Models with Limited Dependencies.
Proceedings of the Approximation, 2023
2022
Oriented Cycles in Digraphs of Large Outdegree.
Comb., December, 2022
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree.
SIAM J. Discret. Math., 2022
Heroes in Orientations of Chordal Graphs.
SIAM J. Discret. Math., 2022
Complete directed minors and chromatic number.
J. Graph Theory, 2022
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant.
J. Comb. Theory B, 2022
Dichromatic number and forced subdivisions.
J. Comb. Theory B, 2022
The star dichromatic number.
Discuss. Math. Graph Theory, 2022
Colorings of oriented planar graphs avoiding a monochromatic subgraph.
Discret. Appl. Math., 2022
Improved lower bound for the list chromatic number of graphs with no Kt minor.
Comb. Probab. Comput., 2022
Even circuits in oriented matroids.
Comb. Theory, 2022
Disproof of a Conjecture by Woodall on the Choosability of $K_{s, t}$-Minor-Free Graphs.
Electron. J. Comb., 2022
Colouring Non-Even Digraphs.
Electron. J. Comb., 2022
Coloring Drawings of Graphs.
Electron. J. Comb., 2022
Exact Matching in Graphs of Bounded Independence Number.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022
Edge Partitions of Complete Geometric Graphs.
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Zero sum cycles in complete digraphs.
Eur. J. Comb., 2021
Edge Partitions of Complete Geometric Graphs (Part 2).
CoRR, 2021
Majority Colorings of Sparse Digraphs.
Electron. J. Comb., 2021
Flip Distances Between Graph Orientations.
Algorithmica, 2021
2020
On the Average Complexity of the k-Level.
J. Comput. Geom., 2020
A Note on Universal Point Sets for Planar Graphs.
J. Graph Algorithms Appl., 2020
A Note on Graphs of Dichromatic Number 2.
Discret. Math. Theor. Comput. Sci., 2020
On the Complexity of Digraph Colourings and Vertex Arboricity.
Discret. Math. Theor. Comput. Sci., 2020
A note on coloring digraphs of large girth.
Discret. Appl. Math., 2020
Complete Acyclic Colorings.
Electron. J. Comb., 2020
Parameterized Algorithms for Directed Modular Width.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020
2019
Parametrised Algorithms for Directed Modular Width.
CoRR, 2019
2018
Equiangular Polygon Contact Representations.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018
2017
Pentagon Contact Representations.
Electron. Notes Discret. Math., 2017
