default search action
Richard J. Nowakowski
Person information
- affiliation: Dalhousie University, Department of Mathematics and Statistics, Halifax, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j88]Todd Mullen, Richard J. Nowakowski, Danielle Cox:
Diffusion: quiescence and perturbation. Australas. J Comb. 90: 1-14 (2024) - 2023
- [j87]Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney
, Richard J. Nowakowski:
The Complexity of Two Colouring Games. Algorithmica 85(4): 1067-1090 (2023) - [j86]Urban Larsson
Atomic weights and the combinatorial game of bipass. Discret. Math. 346(2): 113229 (2023) - [j85]Alexandre M. Silva, Carlos Pereira dos Santos, João Pedro Neto
Disjunctive sums of quasi-nimbers. Theor. Comput. Sci. 945: 113665 (2023) - [i8]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos
Infinitely many absolute universes. CoRR abs/2303.05198 (2023) - [i7]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos
A complete solution for a nontrivial ruleset with entailing moves. CoRR abs/2304.00588 (2023) - 2021
- [j84]Melissa A. Huggan
Cops and an Insightful Robber. Discret. Appl. Math. 295: 112-119 (2021) - [j83]Richard J. Nowakowski, Carlos Pereira dos Santos, Alexandre M. Silva:
Three-player nim with podium rule. Int. J. Game Theory 50(3): 623-633 (2021) - [j82]Alda Carvalho
On lattices from combinatorial game theory: infinite case. Int. J. Game Theory 50(3): 655-670 (2021) - [j81]Svenja Huntemann, Richard J. Nowakowski
Bounding game temperature using confusion intervals. Theor. Comput. Sci. 855: 43-60 (2021) - [i6]Éric Duchêne, Marc Heinrich, Richard J. Nowakowski, Aline Parreau:
Partizan Subtraction Games. CoRR abs/2101.01595 (2021) - [i5]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos:
Impartial games with entailing moves. CoRR abs/2101.11699 (2021) - 2020
- [j80]Michael Fisher, Neil A. McKay, Richard J. Nowakowski, Paul Ottaway, Carlos Pereira dos Santos:
Atomic Weight Calculus of Spindly Games. Integers 20: G2 (2020) - [j79]Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney
Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325]. Theor. Comput. Sci. 842: 133-135 (2020) - [i4]Melissa A. Huggan, Richard J. Nowakowski:
Simultaneous Moves with Cops and an Insightful Robber. CoRR abs/2006.15379 (2020) - [i3]Urban Larsson, Richard J. Nowakowski:
Atomic weights and the combinatorial game of Bipass. CoRR abs/2007.03949 (2020)
2010 – 2019
- 2019
- [j78]Sara Faridi
Simplicial Complexes are Game Complexes. Electron. J. Comb. 26(3): 3 (2019) - [j77]Jos Uiterwijk, Richard J. Nowakowski:
Special Issue on Combinatorial Games. J. Int. Comput. Games Assoc. 41(3): 174-175 (2019) - [j76]Stephan Dominique Andres, Melissa A. Huggan, Fionn Mc Inerney
The orthogonal colouring game. Theor. Comput. Sci. 795: 312-325 (2019) - 2018
- [j75]Christopher Duffy
A Variation on Chip-Firing: the diffusion game. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j74]Michael Fisher, Richard J. Nowakowski, Carlos Pereira dos Santos:
Sterling stirling play. Int. J. Game Theory 47(2): 557-576 (2018) - [j73]Urban Larsson
Wythoff partizan subtraction. Int. J. Game Theory 47(2): 613-652 (2018) - [j72]Urban Larsson, Richard J. Nowakowski, Carlos Pereira dos Santos:
Games with guaranteed scores and waiting moves. Int. J. Game Theory 47(2): 653-671 (2018) - [j71]Melissa A. Huggan, Richard J. Nowakowski:
Thinning Thickets. Integers 18: G1 (2018) - [j70]Urban Larsson
Game comparison through play. Theor. Comput. Sci. 725: 52-63 (2018) - [i2]Jordan Barrett, Christopher Duffy, Richard J. Nowakowski:
The Spread of Voting Attitudes in Social Networks. CoRR abs/1812.02143 (2018) - 2016
- [j69]Urban Larsson, Richard J. Nowakowski, João Pedro Neto, Carlos Pereira dos Santos:
Guaranteed Scoring Games. Electron. J. Comb. 23(3): 3 (2016) - [j68]Nancy E. Clarke, Stephen Finbow, Shannon L. Fitzpatrick, Margaret-Ellen Messinger, Rebecca Milley, Richard J. Nowakowski:
A note on the Grundy number and graph products. Discret. Appl. Math. 202: 1-7 (2016) - [j67]Arthur S. Finbow
Well-covered triangulations: Part IV. Discret. Appl. Math. 215: 71-94 (2016) - [j66]Neil A. McKay, Rebecca Milley, Richard J. Nowakowski:
Misère-play Hackenbush Sprigs. Int. J. Game Theory 45(3): 731-742 (2016) - [i1]Christopher Duffy, Thomas F. Lidbetter, Margaret-Ellen Messinger, Richard J. Nowakowski:
A Variation on Chip-Firing: the diffusion game. CoRR abs/1609.05792 (2016) - 2014
- [j65]Margaret-Ellen Messinger, Richard J. Nowakowski
Elimination schemes and lattices. Discret. Math. 328: 63-70 (2014) - [j64]Alda Carvalho
On lattices from combinatorial game theory modularity and a representation theorem: Finite case. Theor. Comput. Sci. 527: 37-49 (2014) - 2013
- [j63]Éric Duchêne, Hamamache Kheddouci, Richard J. Nowakowski, Mohammed Amin Tahraoui:
Labeled packings of graphs. Australas. J Comb. 57: 109-126 (2013) - 2012
- [j62]Rebecca Milley, Richard J. Nowakowski, Paul Ottaway:
The Misère Monoid of One-Handed Alternating Games. Integers 12B: A1 (2012) - [j61]Neil A. McKay, Richard J. Nowakowski:
Outcomes of Partizan Euclid. Integers 12B: A9 (2012) - [j60]Michael Henry Albert, Richard J. Nowakowski
Lattices of Games. Order 29(1): 75-84 (2012) - [j59]Przemyslaw Gordinowicz
polish - Let us play the cleaning game. Theor. Comput. Sci. 463: 123-132 (2012) - 2011
- [j58]Richard J. Nowakowski, Paul Ottaway:
Option-closed games. Contributions Discret. Math. 6(1) (2011) - [j57]Margaret-Ellen Messinger, Richard J. Nowakowski
Cleaning with Brooms. Graphs Comb. 27(2): 251-267 (2011) - 2010
- [j56]Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski
Parallel cleaning of a network with brushes. Discret. Appl. Math. 158(5): 467-478 (2010) - [j55]Arthur S. Finbow
On well-covered triangulations: Part III. Discret. Appl. Math. 158(8): 894-912 (2010) - [j54]Nancy E. Clarke, Shannon L. Fitzpatrick, A. Hill, Richard J. Nowakowski
Edge critical cops and robber. Discret. Math. 310(17-18): 2299-2309 (2010) - [j53]Éric Duchêne, Aviezri S. Fraenkel, Richard J. Nowakowski
Extensions and restrictions of Wythoff's game preserving its p positions. J. Comb. Theory A 117(5): 545-567 (2010)
2000 – 2009
- 2009
- [j52]Nancy E. Clarke, Stephen Finbow, Shannon L. Fitzpatrick, Margaret-Ellen Messinger, Richard J. Nowakowski:
Seepage in directed acyclic graphs. Australas. J Comb. 43: 91-102 (2009) - [j51]Éric Duchêne, Aviezri S. Fraenkel, Sylvain Gravier, Richard J. Nowakowski:
Another bridge between Nim and Wythoff. Australas. J Comb. 44: 43-56 (2009) - [j50]Art S. Finbow
On well-covered triangulations: Part II. Discret. Appl. Math. 157(13): 2799-2817 (2009) - [j49]Jason I. Brown
Chip firing and all-terminal network reliability bounds. Discret. Optim. 6(4): 436-445 (2009) - [j48]Richard J. Nowakowski
Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and Cycles. Graphs Comb. 25(3): 385-400 (2009) - [j47]Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski
Clean the graph before you draw it! Inf. Process. Lett. 109(10): 463-467 (2009) - [j46]Margaret-Ellen Messinger, Richard J. Nowakowski
The robot cleans up. J. Comb. Optim. 18(4): 350-361 (2009) - 2008
- [j45]Jason I. Brown, Richard J. Nowakowski:
The neighbourhood polynomial of a graph. Australas. J Comb. 42: 55-68 (2008) - [j44]Richard J. Nowakowski
Small cycle double covers of products I: Lexicographic product with paths and cycles. J. Graph Theory 57(2): 99-123 (2008) - [j43]Margaret-Ellen Messinger, Richard J. Nowakowski
Cleaning a network with brushes. Theor. Comput. Sci. 399(3): 191-205 (2008) - [c5]Margaret-Ellen Messinger, Richard J. Nowakowski
The Robot Cleans Up. COCOA 2008: 309-318 - 2007
- [j42]Jason I. Brown
The well-covered dimension of random graphs. Discret. Math. 307(3-5): 352-355 (2007) - [j41]Bojan Mohar, Richard J. Nowakowski
Research problems from the 5th Slovenian Conference (Bled, 2003). Discret. Math. 307(3-5): 650-658 (2007) - [j40]Jason I. Brown
The structure of well-covered graphs with no cycles of length 4. Discret. Math. 307(17-18): 2235-2245 (2007) - [c4]Margaret-Ellen Messinger, Pawel Pralat, Richard J. Nowakowski
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm. CAAN 2007: 13-26 - 2006
- [j39]Shannon L. Fitzpatrick, Jeannette C. M. Janssen, Richard J. Nowakowski:
Fractional isometric path number. Australas. J Comb. 34: 281-298 (2006) - [j38]Richard J. Nowakowski
Boundary-optimal Triangulation Flooding. Int. J. Comput. Geom. Appl. 16(2-3): 271-290 (2006) - 2005
- [j37]Nancy E. Clarke, Richard J. Nowakowski
Tandem-win graphs. Discret. Math. 299(1-3): 56-64 (2005) - [j36]Nancy E. Clarke, Richard J. Nowakowski
A Tandem version of the Cops and Robber Game played on products of graphs. Discuss. Math. Graph Theory 25(3): 241-249 (2005) - [j35]Jason I. Brown
Average independence polynomials. J. Comb. Theory B 93(2): 313-318 (2005) - [j34]Jason I. Brown
Well-Covered Vector Spaces of Graphs. SIAM J. Discret. Math. 19(4): 952-965 (2005) - 2004
- [j33]Shannon L. Fitzpatrick, Jeannette C. M. Janssen
Distributive online channel assignment for hexagonal cellular networks with constraints. Discret. Appl. Math. 143(1-3): 84-91 (2004) - [j32]Jason I. Brown
The k-fractal of a simplicial complex. Discret. Math. 285(1-3): 33-45 (2004) - [j31]Rudolf Fleischer, Richard J. Nowakowski
Preface: Algorithmic Combinatorial Game Theory. Theor. Comput. Sci. 313(3): 313 (2004) - [j30]S. Howse, Richard J. Nowakowski
Periodicity and arithmetic-periodicity in hexadecimal games. Theor. Comput. Sci. 313(3): 463-472 (2004) - [j29]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. 313(3): 539-543 (2004) - [c3]Richard J. Nowakowski
Boundary-Optimal Triangulation Flooding. ISAAC 2004: 717-728 - 2003
- [j28]Art S. Finbow
On well-covered triangulations: Part I. Discret. Appl. Math. 132(1-3): 97-108 (2003) - [j27]Jason I. Brown
The independence fractal of a graph. J. Comb. Theory B 87(2): 209-230 (2003) - [j26]Anthony Bonato, Richard J. Nowakowski
Partitioning a graph into two isomorphic pieces. J. Graph Theory 44(1): 1-14 (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
- [j25]Jason I. Brown, Richard J. Nowakowski:
Bounding the Roots of Independence Polynomials. Ars Comb. 58 (2001) - [j24]Shannon L. Fitzpatrick, Richard J. Nowakowski:
Copnumber Of Graphs With Strong Isometric Dimension Two. Ars Comb. 59 (2001) - [j23]Michael H. Albert, Richard J. Nowakowski:
The Game of End-Nim. Electron. J. Comb. 8(2) (2001) - [j22]Michael H. Albert, Derek A. Holton, Richard J. Nowakowski
The ultimate categorical matching in a graph. Discret. Math. 232(1-3): 1-9 (2001) - [j21]Richard J. Nowakowski
Ordered graceful labellings of the 2-star. Discret. Math. 233(1-3): 183-191 (2001) - [j20]Shannon L. Fitzpatrick, Richard J. Nowakowski
Covering hypercubes by isometric paths. Discret. Math. 240(1-3): 253-260 (2001) - 2000
- [j19]Nancy E. Clarke, Richard J. Nowakowski:
Cops, Robber, and Photo Radar. Ars Comb. 56 (2000) - [j18]Shannon L. Fitzpatrick, Richard J. Nowakowski
The strong isometric dimension of finite reflexive graphs. Discuss. Math. Graph Theory 20(1): 23-38 (2000) - [c1]Shannon L. Fitzpatrick, Jeannette C. M. Janssen, Richard J. Nowakowski:
Distributive Online Channel Assignment for Hexagonal Cellular Networks with Constraints. ICALP Satellite Workshops 2000: 147-154
1990 – 1999
- 1998
- [j17]S. Neufeld, Richard J. Nowakowski
A game of cops and robbers played on products of graphs. Discret. Math. 186(1-3): 253-268 (1998) - 1996
- [j16]Richard J. Nowakowski
Associative graph products and their independence, domination and coloring numbers. Discuss. Math. Graph Theory 16(1): 53-79 (1996) - [j15]Jason I. Brown
The Ultimate Categorical Independence Ratio of a Graph. SIAM J. Discret. Math. 9(2): 290-300 (1996) - [j14]Ramanujan S. Kashi, Pratima Bhoj-Kavde, Richard J. Nowakowski, Thomas V. Papathomas:
2-D Shape Representation and Averaging Using Normalized Wavelet Descriptors. Simul. 66(3): 164-178 (1996) - 1994
- [j13]Art Stephen Finbow
A characterization of well-covered graphs that contain neither 4- nor 5-cycles. J. Graph Theory 18(7): 713-721 (1994) - 1993
- [j12]Richard J. Nowakowski
Search ans Sweep Numbers of Finite Directed Acyclic Graphs. Discret. Appl. Math. 41(1): 1-11 (1993) - [j11]Art S. Finbow
A Characterization of Well Covered Graphs of Girth 5 or Greater. J. Comb. Theory B 57(1): 44-68 (1993) - 1990
- [j10]Richard J. Nowakowski
Representing orders on the plane by translating points and lines. Discret. Appl. Math. 27(1-2): 147-156 (1990)
1980 – 1989
- 1988
- [j9]Richard J. Nowakowski
Retract rigid cartesian products of graphs. Discret. Math. 70(2): 169-184 (1988) - [j8]Chris D. Godsil
The chromatic connectivity of graphs. Graphs Comb. 4(1): 229-233 (1988) - 1987
- [j7]Richard J. Nowakowski
Cutsets of Boolean lattices. Discret. Math. 63(2-3): 231-240 (1987) - [j6]Georg Gunther, Bert L. Hartnell, Richard J. Nowakowski
Neighbor-connected graphs and projective planes. Networks 17(2): 241-247 (1987) - 1984
- [j5]Robert E. Jamison, Richard J. Nowakowski
A Helly theorem for convexity in graphs. Discret. Math. 51(1): 35-39 (1984) - 1983
- [j4]Richard J. Nowakowski
The smallest graph variety containing all paths. Discret. Math. 43(2-3): 223-234 (1983) - [j3]Richard J. Nowakowski
Vertex-to-vertex pursuit in a graph. Discret. Math. 43(2-3): 235-239 (1983) - 1982
- [j2]Richard J. Nowakowski
On a class of isometric subgraphs of a graph. Comb. 2(1): 79-90 (1982)
1970 – 1979
- 1979
- [j1]Richard J. Nowakowski
Fixed-edge theorem for graphs with loops. J. Graph Theory 3(4): 339-350 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: