According to our database
1,
Richard J. Nowakowski
authored at least 96 papers
between 1979 and 2024.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2024
Diffusion: quiescence and perturbation.
Australas. J Comb., October, 2024
2023
The Complexity of Two Colouring Games.
Algorithmica, April, 2023
Disjunctive sums of quasi-nimbers.
Theor. Comput. Sci., February, 2023
Atomic weights and the combinatorial game of bipass.
Discret. Math., 2023
A complete solution for a nontrivial ruleset with entailing moves.
CoRR, 2023
Infinitely many absolute universes.
CoRR, 2023
2021
Bounding game temperature using confusion intervals.
Theor. Comput. Sci., 2021
Three-player nim with podium rule.
Int. J. Game Theory, 2021
On lattices from combinatorial game theory: infinite case.
Int. J. Game Theory, 2021
Cops and an Insightful Robber.
Discret. Appl. Math., 2021
Impartial games with entailing moves.
CoRR, 2021
Partizan Subtraction Games.
CoRR, 2021
2020
Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325].
Theor. Comput. Sci., 2020
Atomic Weight Calculus of Spindly Games.
Integers, 2020
Simultaneous Moves with Cops and an Insightful Robber.
CoRR, 2020
2019
The orthogonal colouring game.
Theor. Comput. Sci., 2019
Special Issue on Combinatorial Games.
J. Int. Comput. Games Assoc., 2019
Simplicial Complexes are Game Complexes.
Electron. J. Comb., 2019
2018
Game comparison through play.
Theor. Comput. Sci., 2018
Games with guaranteed scores and waiting moves.
Int. J. Game Theory, 2018
Wythoff partizan subtraction.
Int. J. Game Theory, 2018
Int. J. Game Theory, 2018
A Variation on Chip-Firing: the diffusion game.
Discret. Math. Theor. Comput. Sci., 2018
The Spread of Voting Attitudes in Social Networks.
CoRR, 2018
2016
Misère-play Hackenbush Sprigs.
Int. J. Game Theory, 2016
Well-covered triangulations: Part IV.
Discret. Appl. Math., 2016
A note on the Grundy number and graph products.
Discret. Appl. Math., 2016
Guaranteed Scoring Games.
Electron. J. Comb., 2016
2014
On lattices from combinatorial game theory modularity and a representation theorem: Finite case.
Theor. Comput. Sci., 2014
Elimination schemes and lattices.
Discret. Math., 2014
2013
Labeled packings of graphs.
Australas. J Comb., 2013
2012
polish - Let us play the cleaning game.
Theor. Comput. Sci., 2012
The Misère Monoid of One-Handed Alternating Games.
Integers, 2012
Outcomes of Partizan Euclid.
Integers, 2012
2011
Contributions Discret. Math., 2011
2010
Extensions and restrictions of Wythoff's game preserving its p positions.
J. Comb. Theory A, 2010
Edge critical cops and robber.
Discret. Math., 2010
Parallel cleaning of a network with brushes.
Discret. Appl. Math., 2010
On well-covered triangulations: Part III.
Discret. Appl. Math., 2010
2009
Clean the graph before you draw it!
Inf. Process. Lett., 2009
Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and Cycles.
Graphs Comb., 2009
Chip firing and all-terminal network reliability bounds.
Discret. Optim., 2009
On well-covered triangulations: Part II.
Discret. Appl. Math., 2009
Another bridge between Nim and Wythoff.
Australas. J Comb., 2009
Seepage in directed acyclic graphs.
Australas. J Comb., 2009
2008
Cleaning a network with brushes.
Theor. Comput. Sci., 2008
Small cycle double covers of products I: Lexicographic product with paths and cycles.
J. Graph Theory, 2008
The neighbourhood polynomial of a graph.
Australas. J Comb., 2008
2007
Research problems from the 5th Slovenian Conference (Bled, 2003).
Discret. Math., 2007
The structure of well-covered graphs with no cycles of length 4.
Discret. Math., 2007
The well-covered dimension of random graphs.
Discret. Math., 2007
Cleaning Random <i>d</i>-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.
Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, 2007
2006
Boundary-optimal Triangulation Flooding.
Int. J. Comput. Geom. Appl., 2006
Fractional isometric path number.
Australas. J Comb., 2006
2005
Well-Covered Vector Spaces of Graphs.
SIAM J. Discret. Math., 2005
Average independence polynomials.
J. Comb. Theory B, 2005
A Tandem version of the Cops and Robber Game played on products of graphs.
Discuss. Math. Graph Theory, 2005
2004
Periodicity and arithmetic-periodicity in hexadecimal games.
Theor. Comput. Sci., 2004
Preface: Algorithmic Combinatorial Game Theory.
Theor. Comput. Sci., 2004
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory.
Theor. Comput. Sci., 2004
The <i>k</i>-fractal of a simplicial complex.
Discret. Math., 2004
Distributive online channel assignment for hexagonal cellular networks with constraints.
Discret. Appl. Math., 2004
2003
Partitioning a graph into two isomorphic pieces.
J. Graph Theory, 2003
The independence fractal of a graph.
J. Comb. Theory B, 2003
On well-covered triangulations: Part I.
Discret. Appl. Math., 2003
2002
Panel: The impact of IT on accounting and auditing.
Proceedings of the 10th European Conference on Information Systems, 2002
2001
Ordered graceful labellings of the 2-star.
Discret. Math., 2001
Covering hypercubes by isometric paths.
Discret. Math., 2001
The ultimate categorical matching in a graph.
Discret. Math., 2001
Copnumber Of Graphs With Strong Isometric Dimension Two.
Ars Comb., 2001
Bounding the Roots of Independence Polynomials.
Ars Comb., 2001
2000
The strong isometric dimension of finite reflexive graphs.
Discuss. Math. Graph Theory, 2000
Cops, Robber, and Photo Radar.
Ars Comb., 2000
1998
A game of cops and robbers played on products of graphs.
Discret. Math., 1998
1996
2-D Shape Representation and Averaging Using Normalized Wavelet Descriptors.
Simul., 1996
The Ultimate Categorical Independence Ratio of a Graph.
SIAM J. Discret. Math., 1996
Associative graph products and their independence, domination and coloring numbers.
Discuss. Math. Graph Theory, 1996
1994
A characterization of well-covered graphs that contain neither 4- nor 5-cycles.
J. Graph Theory, 1994
1993
A Characterization of Well Covered Graphs of Girth 5 or Greater.
J. Comb. Theory B, 1993
Search ans Sweep Numbers of Finite Directed Acyclic Graphs.
Discret. Appl. Math., 1993
1990
Representing orders on the plane by translating points and lines.
Discret. Appl. Math., 1990
1988
The chromatic connectivity of graphs.
Graphs Comb., 1988
Retract rigid cartesian products of graphs.
Discret. Math., 1988
1987
Neighbor-connected graphs and projective planes.
Networks, 1987
Cutsets of Boolean lattices.
Discret. Math., 1987
1984
A Helly theorem for convexity in graphs.
Discret. Math., 1984
1983
Vertex-to-vertex pursuit in a graph.
Discret. Math., 1983
The smallest graph variety containing all paths.
Discret. Math., 1983
1982
On a class of isometric subgraphs of a graph.
Comb., 1982
1979
Fixed-edge theorem for graphs with loops.
J. Graph Theory, 1979
