Maya Stein

704 total citations
58 papers, 290 citations indexed

About

Maya Stein is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Maya Stein has authored 58 papers receiving a total of 290 indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 43 papers in Discrete Mathematics and Combinatorics and 27 papers in Geometry and Topology. Recurrent topics in Maya Stein's work include Advanced Graph Theory Research (44 papers), Limits and Structures in Graph Theory (43 papers) and Advanced Topology and Set Theory (15 papers). Maya Stein is often cited by papers focused on Advanced Graph Theory Research (44 papers), Limits and Structures in Graph Theory (43 papers) and Advanced Topology and Set Theory (15 papers). Maya Stein collaborates with scholars based in Chile, Germany and United States. Maya Stein's co-authors include Henning Bruhn, Reinhard Diestel, Oliver Schaudt, Flavia Bonomo, Maria Chudnovsky, David Conlon, Hiệp Hàn, Endre Szemerédi, Miklós Simonovits and Jan Hladký and has published in prestigious journals such as Mathematical Programming, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Maya Stein

50 papers receiving 267 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Maya Stein Chile	9	259	159	139	27	26	58	290
Henning Bruhn Germany	10	253 1.0×	106 0.7×	163 1.2×	16 0.6×	32 1.2×	45	304
Balázs Patkós Hungary	9	176 0.7×	204 1.3×	145 1.0×	51 1.9×	24 0.9×	59	276
Dániel Gerbner Hungary	10	282 1.1×	324 2.0×	219 1.6×	37 1.4×	4 0.2×	67	375
André Kündgen United States	10	292 1.1×	199 1.3×	80 0.6×	77 2.9×	16 0.6×	30	329
Norbert Sauer Canada	10	346 1.3×	226 1.4×	174 1.3×	81 3.0×	18 0.7×	30	406
Norbert Polat France	10	247 1.0×	86 0.5×	161 1.2×	12 0.4×	22 0.8×	53	285
Juan José Montellano‐Ballesteros Mexico	8	213 0.8×	185 1.2×	106 0.8×	47 1.7×	20 0.8×	42	250
Ko‐Wei Lih Taiwan	10	206 0.8×	110 0.7×	63 0.5×	50 1.9×	30 1.2×	24	260
D. A. Shabanov Russia	10	173 0.7×	224 1.4×	121 0.9×	59 2.2×	3 0.1×	60	273
Bogdan Oporowski United States	9	300 1.2×	143 0.9×	76 0.5×	50 1.9×	56 2.2×	21	317

Countries citing papers authored by Maya Stein

Since Specialization

Citations

This map shows the geographic impact of Maya Stein's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Maya Stein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Maya Stein more than expected).

Fields of papers citing papers by Maya Stein

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Maya Stein. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Maya Stein. The network helps show where Maya Stein may publish in the future.

Co-authorship network of co-authors of Maya Stein

This figure shows the co-authorship network connecting the top 25 collaborators of Maya Stein. A scholar is included among the top collaborators of Maya Stein based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Maya Stein. Maya Stein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Stein, Maya, et al.. (2024). On the Ramsey number of the double star. Discrete Mathematics. 348(1). 114227–114227. 1 indexed citations

Stein, Maya, et al.. (2023). Dirac-type conditions for spanning bounded-degree hypertrees. Journal of Combinatorial Theory Series B. 165. 97–141. 2 indexed citations

Stein, Maya, et al.. (2023). Towards a Hypergraph version of the Pósa–Seymour Conjecture. arXiv (Cornell University). 1 indexed citations

Stein, Maya. (2023). Kalai’s conjecture in r-partite r-graphs. European Journal of Combinatorics. 117. 103827–103827.

Stein, Maya, et al.. (2023). Antipaths in oriented graphs. Discrete Mathematics. 346(9). 113515–113515. 3 indexed citations

Stein, Maya. (2023). Monochromatic Paths in 2-Edge-Coloured Graphs and Hypergraphs. The Electronic Journal of Combinatorics. 30(1). 1 indexed citations

Stein, Maya, et al.. (2018). Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic ℓ-cycles. European Journal of Combinatorics. 71. 213–221. 1 indexed citations

Bonomo, Flavia, et al.. (2017). Clique coloring B1-EPG graphs. Discrete Mathematics. 340(5). 1008–1011. 3 indexed citations

Stein, Maya, et al.. (2016). Local colourings and monochromatic partitions in complete bipartite graphs. European Journal of Combinatorics. 60. 42–54. 5 indexed citations

10.

Szemerédi, Endre, et al.. (2015). The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs. arXiv (Cornell University). 22(0). 1–11. 2 indexed citations

11.

Fernandes, Cristina G. & Maya Stein. (2015). Geodesic stability for memoryless binary long-lived consensus. Journal of Computer and System Sciences. 81(7). 1210–1220.

12.

Matamala, Martı́n, et al.. (2015). Convex p-partitions of bipartite graphs. Theoretical Computer Science. 609. 511–514. 3 indexed citations

13.

Schaudt, Oliver & Maya Stein. (2014). Partitioning two-coloured complete multipartite graphs into monochromatic paths.. arXiv (Cornell University). 2 indexed citations

14.

Gaspers, Serge, Mathieu Liedloff, Maya Stein, & Karol Suchan. (2014). Complexity of splits reconstruction for low-degree trees. Discrete Applied Mathematics. 180. 89–100.

15.

Diestel, Reinhard, et al.. (2014). Connectivity and tree structure in finite graphs. COMBINATORICA. 34(1). 11–46. 22 indexed citations

16.

Bruhn, Henning & Maya Stein. (2013). Minimal bricks have many vertices of small degree. European Journal of Combinatorics. 36. 261–269. 4 indexed citations

17.

Stein, Maya, et al.. (2011). An approximate version of the Loebl–Komlós–Sós conjecture. Journal of Combinatorial Theory Series B. 102(1). 102–125. 7 indexed citations

18.

Bruhn, Henning & Maya Stein. (2009). Duality of Ends. Combinatorics Probability Computing. 19(1). 47–60. 10 indexed citations

19.

Stein, Maya. (2005). Arboricity and tree-packing in locally finite graphs. Journal of Combinatorial Theory Series B. 96(2). 302–312. 17 indexed citations

20.

Bruhn, Henning & Maya Stein. (2005). MacLane's planarity criterion for locally finite graphs. Journal of Combinatorial Theory Series B. 96(2). 225–239. 26 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact