Maya Stein - RankMe

71 papers A* 1B 2C 4Journal 64

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Monochromatic Partitions in 2-Edge-Coloured Bipartite Graphs. Electron. J. Comb. Camila Fernández, Matías Pavez-Signé, Maya Stein
2025	J	`jnl`	A Bounded Diameter Strengthening of Kőnig's Theorem. SIAM J. Discret. Math. Louis DeBiasio, António Girão, Penny Haxell, Maya Stein
2025	J	`jnl`	Antidirected Trees in Dense Digraphs. SIAM J. Discret. Math. Maya Stein, Ana Trujillo-Negrete
2025	C	`conf`	Degree conditions for embedding antidirected trees in digraphs. LAGOS George Kontogeorgiou, Giovanne Santos, Maya Stein
2025	J	`jnl`	Embedding nearly spanning trees. Comb. Probab. Comput. Bruce A. Reed, Maya Stein
2025	J	`jnl`	On the Ramsey number of the double star. Discret. Math. Freddy Flores Dubó, Maya Stein
2025	J	`jnl`	Packing large balanced trees into bipartite graphs. Discret. Math. Cristina G. Fernandes, Tássio Naia, Giovanne Santos, Maya Stein
2025	C	`conf`	Separating edges by linearly many subdivisions. LAGOS George Kontogeorgiou, Matías Pavez-Signé, Maya Stein, S. Taruni, Ana Trujillo-Negrete
2024	J	`jnl`	Antidirected subgraphs of oriented graphs. Comb. Probab. Comput. Maya Stein, Camila Zárate-Guerén
2024	J	`jnl`	Dirac-type conditions for spanning bounded-degree hypertrees. J. Comb. Theory B Matías Pavez-Signé, Nicolás Sanhueza-Matamala, Maya Stein
2024	J	`jnl`	Kalai's conjecture in r-partite r-graphs. Eur. J. Comb. Maya Stein
2024	J	`jnl`	Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles. Eur. J. Comb. Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan, Maya Stein
2023	J	`jnl`	3-Colouring P Algorithmica Alberto Rojas Anríquez, Maya Stein
2023	J	`jnl`	Antipaths in oriented graphs. Discret. Math. Tereza Klimosová, Maya Stein
2023	J	`jnl`	Monochromatic Paths in 2-Edge-Coloured Graphs and Hypergraphs. Electron. J. Comb. Maya Stein
2023	J	`jnl`	Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result. J. Graph Theory Bruce A. Reed, Maya Stein
2023	J	`jnl`	Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result. J. Graph Theory Bruce A. Reed, Maya Stein
2022	J	`jnl`	Clique immersions and independence number. Eur. J. Comb. Sebastián Bustamante, Daniel A. Quiroz, Maya Stein, José Zamora
2021	A*	`conf`	Active clustering for labeling training data. NeurIPS Quentin Lutz, Elie de Panafieu, Maya Stein, Alex Scott
2021	J	`jnl`	Active clustering for labeling training data. CoRR Quentin Lutz, Élie de Panafieu, Alex Scott, Maya Stein
2021	J	`jnl`	Better 3-coloring algorithms: Excluding a triangle and a seven vertex path. Theor. Comput. Sci. Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
2021	J	`jnl`	On the Erdős-Sós conjecture for trees with bounded degree. Comb. Probab. Comput. Guido Besomi, Matías Pavez-Signé, Maya Stein
2020	J	`jnl`	3-Colouring P CoRR Alberto Rojas, Maya Stein
2020	J	`jnl`	A variant of the Erdős-Sós conjecture. J. Graph Theory Frédéric Havet, Bruce A. Reed, Maya Stein, David R. Wood
2020	J	`jnl`	Maximum and Minimum Degree Conditions for Embedding Trees. SIAM J. Discret. Math. Guido Besomi, Matías Pavez-Signé, Maya Stein
2020	J	`jnl`	Regularity inheritance in pseudorandom graphs. Random Struct. Algorithms Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein
2019	J	`jnl`	Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles. J. Graph Theory Sebastián Bustamante, Hiêp Hàn, Maya Stein
2019	J	`jnl`	Approximately Coloring Graphs Without Long Induced Paths. Algorithmica Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
2019	J	`jnl`	Degree Conditions for Embedding Trees. SIAM J. Discret. Math. Guido Besomi, Matías Pavez-Signé, Maya Stein
2019	C	`conf`	Large Immersions in Graphs with Independence Number 3 and 4. LAGOS Sebastián Bustamante, Daniel A. Quiroz, Maya Stein, José Zamora
2019	J	`jnl`	Partitioning two?coloured complete multipartite graphs into monochromatic paths and cycles. J. Graph Theory Oliver Schaudt, Maya Stein
2018	J	`jnl`	Monochromatic tree covers and Ramsey numbers for set-coloured graphs. Discret. Math. Sebastián Bustamante, Maya Stein
2018	J	`jnl`	Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic ℓ-cycles. Eur. J. Comb. Sebastián Bustamante, Maya Stein
2018	J	`jnl`	Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. Comb. Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong
2017	J	`jnl`	Almost Partitioning a 3-Edge-Colored K SIAM J. Discret. Math. Richard Lang, Oliver Schaudt, Maya Stein
2017	J	`jnl`	Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles. Electron. Notes Discret. Math. Sebastián Bustamante, Hiêp Hàn, Maya Stein
2017	B	`conf`	Approximately Coloring Graphs Without Long Induced Paths. WG Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
2017	J	`jnl`	Clique coloring B Discret. Math. Flavia Bonomo, María Pía Mazzoleni, Maya Stein
2017	J	`jnl`	Local colourings and monochromatic partitions in complete bipartite graphs. Eur. J. Comb. Richard Lang, Maya Stein
2017	J	`jnl`	The Approximate Loebl-Komlós-Sós Conjecture I: The Sparse Decomposition. SIAM J. Discret. Math. Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
2017	J	`jnl`	The Approximate Loebl-Komlós-Sós Conjecture II: The Rough Structure of LKS Graphs. SIAM J. Discret. Math. Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
2017	J	`jnl`	The Approximate Loebl-Komlós-Sós Conjecture III: The Finer Structure of LKS Graphs. SIAM J. Discret. Math. Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
2017	J	`jnl`	The Approximate Loebl-Komlós-Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result. SIAM J. Discret. Math. Jan Hladký, János Komlós, Diana Piguet, Miklós Simonovits, Maya Stein, Endre Szemerédi
2016	J	`jnl`	Approximately coloring graphs without long induced paths. CoRR Maria Chudnovsky, Oliver Schaudt, Sophie Spirkl, Maya Stein, Mingxian Zhong
2016	J	`jnl`	List Edge-Coloring and Total Coloring in Graphs of Low Treewidth. J. Graph Theory Henning Bruhn, Richard Lang, Maya Stein
2016	J	`jnl`	Monochromatic Cycle Partitions in Local Edge Colorings. J. Graph Theory David Conlon, Maya Stein
2015	J	`jnl`	Local colourings and monochromatic partitions in complete bipartite graphs. Electron. Notes Discret. Math. Richard Lang, Maya Stein
2015	J	`jnl`	Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles. Electron. Notes Discret. Math. Richard Lang, Oliver Schaudt, Maya Stein
2015	J	`jnl`	Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles. Electron. Notes Discret. Math. Oliver Schaudt, Maya Stein
2015	J	`jnl`	b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
2014	J	`jnl`	Connectivity and tree structure in finite graphs. Comb. Johannes Carmesin, Reinhard Diestel, Fabian Hundertmark, Maya Stein
2014	J	`jnl`	Minimal bricks have many vertices of small degree. Eur. J. Comb. Henning Bruhn, Maya Stein
2014	J	`jnl`	Partitioning two-coloured complete multipartite graphs into monochromatic paths. CoRR Oliver Schaudt, Maya Stein
2014	C	`conf`	b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. ISCO Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
2013	J	`jnl`	Forcing Large Complete (Topological) Minors in Infinite Graphs. SIAM J. Discret. Math. Maya Stein, José Zamora
2013	J	`jnl`	Small degree vertices in minimal bricks. Electron. Notes Discret. Math. Henning Bruhn, Maya Stein
2013	J	`jnl`	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. CoRR Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
2012	J	`jnl`	On claw-free t-perfect graphs. Math. Program. Henning Bruhn, Maya Stein
2011	B	`conf`	Complexity of Splits Reconstruction for Low-Degree Trees. WG Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
2011	J	`jnl`	Extremal infinite graph theory. Discret. Math. Maya Stein
2011	J	`jnl`	Geodesic stability for memoryless binary long-lived consensus CoRR Cristina G. Fernandes, Maya Stein
2011	J	`jnl`	Stability in geodesics for memoryless binary long-lived consensus. Electron. Notes Discret. Math. Cristina G. Fernandes, Maya Stein
2011	J	`jnl`	The relative degree and large complete minors in infinite graphs. Electron. Notes Discret. Math. Maya Stein, José Zamora
2010	J	`jnl`	Complexity of Splits Reconstruction for Low-Degree Trees CoRR Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
2010	J	`jnl`	Ends and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs. SIAM J. Discret. Math. Maya Stein
2010	J	`jnl`	t-Perfection Is Always Strong for Claw-Free Graphs. SIAM J. Discret. Math. Henning Bruhn, Maya Stein
2009	J	`jnl`	Characterising claw-free t-perfect graphs. Electron. Notes Discret. Math. Maya Stein, Henning Bruhn
2007	J	`jnl`	An approximate version of the Loebl-Komlós-Sós conjecture. Electron. Notes Discret. Math. Diana Piguet, Maya Stein
2007	J	`jnl`	On end degrees and infinite cycles in locally finite graphs. Comb. Henning Bruhn, Maya Stein
2005	J	`jnl`	Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. J. Graph Theory Henning Bruhn, Reinhard Diestel, Maya Stein
2005	J	`jnl`	Menger's theorem for infinite graphs with ends. J. Graph Theory Henning Bruhn, Reinhard Diestel, Maya Stein