The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John L. Goldwasser: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. John L. Goldwasser, Cun-Quan Zhang
    Permutation graphs and Petersen graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:51, n:, pp:- [Journal]
  2. Fan R. K. Chung, John L. Goldwasser
    Maximum subsets of (0, 1] with no solutions to x+y = kz. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1996, v:3, n:1, pp:- [Journal]
  3. Matthew M. Cropper, John L. Goldwasser
    Restricted list coloring and Hall's condition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:57-63 [Journal]
  4. John L. Goldwasser, William Klostermeyer, Henry Ware
    Fibonacci Polynomials and Parity Domination in Grid Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:2, pp:271-283 [Journal]
  5. Richard A. Brualdi, John L. Goldwasser, T. S. Michael
    Maximum permanents of matrices of zeros and ones. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:47, n:2, pp:207-245 [Journal]
  6. John L. Goldwasser
    Erdõs-Ko-Rado with conditions on the minimum complementary degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:109, n:1, pp:45-62 [Journal]
  7. John L. Goldwasser
    Permanent of the laplacian matrix of trees with a given matching. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:197-212 [Journal]
  8. Richard A. Brualdi, John L. Goldwasser
    Permanent of the Laplacian matrix of trees and bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:48, n:1, pp:1-21 [Journal]
  9. John L. Goldwasser, William Klostermeyer, Michael Mays, George Trapp
    The density of ones in Pascal's rhombus. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:204, n:1-3, pp:231-236 [Journal]

  10. Odd and Even Dominating Sets with Open Neighborhoods. [Citation Graph (, )][DBLP]


  11. Tight bounds for eternal dominating sets in graphs. [Citation Graph (, )][DBLP]


  12. Does the lit-only restriction make any difference for the sigma-game and sigma+-game? [Citation Graph (, )][DBLP]


Search in 0.185secs, Finished in 0.186secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002