The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stanislaw P. Radziszowski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
    Complexity Results in Graph Reconstruction. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:287-297 [Conf]
  2. Brendan D. McKay, Stanislaw P. Radziszowski
    The First Classical Ramsey Number for Hypergraphs is Computed. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:304-308 [Conf]
  3. Susan E. Fettes, Richard L. Kramer, Stanislaw P. Radziszowski
    An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3). [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:72, n:, pp:- [Journal]
  4. Brendan D. McKay, Konrad Piwakowski, Stanislaw P. Radziszowski
    Ramsey Numbers for Triangles versus Almost-Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:73, n:, pp:- [Journal]
  5. Konrad Piwakowski, Stanislaw P. Radziszowski
    The Ramsey Multiplicity of K4. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:60, n:, pp:- [Journal]
  6. Xu Xiaodong, Xie Zheng, Geoffrey Exoo, Stanislaw P. Radziszowski
    Constructive Lower Bounds on Classical Multicolor Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  7. Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
    Complexity Results in Graph Reconstruction [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  8. Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi
    Complexity results in graph reconstruction. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:103-118 [Journal]
  9. Alina Beygelzimer, Stanislaw P. Radziszowski
    On halving line arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:267-283 [Journal]
  10. Donald L. Kreher, Stanislaw P. Radziszowski
    The existence of simple 6-(14, 7, 4) designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:43, n:2, pp:237-243 [Journal]
  11. Brendan D. McKay, Stanislaw P. Radziszowski
    Linear Programming in Some Ramsey Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1994, v:61, n:1, pp:125-132 [Journal]
  12. Brendan D. McKay, Stanislaw P. Radziszowski
    Subgraph Counting Identities and Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:69, n:2, pp:193-209 [Journal]
  13. Xu Xiaodong, Xie Zheng, Stanislaw P. Radziszowski
    A constructive approach for the lower bounds on the Ramsey numbers R (s, t). [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:3, pp:231-239 [Journal]
  14. D. de Caen, Donald L. Kreher, Stanislaw P. Radziszowski, W. H. Mills
    On the covering of t-sets with (t + 1)-sets: C(9, 5, 4) and C(10, 6, 5). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:92, n:1-3, pp:65-77 [Journal]

  15. Computation of the Ramsey Number R(W5,K5) [Citation Graph (, )][DBLP]


Search in 0.025secs, Finished in 0.026secs
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