| 2012 | ||
|---|---|---|
| j52 | ||
| j51 | Przemyslaw Gordinowicz, Richard J. Nowakowski, Pawel Pralat: polish - Let us play the cleaning game. Theor. Comput. Sci. 463: 123-132 (2012) | |
| 2011 | ||
| j50 | Richard J. Nowakowski, Paul Ottaway: Option-closed games. Contributions to Discrete Mathematics 6(1) (2011) | |
| j49 | Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat: Cleaning with Brooms. Graphs and Combinatorics 27(2): 251-267 (2011) | |
| 2010 | ||
| j48 | Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat: Parallel cleaning of a network with brushes. Discrete Applied Mathematics 158(5): 467-478 (2010) | |
| j47 | Arthur S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer: On well-covered triangulations: Part III. Discrete Applied Mathematics 158(8): 894-912 (2010) | |
| j46 | Nancy E. Clarke, Shannon L. Fitzpatrick, A. Hill, Richard J. Nowakowski: Edge critical cops and robber. Discrete Mathematics 310(17-18): 2299-2309 (2010) | |
| j45 | Éric Duchêne, Aviezri S. Fraenkel, Richard J. Nowakowski, Michel Rigo: Extensions and restrictions of Wythoff's game preserving its p positions. J. Comb. Theory, Ser. A 117(5): 545-567 (2010) | |
| 2009 | ||
| j44 | Art S. Finbow, Bert Hartnell, Richard J. Nowakowski, Michael D. Plummer: On well-covered triangulations: Part II. Discrete Applied Mathematics 157(13): 2799-2817 (2009) | |
| j43 | Jason I. Brown, Charles J. Colbourn, Richard J. Nowakowski: Chip firing and all-terminal network reliability bounds. Discrete Optimization 6(4): 436-445 (2009) | |
| j42 | Richard J. Nowakowski, Karen Seyffarth: Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and Cycles. Graphs and Combinatorics 25(3): 385-400 (2009) | |
| j41 | Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat: Clean the graph before you draw it! Inf. Process. Lett. 109(10): 463-467 (2009) | |
| j40 | Margaret-Ellen Messinger, Richard J. Nowakowski: The robot cleans up. J. Comb. Optim. 18(4): 350-361 (2009) | |
| 2008 | ||
| j39 | 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) | |
| j38 | Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat: Cleaning a network with brushes. Theor. Comput. Sci. 399(3): 191-205 (2008) | |
| c5 | ||
| 2007 | ||
| j37 | Jason I. Brown, Richard J. Nowakowski: The well-covered dimension of random graphs. Discrete Mathematics 307(3-5): 352-355 (2007) | |
| j36 | 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) | |
| j35 | 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) | |
| c4 | 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 | |
| 2006 | ||
| j34 | Richard J. Nowakowski, Norbert Zeh: Boundary-optimal Triangulation Flooding. Int. J. Comput. Geometry Appl. 16(2-3): 271-290 (2006) | |
| 2005 | ||
| j33 | Nancy E. Clarke, Richard J. Nowakowski: Tandem-win graphs. Discrete Mathematics 299(1-3): 56-64 (2005) | |
| j32 | Nancy E. Clarke, Richard J. Nowakowski: A Tandem version of the Cops and Robber Game played on products of graphs. Discussiones Mathematicae Graph Theory 25(3): 241-249 (2005) | |
| j31 | Jason I. Brown, Richard J. Nowakowski: Average independence polynomials. J. Comb. Theory, Ser. B 93(2): 313-318 (2005) | |
| j30 | Jason I. Brown, Richard J. Nowakowski: Well-Covered Vector Spaces of Graphs. SIAM J. Discrete Math. 19(4): 952-965 (2005) | |
| 2004 | ||
| j29 | 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) | |
| j28 | Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski: The k-fractal of a simplicial complex. Discrete Mathematics 285(1-3): 33-45 (2004) | |
| j27 | Rudolf Fleischer, Richard J. Nowakowski: Preface: Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 303(3): 313 (2004) | |
| j26 | S. Howse, Richard J. Nowakowski: Periodicity and arithmetic-periodicity in hexadecimal games. Theor. Comput. Sci. 303(3): 463-472 (2004) | |
| j25 | 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) | |
| c3 | ||
| 2003 | ||
| j24 | 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) | |
| j23 | 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 | ||
| c2 | 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: 1097-1100 | |
| 2001 | ||
| j22 | Jason I. Brown, Richard J. Nowakowski: Bounding the Roots of Independence Polynomials. Ars Comb. 58 (2001) | |
| j21 | Shannon L. Fitzpatrick, Richard J. Nowakowski: Copnumber Of Graphs With Strong Isometric Dimension Two. Ars Comb. 59 (2001) | |
| j20 | ||
| j19 | Michael H. Albert, Derek A. Holton, Richard J. Nowakowski: The ultimate categorical matching in a graph. Discrete Mathematics 232(1-3): 1-9 (2001) | |
| j18 | Richard J. Nowakowski, C. A. Whitehead: Ordered graceful labellings of the 2-star. Discrete Mathematics 233(1-3): 183-191 (2001) | |
| j17 | Shannon L. Fitzpatrick, Richard J. Nowakowski, Derek A. Holton, Ian Caines: Covering hypercubes by isometric paths. Discrete Mathematics 240(1-3): 253-260 (2001) | |
| 2000 | ||
| j16 | ||
| j15 | Shannon L. Fitzpatrick, Richard J. Nowakowski: The strong isometric dimension of finite reflexive graphs. Discussiones Mathematicae Graph Theory 20(1): 23-38 (2000) | |
| c1 | Shannon L. Fitzpatrick, Jeannette Janssen, Richard J. Nowakowski: Distributive Online Channel Assignment for Hexagonal Cellular Networks with Constraints. ICALP Satellite Workshops 2000: 147-154 | |
| 1996 | ||
| j14 | Richard J. Nowakowski, Douglas F. Rall: Associative graph products and their independence, domination and coloring numbers. Discussiones Mathematicae Graph Theory 16(1): 53-79 (1996) | |
| j13 | 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) | |
| 1994 | ||
| j12 | Art Stephen Finbow, Bert Hartnell, Richard J. Nowakowski: A characterization of well-covered graphs that contain neither 4- nor 5-cycles. Journal of Graph Theory 18(7): 713-721 (1994) | |
| 1993 | ||
| j11 | Richard J. Nowakowski: Search ans Sweep Numbers of Finite Directed Acyclic Graphs. Discrete Applied Mathematics 41(1): 1-11 (1993) | |
| j10 | 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 | ||
| j9 | 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 | ||
| j8 | Richard J. Nowakowski, Ivan Rival: Retract rigid cartesian products of graphs. Discrete Mathematics 70(2): 169-184 (1988) | |
| j7 | C. D. Godsil, Richard J. Nowakowski, Jaroslav Nesetril: The chromatic connectivity of graphs. Graphs and Combinatorics 4(1): 229-233 (1988) | |
| 1987 | ||
| j6 | ||
| j5 | Georg Gunther, Bert Hartnell, Richard J. Nowakowski: Neighbor-connected graphs and projective planes. Networks 17(2): 241-247 (1987) | |
| 1984 | ||
| j4 | Robert E. Jamison, Richard J. Nowakowski: A Helly theorem for convexity in graphs. Discrete Mathematics 51(1): 35-39 (1984) | |
| 1983 | ||
| j3 | Richard J. Nowakowski, Ivan Rival: The smallest graph variety containing all paths. Discrete Mathematics 43(2-3): 223-234 (1983) | |
| j2 | Richard J. Nowakowski, Peter Winkler: Vertex-to-vertex pursuit in a graph. Discrete Mathematics 43(2-3): 235-239 (1983) | |
| 1982 | ||
| j1 | Richard J. Nowakowski, Ivan Rival: On a class of isometric subgraphs of a graph. Combinatorica 2(1): 79-90 (1982) | |
| 1 | Michael H. Albert (Michael Henry Albert) | |
| 2 | Barbro Back | |
| 3 | Jason I. Brown | |
| 4 | Ian Caines | |
| 5 | Nancy E. Clarke | |
| 6 | Charles J. Colbourn | |
| 7 | Erik D. Demaine | |
| 8 | Éric Duchêne | |
| 9 | Art S. Finbow (Arthur S. Finbow, Art Stephen Finbow) | |
| 10 | Shannon L. Fitzpatrick | |
| 11 | Rudolf Fleischer | |
| 12 | Aviezri S. Fraenkel | |
| 13 | Serge Gaspers | |
| 14 | Chris D. Godsil (C. D. Godsil) | |
| 15 | Przemyslaw Gordinowicz | |
| 16 | Georg Gunther | |
| 17 | Bert Hartnell | |
| 18 | Carl A. Hickman | |
| 19 | A. Hill | |
| 20 | Derek A. Holton | |
| 21 | S. Howse | |
| 22 | Robert E. Jamison | |
| 23 | Jeannette C. M. Janssen (Jeannette Janssen) | |
| 24 | Eija Koskivaara | |
| 25 | Margaret-Ellen Messinger | |
| 26 | Bojan Mohar | |
| 27 | Christian D. Müller (Christian D. Mueller) | |
| 28 | Jaroslav Nesetril (Jarik Nesetril) | |
| 29 | Daniel E. O'Leary | |
| 30 | Paul Ottaway | |
| 31 | Michael D. Plummer | |
| 32 | Pawel Pralat | |
| 33 | Douglas F. Rall | |
| 34 | Michel Rigo | |
| 35 | Ivan Rival | |
| 36 | Karen Seyffarth | |
| 37 | Marinos Themistocleous | |
| 38 | Jorge Urrutia | |
| 39 | Douglas B. West | |
| 40 | C. A. Whitehead | |
| 41 | Peter Winkler (Peter M. Winkler) | |
| 42 | Nicholas C. Wormald | |
| 43 | Norbert Zeh | |
| 44 | Igor E. Zverovich |
Colors in the list of coauthors
Last update Sun May 19 12:24:44 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page