I am interested in problems dealing with independent sets and also with pursuit-evasion games on graphs


Current Topics of Interest:

  1. •variants of pursuit-evasion or bad guys and good guys on graphs

    1. ◦Cops and Robber

    2. ◦Seepage

    3. ◦Cleaning a network and the robot vacuum problem.

  2. •characterization of classes of well-covered graphs

  3. •polynomials of graphs


Publications---last 5 years


Articles

  1. •E. Duchene, H. Kheddouci, R. J. Nowakowski, M.A Tahraoui, Labeled packings of graphs, to appear in Australian Journal of Combinatorics.

  2. •Anthony Bonato; Richard J. Nowakowski, Sketchy Tweets: Ten Minute Conjectures in Graph Theory, The Mathematical Intelligencer 34 (2012) 8-15.

  3. •M. E. Messinger, R. J. Nowakowski, P. Pralat, Cleaning with Brooms, Graphs and Combinatorics, 27 (2011) 251–267.

  4. •Art S. Finbow, Richard J. Nowakowski, Bert L. Hartnell, and M. D. Plummer. On well-covered triangulations: Part III. 158 Disc. Applied Math. (2010) 894-912.

  5. •S. Gaspers, M. E. Messinger, R. J. Nowakowski, and P. Pralat, Parallel cleaning of a network

  6. •Disc. Applied Math., 158 (2010) 467-478.

  7. •N E. Clarke, S. L. Fitzpatrick, A. Hill, R. J. Nowakowski, Edge Critical Cops and Robbers, Disc. Math., 310 (2010) 2299-2309.

  8. •Art S. Finbow, Richard J. Nowakowski, Bert L. Hartnell, and M. D. Plummer. On well-covered triangulations II. Disc. Applied Math. 157 (2009) 2799-2817

  9. •M. E. Messinger and R. J.  Nowakowski, The Robot Cleans Up, J. Combin. Optimization, 18 (2009) 350--361.


  1. •Richard J. Nowakowski and Karen Seyffarth. Small cycle double covers of products II: Categorical and strong products with paths and cycles. Graphs and Combinatorics, 25(2009) 1–16.

  2. •S. Gaspers, M. E. Messinger, R. J. Nowakowski,  P. Pralat, Clean the graph before you draw it!, Information Processing Letters109(2009) 463–467.

  3. •M. E. Messinger, R. J. Nowakowski,  The robot cleans up (extended abstract) COCOA2008, (2009) 5156

  4. •N. E. Clarke, S. Finbow, S. L. Fitzpatrick, M. E. Messenger, and R. J. Nowakowski. Seepage in directed acyclic graphs. Australas. J. Combin., 43(2009) 91–102.

  5. •. I. Brown, C. Colbourn, R. J. Nowakowski, Chip Firing and All-Terminal Reliability, Discrete Optimization, 6 (2009) 436-445.

  6. •J. I. Brown, R. J. Nowakowski,  The neighborhood polynomial of a graph, Australas. J. Combin. 42 (2008), 55–68.

  7. •JR. J. Nowakowski,  K. Seyffarth, Cycle double covers of Categorical and strong products of graphs, J. of Graph Theory, 57(2008), 99-123.  

  8. •M. E. Messinger, R. J. Nowakowski,  P. Pralat, Cleaning a Network with Brushes, J. Theoretical Comp. Sci., 399 (2008),191-205.   

  9. •M. E. Messinger, R. Nowakowski, P. Pralat, N. Wormald, Cleaning random d-regular graphs with brushes using a degree-greedy algorithm, CAAN2007, (2007), 13-26.  

  10. •J. I. Brown, R. J. Nowakowski,  The well-covered dimension of random graphs, Disc. Math. 307 (2007), 352--355.  

  11. •J. I. Brown, R. J. Nowakowski,  and I. E. Zverovich, The Structure of Well-Covered Graphs With No Cycles of Length Four, Disc. Math. 307 (2007), 2235-2245.  

  12. •


Students and Theses

 Graduates

  1. •Margaret-Ellen Messinger   2008 Ph.D. Methods of Decontaminating a Network

  2. •Alan Hill                     2008    Ph.D  Cops and Robber: Theme and Variations

  3. •Sable McKeil             2006    M.Sc. Cleaning a Network

  4. •Adrian Tang               2004    M.Sc.    Zero visibility Cops and Robber game

  5. •Margaret-Ellen Messinger 2004 M.Sc. Firefighting on Infinite grids

  6. •Nancy Clarke            2002    Ph.D.     Constrained Cops and Robber

  7. •Nancy Clarke            1999    M.Sc.     The Effect of replacing Cops by Technology.

  8. •Stephen Finbow        1999    M.Sc.     Parameters and Products of graphs.

  9. •Tania Wentzell          1999(with Dr J. Janssen) M.Sc.     The Channel assignment problem.

  10. •Shannon Fitzpatrick  1997(with Dr Hartnell) PhD.     Dynamic Domination in Graphs.

  11. •Stewart Neufeld        1990 MSc. Cop Numbers on Products of Graphs.

Honours 

  1. •Irina Hole                  2003    Algorithms for Pursuit Games

  2. •Keith Fordham          1997    Concept Analysis

  3. •Blair Conrad             1996    Graph Drawing Algorithms;

  4. •Matthew Moffat        1990    Isometric Embeddings of Graphs into Cartesian Products.

  5. •Jay Adamsson           1989    Enumeration of Ordered Sets.

  6. •Andrew Parker          1988    Pagenumbers for Ordered Sets;

  7. •William Lorimer       1985    Planarity Algorithms for Graphs;

  8. •Adele Fraser              1984    Graceful Graphs.