The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Richard J. Nowakowski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Barbro Back, Daniel E. O'Leary, Richard J. Nowakowski, Christian D. Mueller, Marinos Themistocleous, Eija Koskivaara
    Panel: The impact of IT on accounting and auditing. [Citation Graph (0, 0)][DBLP]
    ECIS, 2002, pp:- [Conf]
  2. Shannon L. Fitzpatrick, Jeannette Janssen, Richard J. Nowakowski
    Distributive Online Channel Assignment for Hexagonal Cellular Networks with Constraints. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:147-154 [Conf]
  3. Richard J. Nowakowski, Norbert Zeh
    Boundary-Optimal Triangulation Flooding. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:717-728 [Conf]
  4. Jason I. Brown, Richard J. Nowakowski
    Bounding the Roots of Independence Polynomials. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:58, n:, pp:- [Journal]
  5. Nancy E. Clarke, Richard J. Nowakowski
    Cops, Robber, and Photo Radar. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:56, n:, pp:- [Journal]
  6. Shannon L. Fitzpatrick, Richard J. Nowakowski
    Copnumber Of Graphs With Strong Isometric Dimension Two. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:59, n:, pp:- [Journal]
  7. Richard J. Nowakowski, Ivan Rival
    On a class of isometric subgraphs of a graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:1, pp:79-90 [Journal]
  8. Michael H. Albert, Richard J. Nowakowski
    The Game of End-Nim. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal]
  9. Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer
    On well-covered triangulations: Part I. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:97-108 [Journal]
  10. Shannon L. Fitzpatrick, Jeannette Janssen, Richard J. Nowakowski
    Distributive online channel assignment for hexagonal cellular networks with constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:84-91 [Journal]
  11. Richard J. Nowakowski
    Search ans Sweep Numbers of Finite Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:41, n:1, pp:1-11 [Journal]
  12. Michael H. Albert, Derek A. Holton, Richard J. Nowakowski
    The ultimate categorical matching in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:232, n:1-3, pp:1-9 [Journal]
  13. Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski
    The k-fractal of a simplicial complex. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:33-45 [Journal]
  14. Nancy E. Clarke, Richard J. Nowakowski
    Tandem-win graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:299, n:1-3, pp:56-64 [Journal]
  15. Shannon L. Fitzpatrick, Richard J. Nowakowski, Derek A. Holton, Ian Caines
    Covering hypercubes by isometric paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:253-260 [Journal]
  16. Richard J. Nowakowski, C. A. Whitehead
    Ordered graceful labellings of the 2-star. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:183-191 [Journal]
  17. Bojan Mohar, Richard J. Nowakowski, Douglas B. West
    Research problems from the 5th Slovenian Conference (Bled, 2003). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:650-658 [Journal]
  18. Jason I. Brown, Richard J. Nowakowski
    The well-covered dimension of random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:352-355 [Journal]
  19. Richard J. Nowakowski, Norbert Zeh
    Boundary-optimal Triangulation Flooding. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2006, v:16, n:2-3, pp:271-290 [Journal]
  20. Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski
    The independence fractal of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:209-230 [Journal]
  21. Jason I. Brown, Richard J. Nowakowski
    Average independence polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:93, n:2, pp:313-318 [Journal]
  22. Art S. Finbow, Bert Hartnell, Richard J. Nowakowski
    A Characterization of Well Covered Graphs of Girth 5 or Greater. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1993, v:57, n:1, pp:44-68 [Journal]
  23. Jason I. Brown, Richard J. Nowakowski
    Well-Covered Vector Spaces of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:4, pp:952-965 [Journal]
  24. Jason I. Brown, Richard J. Nowakowski, Douglas F. Rall
    The Ultimate Categorical Independence Ratio of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:2, pp:290-300 [Journal]
  25. Erik D. Demaine, Rudolf Fleischer, Aviezri S. Fraenkel, Richard J. Nowakowski
    Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:539-543 [Journal]
  26. Rudolf Fleischer, Richard J. Nowakowski
    Preface: Algorithmic Combinatorial Game Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:313- [Journal]
  27. S. Howse, Richard J. Nowakowski
    Periodicity and arithmetic-periodicity in hexadecimal games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:463-472 [Journal]
  28. Richard J. Nowakowski, Ivan Rival
    The smallest graph variety containing all paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:223-234 [Journal]
  29. Richard J. Nowakowski, Peter Winkler
    Vertex-to-vertex pursuit in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:235-239 [Journal]
  30. Robert E. Jamison, Richard J. Nowakowski
    A Helly theorem for convexity in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:1, pp:35-39 [Journal]
  31. Richard J. Nowakowski
    Cutsets of Boolean lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:231-240 [Journal]
  32. Richard J. Nowakowski, Ivan Rival
    Retract rigid cartesian products of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:70, n:2, pp:169-184 [Journal]
  33. Jason I. Brown, Richard J. Nowakowski, Igor E. Zverovich
    The structure of well-covered graphs with no cycles of length 4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:17-18, pp:2235-2245 [Journal]

  34. Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm. [Citation Graph (, )][DBLP]


  35. The Robot Cleans Up. [Citation Graph (, )][DBLP]


  36. Representing orders on the plane by translating points and lines. [Citation Graph (, )][DBLP]


  37. On well-covered triangulations: Part II. [Citation Graph (, )][DBLP]


  38. On well-covered triangulations: Part III. [Citation Graph (, )][DBLP]


  39. Parallel cleaning of a network with brushes. [Citation Graph (, )][DBLP]


  40. Edge critical cops and robber. [Citation Graph (, )][DBLP]


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