The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Stanley M. Selkow: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  23. Distributing vertices along a Hamiltonian cycle in Dirac graphs. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002