Stanley M. Selkow - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2015

Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey ProblemsAndrás Gyárfás, Gábor N. Sárközy, Stanley M. Selkow. gc, 31(1):131-140, 2015. [doi]

2013

An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular GraphsGábor N. Sárközy, Stanley M. Selkow, Fei Song. jgt, 73(2):127-145, 2013. [doi]

2011

Vertex partitions of non-complete graphs into connected monochromatic k-regular graphsGábor N. Sárközy, Stanley M. Selkow, Fei Song. DM, 311(18-19):2079-2084, 2011. [doi]

2010

Ramsey-type results for Gallai coloringsAndrás Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow. jgt, 64(3):233-243, 2010. [doi]

2009

Algorithms in a nutshell - a desktop quick referenceGeorge T. Heineman, Gary Pollice, Stanley M. Selkow. O Reilly, 2009. [doi]

2008

Inequalities for the first-fit chromatic numberZoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow. jgt, 59(1):75-88, 2008. [doi]

Distributing vertices along a Hamiltonian cycle in Dirac graphsGábor N. Sárközy, Stanley M. Selkow. DM, 308(23):5757-5770, 2008. [doi]

2006

On an anti-Ramsey problem of Burr, Erdös, Graham, and T. SósGábor N. Sárközy, Stanley M. Selkow. jgt, 52(2):147-156, 2006. [doi]

2005

On a Turán-type hypergraph problem of Brown, Erdos and T. SósGábor N. Sárközy, Stanley M. Selkow. DM, 297(1-3):190-195, 2005. [doi]

2004

The complexity of the certification of properties of Stable MarriageDaniel J. Dougherty, Stanley M. Selkow. ipl, 92(6):275-277, 2004. [doi]

An Extension Of The Ruzsa-Szemerédi TheoremGábor N. Sárközy, Stanley M. Selkow. combinatorica, 25(1):77-84, 2004. [doi]

2003

An application of the regularity lemma in generalized Ramsey theoryGábor N. Sárközy, Stanley M. Selkow. jgt, 44(1):39-49, 2003. [doi]

On bipartite generalized Ramsey theoryGábor N. Sárközy, Stanley M. Selkow. arscom, 68, 2003.

On the number of Hamiltonian cycles in Dirac graphsGábor N. Sárközy, Stanley M. Selkow, Endre Szemerédi. DM, 265(1-3):237-250, 2003. [doi]

2001

On Edge Colorings with at Least q Colors in Every Subset of p VerticesGábor N. Sárközy, Stanley M. Selkow. combinatorics, 8(1), 2001. [doi]

2000

Vertex Partitions by Connected Monochromatic k-Regular GraphsGábor N. Sárközy, Stanley M. Selkow. JCT, 78(1):115-122, 2000. [doi]

1999

Counting irregular multigraphsAron C. Atkins, Gábor N. Sárközy, Stanley M. Selkow. DM, 195(1-3):235-237, 1999. [doi]

k-ordered Hamiltonian graphsHal A. Kierstead, Gábor N. Sárközy, Stanley M. Selkow. jgt, 32(1):17-25, 1999. [doi]

1998

The enumeration of labeled graphs by number of cutpointsStanley M. Selkow. DM, 185(1-3):183-191, 1998. [doi]

1997

The Average Height of a Node in the BANG Abstract Directory TreeSteve Taylor, Nabil I. Hachem, Stanley M. Selkow. ipl, 61(1):55-61, 1997. [doi]

1996

A characterization of n-component graphsClaude A. Christen, Giovanni Coray, Stanley M. Selkow. DM, 149(1-3):279-281, 1996. [doi]

1994

A Probabilistic lower bound on the independence number of graphsStanley M. Selkow. DM, 132(1-3):363-365, 1994. [doi]

1993

The independence number of graphs in terms of degreesStanley M. Selkow. DM, 122(1-3):343-348, 1993. [doi]

1990

Finding Nearest Neighbors with Voronoi TessellationsO. J. Murphy, Stanley M. Selkow. ipl, 34(1):37-41, 1990.

1986

The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete SpaceO. J. Murphy, Stanley M. Selkow. ipl, 23(4):215-218, 1986.

1981

The Finite Power Property for Context-Free LanguagesCharles E. Hughes, Stanley M. Selkow. TCS, 15:111-114, 1981.

1980

Random Graph IsomorphismLászló Babai, Paul Erdös, Stanley M. Selkow. SICOMP, 9(3):628-635, 1980.

1979

Some perfect coloring properties of graphsClaude A. Christen, Stanley M. Selkow. JCT, 27(1):49-59, 1979. [doi]

1978

New Bounds for the Clique Number of a GraphStanley M. Selkow. ipl, 7(4):173-174, 1978.

1977

The Tree-to-Tree Editing ProblemStanley M. Selkow. ipl, 6(6):184-186, 1977.

1974

Cost-minimal trees in directed acyclic graphsLudwig Nastansky, Stanley M. Selkow, Neil F. Stewart. mmor, 18(1):59-67, 1974. [doi]

Diagnostic Keys as a Representation for Context in Pattern RecognitionStanley M. Selkow. TC, 23(9):970-971, 1974. [doi]

1972

One-Pass Complexity of Digital Picture PropertiesStanley M. Selkow. JACM, 19(2):283-295, 1972. [doi]

Sign in or sign up to see more results.

runs on WebDSL