Stanley M. Selkow

33 papers Journal 32
YearRankTypeTitle / Venue / Authors
2015 J jnl
Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems.
Graphs Comb.
András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow
2013 J jnl
An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs.
J. Graph Theory
Gábor N. Sárközy, Stanley M. Selkow, Fei Song
2011 J jnl
Vertex partitions of non-complete graphs into connected monochromatic k-regular graphs.
Discret. Math.
Gábor N. Sárközy, Stanley M. Selkow, Fei Song
2010 J jnl
Ramsey-type results for Gallai colorings.
J. Graph Theory
András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow
2009 — book
Algorithms in a nutshell - a desktop quick reference.
George T. Heineman, Gary Pollice, Stanley M. Selkow
2008 J jnl
Distributing vertices along a Hamiltonian cycle in Dirac graphs.
Discret. Math.
Gábor N. Sárközy, Stanley M. Selkow
2008 J jnl
Inequalities for the first-fit chromatic number.
J. Graph Theory
Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow
2006 J jnl
On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós.
J. Graph Theory
Gábor N. Sárközy, Stanley M. Selkow
2005 J jnl
On a Turán-type hypergraph problem of Brown, Erdos and T. Sós.
Discret. Math.
Gábor N. Sárközy, Stanley M. Selkow
2004 J jnl
An Extension Of The Ruzsa-Szemerédi Theorem.
Comb.
Gábor N. Sárközy, Stanley M. Selkow
2004 J jnl
The complexity of the certification of properties of Stable Marriage.
Inf. Process. Lett.
Daniel J. Dougherty, Stanley M. Selkow
2003 J jnl
An application of the regularity lemma in generalized Ramsey theory.
J. Graph Theory
Gábor N. Sárközy, Stanley M. Selkow
2003 J jnl
On bipartite generalized Ramsey theory.
Ars Comb.
Gábor N. Sárközy, Stanley M. Selkow
2003 J jnl
On the number of Hamiltonian cycles in Dirac graphs.
Discret. Math.
Gábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi
2001 J jnl
On Edge Colorings with at Least q Colors in Every Subset of p Vertices.
Electron. J. Comb.
Gábor N. Sárközy, Stanley M. Selkow
2000 J jnl
Vertex Partitions by Connected Monochromatic k-Regular Graphs.
J. Comb. Theory B
Gábor N. Sárközy, Stanley M. Selkow
1999 J jnl
Counting irregular multigraphs.
Discret. Math.
Aron C. Atkins, Gábor N. Sárközy, Stanley M. Selkow
1999 J jnl
On
J. Graph Theory
Hal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow
1998 J jnl
The enumeration of labeled graphs by number of cutpoints.
Discret. Math.
Stanley M. Selkow
1997 J jnl
The Average Height of a Node in the BANG Abstract Directory Tree.
Inf. Process. Lett.
Steve Taylor, Nabil I. Hachem, Stanley M. Selkow
1996 J jnl
A characterization of n-component graphs.
Discret. Math.
Claude A. Christen, Giovanni Coray, Stanley M. Selkow
1994 J jnl
A Probabilistic lower bound on the independence number of graphs.
Discret. Math.
Stanley M. Selkow
1993 J jnl
The independence number of graphs in terms of degrees.
Discret. Math.
Stanley M. Selkow
1990 J jnl
Finding Nearest Neighbors with Voronoi Tessellations.
Inf. Process. Lett.
O. J. Murphy, Stanley M. Selkow
1986 J jnl
The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space.
Inf. Process. Lett.
O. J. Murphy, Stanley M. Selkow
1981 J jnl
The Finite Power Property for Context-Free Languages.
Theor. Comput. Sci.
Charles E. Hughes, Stanley M. Selkow
1980 J jnl
Random Graph Isomorphism.
SIAM J. Comput.
László Babai, Paul Erdös, Stanley M. Selkow
1979 J jnl
Some perfect coloring properties of graphs.
J. Comb. Theory B
Claude A. Christen, Stanley M. Selkow
1978 J jnl
New Bounds for the Clique Number of a Graph.
Inf. Process. Lett.
Stanley M. Selkow
1977 J jnl
The Tree-to-Tree Editing Problem.
Inf. Process. Lett.
Stanley M. Selkow
1974 J jnl
Cost-minimal trees in directed acyclic graphs.
Z. Oper. Research
Ludwig Nastansky, Stanley M. Selkow, Neil F. Stewart
1974 J jnl
Diagnostic Keys as a Representation for Context in Pattern Recognition.
IEEE Trans. Computers
Stanley M. Selkow
1972 J jnl
One-Pass Complexity of Digital Picture Properties.
J. ACM
Stanley M. Selkow