Publications

Journal articles

Solving Static Permutation Mastermind using O(n log n) Queries
M. Larcher, A. Martinsson, A. Steger
Electronic Journal of Combinatorics

Covering cycles in sparse graphs
F. Mousset, N. Škorić, M. Trujić
to appear in Random Structures & Algorithms

Triangle resilience of the square of a Hamilton cycle in random graphs
M. Fischer, N. Škorić, A. Steger, M. Trujić
to appear in Journal of Combinatorial Theory, Series B

Coloring drawings of graphs
C. Hertrich, F. Schröder, R. Steiner
Electronic Journal of Combinatorics, 29(1), P1.17

Dichromatic number and forced subdivisions
L. Gishboliner, R. Steiner, T. Szabó
Journal of Combinatorial Theory, Series B, 153, 1-30

Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
R. Steiner
Journal of Combinatorial Theory, Series B, 155, 45-51

Even circuits in oriented matroids
K. Heuer, R. Steiner, S. Wiederrecht
Combinatorial Theory, 2(1), #3

Improved lower bound for the list chromatic number of graphs with no K_t-minor
R. Steiner
Combinatorics, Probability and Computing

Oriented cycles in digraphs of large outdegree
L. Gishboliner, R. Steiner, T. Szabó
Combinatorica

Disjoint cycles with length constraints in digraphs of large connectivity or minimum degree
R. Steiner
SIAM Journal on Discrete Mathematics, 36(2), 1343-1362

Complete directed minors and chromatic number
T. Mészáros, R. Steiner
Journal of Graph Theory

Topological drawings meet classical theorems from convex geometry
H. Bergold, S. Felsner, M. Scheucher, F. Schröder, R. Steiner
to appear in Discrete & Computational Geometry

Disproof of a Conjecture by Woodall
R. Steiner
Electronic Journal of Combinatorics, 29(3), P3.2

Book Chapters

Conference proceedings

Edge partitions of complete geometric graphs
O. Aichholzer, J. Obenaus, J. Orthaber, R. Paul, P. Schnider, R. Steiner, T. Taubner, B. Vogtenhuber
Symposium on Computational Geometry (SoCG 2022)

Exact matching in graphs of bounded independence number
N. El Maalouly, R. Steiner.
Symposium on Mathematical Foundations of Computer Science (MFCS 2022)