default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaphael Steiner
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j43]Anders Martinsson, Raphael Steiner
:
Vertex-critical graphs far from edge-criticality. Comb. Probab. Comput. 34(1): 151-157 (2025)- [j42]Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte:
Finding dense minors using average degree. J. Graph Theory 108(1): 205-223 (2025) - 2024
- [j41]Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte:
On an Induced Version of Menger's Theorem. Electron. J. Comb. 31(4) (2024) - [j40]Olivier Fischer, Raphael Steiner:
On the choosability of -minor-free graphs. Comb. Probab. Comput. 33(2): 129-142 (2024) - [j39]Raphael Steiner:
Coloring hypergraphs with excluded minors. Eur. J. Comb. 120: 103971 (2024) - [j38]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: 103839 (2024) - [j37]Raphael Steiner:
Hadwiger's conjecture and topological bounds. Eur. J. Comb. 122: 104033 (2024) - [j36]Anders Martinsson, Raphael Steiner:
Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs. J. Comb. Theory B 164: 1-16 (2024) - [j35]Shagnik Das, Nemanja Draganic, Raphael Steiner:
Tight bounds for divisible subdivisions. J. Comb. Theory B 165: 1-19 (2024) - [j34]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: 86-95 (2024) - [j33]Raphael Steiner:
Subdigraphs of prescribed size and out-degree. J. Graph Theory 105(1): 78-82 (2024) - [j32]Raphael Steiner:
Subdivisions with congruence constraints in digraphs of large chromatic number. J. Graph Theory 105(1): 136-143 (2024) - [i22]Christian Nöbel, Raphael Steiner:
Hardness of circuit and monotone diameters of polytopes. CoRR abs/2404.04158 (2024) - [i21]Carla Groenland, Sean Longbrake, Raphael Steiner, Jérémie Turcotte, Liana Yepremyan:
Longest cycles in vertex-transitive and highly connected graphs. CoRR abs/2408.04618 (2024) - 2023
- [j31]Raphael Steiner:
Improved bound for improper colourings of graphs with no odd clique minor. Comb. Probab. Comput. 32(2): 326-333 (2023) - [j30]Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings Meet Classical Theorems from Convex Geometry. Discret. Comput. Geom. 70(3): 1121-1143 (2023) - [j29]Raphael Steiner:
Odd Hadwiger for line-graphs. Discret. Math. 346(1): 113196 (2023) - [j28]Maximilian Gorsky, Raphael Steiner, Sebastian Wiederrecht:
Matching theory and Barnette's conjecture. Discret. Math. 346(2): 113249 (2023) - [j27]Anders Martinsson, Raphael Steiner:
Cycle lengths modulo k in expanders. Eur. J. Comb. 109: 103642 (2023) - [j26]Raphael Steiner:
On coloring digraphs with forbidden induced subgraphs. J. Graph Theory 103(2): 323-339 (2023) - [j25]Charlotte Knierim, Anders Martinsson, Raphael Steiner:
Hat Guessing Numbers of Strongly Degenerate Graphs. SIAM J. Discret. Math. 37(2): 1331-1347 (2023) - [c12]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: 30:1-30:22 - [c11]Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder, Raphael Steiner:
Linear Size Universal Point Sets for Classes of Planar Graphs. SoCG 2023: 31:1-31:16 - [c10]Raphael Steiner:
A Logarithmic Bound for Simultaneous Embeddings of Planar Graphs. GD (2) 2023: 133-140 - [c9]Jean Cardinal, Raphael Steiner:
Inapproximability of Shortest Paths on Perfect Matching Polytopes. IPCO 2023: 72-86 - [c8]Nicolas El Maalouly, Raphael Steiner, Lasse Wulf:
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. ISAAC 2023: 28:1-28:18 - [i20]Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder, Raphael Steiner:
Linear Size Universal Point Sets for Classes of Planar Graphs. CoRR abs/2303.00109 (2023) - [i19]Jean Cardinal, Raphael Steiner:
Shortest paths on polymatroids and hypergraphic polytopes. CoRR abs/2311.00779 (2023) - [i18]Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte:
Twin-width of sparse random graphs. CoRR abs/2312.03688 (2023) - 2022
- [j24]Lior Gishboliner, Raphael Steiner, Tibor Szabó:
Oriented Cycles in Digraphs of Large Outdegree. Comb. 42(6): 1145-1187 (2022) - [j23]Christoph Hertrich, Felix Schröder, Raphael Steiner:
Coloring Drawings of Graphs. Electron. J. Comb. 29(1) (2022) - [j22]Raphael Steiner:
Disproof of a Conjecture by Woodall on the Choosability of $K_{s, t}$-Minor-Free Graphs. Electron. J. Comb. 29(3) (2022) - [j21]Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht:
Colouring Non-Even Digraphs. Electron. J. Comb. 29(4) (2022) - [j20]Karl Heuer, Raphael Steiner, Sebastian Wiederrecht:
Even circuits in oriented matroids. Comb. Theory 2(1) (2022) - [j19]Raphael Steiner:
Improved lower bound for the list chromatic number of graphs with no Kt minor. Comb. Probab. Comput. 31(6): 1070-1075 (2022) - [j18]Helena Bergold, Winfried Hochstättler, Raphael Steiner:
Colorings of oriented planar graphs avoiding a monochromatic subgraph. Discret. Appl. Math. 320: 81-94 (2022) - [j17]Winfried Hochstättler, Raphael Steiner:
The star dichromatic number. Discuss. Math. Graph Theory 42(1): 277-298 (2022) - [j16]Lior Gishboliner, Raphael Steiner, Tibor Szabó:
Dichromatic number and forced subdivisions. J. Comb. Theory B 153: 1-30 (2022) - [j15]Raphael Steiner:
Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant. J. Comb. Theory B 155: 45-51 (2022) - [j14]Tamás Mészáros, Raphael Steiner:
Complete directed minors and chromatic number. J. Graph Theory 101(4): 623-632 (2022) - [j13]Raphael Steiner:
Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree. SIAM J. Discret. Math. 36(2): 1343-1362 (2022) - [j12]Pierre Aboulker, Guillaume Aubian, Raphael Steiner:
Heroes in Orientations of Chordal Graphs. SIAM J. Discret. Math. 36(4): 2497-2505 (2022) - [c7]Oswin Aichholzer, Johannes Obenaus, Joachim Orthaber, Rosna Paul, Patrick Schnider, Raphael Steiner, Tim Taubner, Birgit Vogtenhuber:
Edge Partitions of Complete Geometric Graphs. SoCG 2022: 6:1-6:16 - [c6]Nicolas El Maalouly, Raphael Steiner:
Exact Matching in Graphs of Bounded Independence Number. MFCS 2022: 46:1-46:14 - [i17]Pierre Aboulker, Guillaume Aubian, Raphael Steiner:
Heroes in orientations of chordal graphs. CoRR abs/2202.09191 (2022) - [i16]Maximilian Gorsky, Raphael Steiner, Sebastian Wiederrecht:
Matching Theory and Barnette's Conjecture. CoRR abs/2202.11641 (2022) - [i15]Nicolas El Maalouly, Raphael Steiner:
Exact Matching in Graphs of Bounded Independence Number. CoRR abs/2202.11988 (2022) - [i14]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner, Birgit Vogtenhuber:
Coloring circle arrangements: New 4-chromatic planar graphs. CoRR abs/2205.08181 (2022) - [i13]Nicolas El Maalouly, Raphael Steiner, Lasse Wulf:
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. CoRR abs/2207.09797 (2022) - [i12]Jean Cardinal, Raphael Steiner:
Inapproximability of shortest paths on perfect matching polytopes. CoRR abs/2210.14608 (2022) - 2021
- [j11]Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip Distances Between Graph Orientations. Algorithmica 83(1): 116-143 (2021) - [j10]Michael Anastos, Ander Lamaison, Raphael Steiner, Tibor Szabó:
Majority Colorings of Sparse Digraphs. Electron. J. Comb. 28(2): 2 (2021) - [j9]Tamás Mészáros, Raphael Steiner:
Zero sum cycles in complete digraphs. Eur. J. Comb. 98: 103399 (2021) - [i11]Raphael Steiner:
Asymptotic Equivalence of Hadwiger's Conjecture and its Odd Minor-Variant. CoRR abs/2109.02302 (2021) - [i10]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 abs/2112.08456 (2021) - 2020
- [j8]Stefan Felsner, Winfried Hochstättler, Kolja Knauer, Raphael Steiner:
Complete Acyclic Colorings. Electron. J. Comb. 27(2): 2 (2020) - [j7]Raphael Steiner:
A note on coloring digraphs of large girth. Discret. Appl. Math. 287: 62-64 (2020) - [j6]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) - [j5]Raphael Steiner:
A Note on Graphs of Dichromatic Number 2. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j4]Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner:
A Note on Universal Point Sets for Planar Graphs. J. Graph Algorithms Appl. 24(3): 247-267 (2020) - [j3]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): 493-506 (2020) - [c5]Raphael Steiner, Sebastian Wiederrecht:
Parameterized Algorithms for Directed Modular Width. CALDAM 2020: 415-426 - [c4]Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings Meet Classical Theorems from Convex Geometry. GD 2020: 281-294 - [i9]Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner:
Pentagon contact representations. CoRR abs/2004.05942 (2020) - [i8]Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner:
Topological Drawings meet Classical Theorems from Convex Geometry. CoRR abs/2005.12568 (2020) - [i7]Christoph Hertrich, Felix Schröder, Raphael Steiner:
Coloring Drawings of Graphs. CoRR abs/2008.09692 (2020) - [i6]Karl Heuer, Raphael Steiner, Sebastian Wiederrecht:
Even Circuits in Oriented Matroids. CoRR abs/2010.08988 (2020)
2010 – 2019
- 2019
- [c3]Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner:
A Note on Universal Point Sets for Planar Graphs. GD 2019: 350-362 - [c2]Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip Distances Between Graph Orientations. WG 2019: 120-134 - [i5]Oswin Aichholzer, Jean Cardinal, Tony Huynh, Kolja Knauer, Torsten Mütze, Raphael Steiner, Birgit Vogtenhuber:
Flip distances between graph orientations. CoRR abs/1902.06103 (2019) - [i4]Marcelo Garlet Millani, Raphael Steiner, Sebastian Wiederrecht:
Colouring Non-Even Digraphs. CoRR abs/1903.02872 (2019) - [i3]Raphael Steiner, Sebastian Wiederrecht:
Parametrised Algorithms for Directed Modular Width. CoRR abs/1905.13203 (2019) - [i2]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Patrick Schnider, Raphael Steiner, Pavel Valtr:
On the Average Complexity of the k-Level. CoRR abs/1911.02408 (2019) - 2018
- [j2]Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner:
Pentagon Contact Representations. Electron. J. Comb. 25(3): 3 (2018) - [c1]Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner:
Equiangular Polygon Contact Representations. WG 2018: 203-215 - [i1]Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner:
A Note On Universal Point Sets for Planar Graphs. CoRR abs/1811.06482 (2018) - 2017
- [j1]Stefan Felsner, Hendrik Schrezenmaier, Raphael Steiner:
Pentagon Contact Representations. Electron. Notes Discret. Math. 61: 421-427 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-13 22:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
