The tree-to-tree editing problem SM Selkow Information processing letters 6 (6), 184-186, 1977 | 648 | 1977 |

Random graph isomorphism L Babai, P Erdos, SM Selkow SIaM Journal on computing 9 (3), 628-635, 1980 | 404 | 1980 |

Algorithms in a nutshell: A practical guide GT Heineman, G Pollice, S Selkow " O'Reilly Media, Inc.", 2016 | 147 | 2016 |

Some perfect coloring properties of graphs CA Christen, SM Selkow Journal of Combinatorial Theory, Series B 27 (1), 49-59, 1979 | 133 | 1979 |

Ramsey‐type results for Gallai colorings A Gyárfás, GN Sárközy, A Sebő, S Selkow Journal of Graph Theory 64 (3), 233-243, 2010 | 86 | 2010 |

Cost-minimal trees in directed acyclic graphs L Nastansky, SM Selkow, NF Stewart Zeitschrift für Operations Research 18, 59-67, 1974 | 68 | 1974 |

On *k*‐ordered Hamiltonian graphsHA Kierstead, GN Sárközy, SM Selkow Journal of Graph Theory 32 (1), 17-25, 1999 | 45 | 1999 |

One-pass complexity of digital picture properties SM Selkow Journal of the ACM (JACM) 19 (2), 283-295, 1972 | 44 | 1972 |

An extension of the Ruzsa-Szemerédi theorem GN Sárközy, S Selkow Combinatorica 25, 77-84, 2004 | 42 | 2004 |

analysis of the general tree-editing problem AS Noetzel, SM Selkow Time warps, string edits, and macromolecules: the theory and practice of …, 1983 | 39 | 1983 |

On the number of Hamiltonian cycles in Dirac graphs GN Sárközy, SM Selkow, E Szemerédi Discrete Mathematics 265 (1-3), 237-250, 2003 | 30 | 2003 |

On a Turán-type hypergraph problem of Brown, Erdős and T. Sós GN Sárközy, S Selkow Discrete mathematics 297 (1-3), 190-195, 2005 | 28 | 2005 |

A probabilistic lower bound on the independence number of graphs SM Selkow Discrete Mathematics 132 (1-3), 363-365, 1994 | 28 | 1994 |

Inequalities for the first‐fit chromatic number Z Füredi, A Gyárfás, GN Sárközy, S Selkow Journal of Graph Theory 59 (1), 75-88, 2008 | 20 | 2008 |

On edge colorings with at least q colors in every subset of p vertices GN Sárközy, S Selkow the electronic journal of combinatorics 8 (1), R9, 2000 | 20 | 2000 |

The efficiency of using kd trees for finding nearest neighbors in discrete space OJ Murphy, SM Selkow Information Processing Letters 23 (4), 215-218, 1986 | 20 | 1986 |

Distributing vertices along a Hamiltonian cycle in Dirac graphs GN Sárközy, S Selkow Discrete mathematics 308 (23), 5757-5770, 2008 | 18 | 2008 |

Coverings by few monochromatic pieces: a transition between two Ramsey problems A Gyárfás, GN Sárközy, S Selkow Graphs and Combinatorics 31, 131-140, 2015 | 17 | 2015 |

Vertex partitions by connected monochromatic k-regular graphs GN Sárközy, SM Selkow Journal of Combinatorial Theory, Series B 78 (1), 115-122, 2000 | 17 | 2000 |

The independence number of graphs in terms of degrees SM Selkow Discrete mathematics 122 (1-3), 343-348, 1993 | 17 | 1993 |