| 2008 |
|---|
| 24 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
Distributing vertices along a Hamiltonian cycle in Dirac graphs.
Discrete Mathematics 308(23): 5757-5770 (2008) |
| 23 | EE | Zoltán Füredi,
András Gyárfás,
Gábor N. Sárközy,
Stanley M. Selkow:
Inequalities for the first-fit chromatic number.
Journal of Graph Theory 59(1): 75-88 (2008) |
| 2006 |
|---|
| 22 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós.
Journal of Graph Theory 52(2): 147-156 (2006) |
| 2005 |
|---|
| 21 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
On a Turán-type hypergraph problem of Brown, Erdos and T. Sós.
Discrete Mathematics 297(1-3): 190-195 (2005) |
| 2004 |
|---|
| 20 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
An Extension Of The Ruzsa-Szemerédi Theorem.
Combinatorica 25(1): 77-84 (2004) |
| 19 | EE | Daniel J. Dougherty,
Stanley M. Selkow:
The complexity of the certification of properties of Stable Marriage.
Inf. Process. Lett. 92(6): 275-277 (2004) |
| 2003 |
|---|
| 18 | | Gábor N. Sárközy,
Stanley M. Selkow:
On bipartite generalized Ramsey theory.
Ars Comb. 68: (2003) |
| 17 | EE | Gábor N. Sárközy,
Stanley M. Selkow,
Endre Szemerédi:
On the number of Hamiltonian cycles in Dirac graphs.
Discrete Mathematics 265(1-3): 237-250 (2003) |
| 2001 |
|---|
| 16 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
On Edge Colorings with at Least q Colors in Every Subset of p Vertices.
Electr. J. Comb. 8(1): (2001) |
| 2000 |
|---|
| 15 | EE | Gábor N. Sárközy,
Stanley M. Selkow:
Vertex Partitions by Connected Monochromatic k-Regular Graphs.
J. Comb. Theory, Ser. B 78(1): 115-122 (2000) |
| 1999 |
|---|
| 14 | EE | Aron C. Atkins,
Gábor N. Sárközy,
Stanley M. Selkow:
Counting irregular multigraphs.
Discrete Mathematics 195(1-3): 235-237 (1999) |
| 1998 |
|---|
| 13 | EE | Stanley M. Selkow:
The enumeration of labeled graphs by number of cutpoints.
Discrete Mathematics 185(1-3): 183-191 (1998) |
| 1997 |
|---|
| 12 | EE | Steve Taylor,
Nabil I. Hachem,
Stanley M. Selkow:
The Average Height of a Node in the BANG Abstract Directory Tree.
Inf. Process. Lett. 61(1): 55-61 (1997) |
| 1996 |
|---|
| 11 | EE | Claude A. Christen,
Giovanni Coray,
Stanley M. Selkow:
A characterization of n-component graphs.
Discrete Mathematics 149(1-3): 279-281 (1996) |
| 1994 |
|---|
| 10 | EE | Stanley M. Selkow:
A Probabilistic lower bound on the independence number of graphs.
Discrete Mathematics 132(1-3): 363-365 (1994) |
| 1993 |
|---|
| 9 | EE | Stanley M. Selkow:
The independence number of graphs in terms of degrees.
Discrete Mathematics 122(1-3): 343-348 (1993) |
| 1990 |
|---|
| 8 | | O. J. Murphy,
Stanley M. Selkow:
Finding Nearest Neighbors with Voronoi Tessellations.
Inf. Process. Lett. 34(1): 37-41 (1990) |
| 1986 |
|---|
| 7 | | O. J. Murphy,
Stanley M. Selkow:
The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space.
Inf. Process. Lett. 23(4): 215-218 (1986) |
| 1981 |
|---|
| 6 | | Charles E. Hughes,
Stanley M. Selkow:
The Finite Power Property for Context-Free Languages.
Theor. Comput. Sci. 15: 111-114 (1981) |
| 1980 |
|---|
| 5 | | László Babai,
Paul Erdös,
Stanley M. Selkow:
Random Graph Isomorphism.
SIAM J. Comput. 9(3): 628-635 (1980) |
| 1979 |
|---|
| 4 | EE | Claude A. Christen,
Stanley M. Selkow:
Some perfect coloring properties of graphs.
J. Comb. Theory, Ser. B 27(1): 49-59 (1979) |
| 1978 |
|---|
| 3 | | Stanley M. Selkow:
New Bounds for the Clique Number of a Graph.
Inf. Process. Lett. 7(4): 173-174 (1978) |
| 1977 |
|---|
| 2 | | Stanley M. Selkow:
The Tree-to-Tree Editing Problem.
Inf. Process. Lett. 6(6): 184-186 (1977) |
| 1972 |
|---|
| 1 | EE | Stanley M. Selkow:
One-Pass Complexity of Digital Picture Properties.
J. ACM 19(2): 283-295 (1972) |
