Coloring circle arrangements: New 4-chromatic planar graphs
M.-K. Chiu, S. Felsner, M. Scheucher, F. Schröder, R. Steiner and B. Vogtenhuber
European Journal of Combinatorics, 2023
Hat guessing numbers of strongly degenerate graphs
C. Knierim, A. Martinsson and R. Steiner.
SIAM Journal on Discrete Mathematics
Subdivisions with congruence constraints in digraphs of large chromatic number
R. Steiner.
Journal of Graph Theory
Subdigraphs of prescribed size and outdegree
R. Steiner.
Journal of Graph Theory
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs
A. Martinsson and R. Steiner.
Journal of Combinatorial Theory, Series B
On the choosability of H-minor-free graphs
O. Fischer and R. Steiner.
Combinatorics, Probability and Computing
Inapproximability of shortest paths on perfect matching polytopes
J. Cardinal and R. Steiner.
Mathematical Programming
Tight bounds for divisible subdivisions
S. Das, N. Draganić and R. Steiner.
Journal of Combinatorial Theory, Series B
Online learning of long-range dependencies
N. Zucchet*, R. Meier*, S. Schug*, A. Mujika and J. Sacramento
NeurIPS 2023
Exact matching: Correct parity and FPT parameterized by independence number
N. El Maalouly, R. Steiner and L. Wulf
34th International Symposium on Algorithms and Computation (ISAAC)
A logarithmic bound for simultaneous embeddings of planar graphs
R. Steiner
31st International Symposium on Graph Drawing and Network Visualization (GD)
On connectivity in random graph models with limited dependencies
J. Lengler, A. Martinsson, K. Petrova, P. Schnider, R. Steiner, S. Weber and E. Welzl
International Conference on Randomization and Computation 2023 (RANDOM)
Linear-size universal point sets for classes of planar graphs
S. Felsner, H. Schrezenmaier, F. Schröder and R. Steiner
39th Symposium on Computational Geometry (SoCG)
Inapproximability of shortest paths on perfect matching polytopes
J. Cardinal and R. Steiner
24th Conference on Integer Programming and Combinatorial Optimization (IPCO)
A Simple Optimal Algorithm for the 2-Arm Bandit Problem
M. Larcher, R. Meier and A. Steger
2023 Symposium on Simplicity in Algorithms (SOSA)
