2008 |
38 | EE | Margaret-Ellen Messinger,
Richard J. Nowakowski:
The Robot Cleans Up.
COCOA 2008: 309-318 |
37 | EE | Richard J. Nowakowski,
Karen Seyffarth:
Small cycle double covers of products I: Lexicographic product with paths and cycles.
Journal of Graph Theory 57(2): 99-123 (2008) |
36 | EE | Margaret-Ellen Messinger,
Richard J. Nowakowski,
Pawel Pralat:
Cleaning a network with brushes.
Theor. Comput. Sci. 399(3): 191-205 (2008) |
2007 |
35 | EE | Margaret-Ellen Messinger,
Pawel Pralat,
Richard J. Nowakowski,
Nicholas C. Wormald:
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.
CAAN 2007: 13-26 |
34 | EE | Jason I. Brown,
Richard J. Nowakowski,
Igor E. Zverovich:
The structure of well-covered graphs with no cycles of length 4.
Discrete Mathematics 307(17-18): 2235-2245 (2007) |
33 | EE | Jason I. Brown,
Richard J. Nowakowski:
The well-covered dimension of random graphs.
Discrete Mathematics 307(3-5): 352-355 (2007) |
32 | EE | Bojan Mohar,
Richard J. Nowakowski,
Douglas B. West:
Research problems from the 5th Slovenian Conference (Bled, 2003).
Discrete Mathematics 307(3-5): 650-658 (2007) |
2006 |
31 | EE | Richard J. Nowakowski,
Norbert Zeh:
Boundary-optimal Triangulation Flooding.
Int. J. Comput. Geometry Appl. 16(2-3): 271-290 (2006) |
2005 |
30 | EE | Nancy E. Clarke,
Richard J. Nowakowski:
Tandem-win graphs.
Discrete Mathematics 299(1-3): 56-64 (2005) |
29 | EE | Jason I. Brown,
Richard J. Nowakowski:
Average independence polynomials.
J. Comb. Theory, Ser. B 93(2): 313-318 (2005) |
28 | EE | Jason I. Brown,
Richard J. Nowakowski:
Well-Covered Vector Spaces of Graphs.
SIAM J. Discrete Math. 19(4): 952-965 (2005) |
2004 |
27 | EE | Richard J. Nowakowski,
Norbert Zeh:
Boundary-Optimal Triangulation Flooding.
ISAAC 2004: 717-728 |
26 | EE | Shannon L. Fitzpatrick,
Jeannette Janssen,
Richard J. Nowakowski:
Distributive online channel assignment for hexagonal cellular networks with constraints.
Discrete Applied Mathematics 143(1-3): 84-91 (2004) |
25 | EE | Jason I. Brown,
Carl A. Hickman,
Richard J. Nowakowski:
The k-fractal of a simplicial complex.
Discrete Mathematics 285(1-3): 33-45 (2004) |
24 | EE | Rudolf Fleischer,
Richard J. Nowakowski:
Preface: Algorithmic Combinatorial Game Theory.
Theor. Comput. Sci. 303(3): 313 (2004) |
23 | EE | S. Howse,
Richard J. Nowakowski:
Periodicity and arithmetic-periodicity in hexadecimal games.
Theor. Comput. Sci. 303(3): 463-472 (2004) |
22 | EE | 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.
Theor. Comput. Sci. 303(3): 539-543 (2004) |
2003 |
21 | EE | Art S. Finbow,
Bert Hartnell,
Richard J. Nowakowski,
Michael D. Plummer:
On well-covered triangulations: Part I.
Discrete Applied Mathematics 132(1-3): 97-108 (2003) |
20 | EE | Jason I. Brown,
Carl A. Hickman,
Richard J. Nowakowski:
The independence fractal of a graph.
J. Comb. Theory, Ser. B 87(2): 209-230 (2003) |
2002 |
19 | EE | 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.
ECIS 2002 |
2001 |
18 | | Jason I. Brown,
Richard J. Nowakowski:
Bounding the Roots of Independence Polynomials.
Ars Comb. 58: (2001) |
17 | | Shannon L. Fitzpatrick,
Richard J. Nowakowski:
Copnumber Of Graphs With Strong Isometric Dimension Two.
Ars Comb. 59: (2001) |
16 | EE | Michael H. Albert,
Derek A. Holton,
Richard J. Nowakowski:
The ultimate categorical matching in a graph.
Discrete Mathematics 232(1-3): 1-9 (2001) |
15 | EE | Richard J. Nowakowski,
C. A. Whitehead:
Ordered graceful labellings of the 2-star.
Discrete Mathematics 233(1-3): 183-191 (2001) |
14 | EE | Shannon L. Fitzpatrick,
Richard J. Nowakowski,
Derek A. Holton,
Ian Caines:
Covering hypercubes by isometric paths.
Discrete Mathematics 240(1-3): 253-260 (2001) |
13 | EE | Michael H. Albert,
Richard J. Nowakowski:
The Game of End-Nim.
Electr. J. Comb. 8(2): (2001) |
2000 |
12 | | Shannon L. Fitzpatrick,
Jeannette Janssen,
Richard J. Nowakowski:
Distributive Online Channel Assignment for Hexagonal Cellular Networks with Constraints.
ICALP Satellite Workshops 2000: 147-154 |
11 | | Nancy E. Clarke,
Richard J. Nowakowski:
Cops, Robber, and Photo Radar.
Ars Comb. 56: (2000) |
1996 |
10 | EE | Jason I. Brown,
Richard J. Nowakowski,
Douglas F. Rall:
The Ultimate Categorical Independence Ratio of a Graph.
SIAM J. Discrete Math. 9(2): 290-300 (1996) |
1993 |
9 | EE | Richard J. Nowakowski:
Search ans Sweep Numbers of Finite Directed Acyclic Graphs.
Discrete Applied Mathematics 41(1): 1-11 (1993) |
8 | EE | Art S. Finbow,
Bert Hartnell,
Richard J. Nowakowski:
A Characterization of Well Covered Graphs of Girth 5 or Greater.
J. Comb. Theory, Ser. B 57(1): 44-68 (1993) |
1990 |
7 | EE | Richard J. Nowakowski,
Ivan Rival,
Jorge Urrutia:
Representing orders on the plane by translating points and lines.
Discrete Applied Mathematics 27(1-2): 147-156 (1990) |
1988 |
6 | EE | Richard J. Nowakowski,
Ivan Rival:
Retract rigid cartesian products of graphs.
Discrete Mathematics 70(2): 169-184 (1988) |
1987 |
5 | EE | Richard J. Nowakowski:
Cutsets of Boolean lattices.
Discrete Mathematics 63(2-3): 231-240 (1987) |
1984 |
4 | EE | Robert E. Jamison,
Richard J. Nowakowski:
A Helly theorem for convexity in graphs.
Discrete Mathematics 51(1): 35-39 (1984) |
1983 |
3 | EE | Richard J. Nowakowski,
Ivan Rival:
The smallest graph variety containing all paths.
Discrete Mathematics 43(2-3): 223-234 (1983) |
2 | EE | Richard J. Nowakowski,
Peter Winkler:
Vertex-to-vertex pursuit in a graph.
Discrete Mathematics 43(2-3): 235-239 (1983) |
1982 |
1 | | Richard J. Nowakowski,
Ivan Rival:
On a class of isometric subgraphs of a graph.
Combinatorica 2(1): 79-90 (1982) |