3 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.DM2011
Geodesic stability for memoryless binary long-lived consensus
Cristina G. Fernandes, Maya Stein
The determination of the stability of the long-lived consensus problem is a fundamental open problem in distributed systems. We concentrate on the memoryless binary case with geode…
math.CO2011★ 3 cited
Forcing large complete minors in infinite graphs
Maya Stein, José Zamora
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs…
math.CO2007★ 2 cited
The Loebl-Komlos-Sos conjecture for trees of diameter 5 and for certain caterpillars
Diana Piguet, Maya Jakobine Stein
Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at least some k, then every tree with at most k edges is a subgraph of G. We prove th…