Richard J. Nowakowski

From MaRDI portal
Person:215016

Available identifiers

zbMath Open nowakowski.richard-jWikidataQ102245936 ScholiaQ102245936MaRDI QIDQ215016

List of research outcomes

PublicationDate of PublicationType
A complete solution for the partisan chocolate game2023-10-20Paper
Indecomposable combinatorial games2023-06-12Paper
The complexity of two colouring games2023-04-11Paper
A complete solution for a nontrivial ruleset with entailing moves2023-04-02Paper
Infinitely many absolute universes2023-03-09Paper
Disjunctive sums of quasi-nimbers2023-02-01Paper
Atomic weights and the combinatorial game of \textsc{bipass}2022-11-23Paper
The game of flipping coins2022-10-14Paper
A note on numbers2022-10-14Paper
Ordinal sums, clockwise hackenbush, and domino shave2022-10-14Paper
Partizan subtraction games2022-10-14Paper
Recursive comparison tests for dicot and dead-ending games under misère play2022-10-14Paper
Impartial games with entailing moves2022-10-14Paper
https://portal.mardi4nfdi.de/entity/Q50886752022-07-13Paper
https://portal.mardi4nfdi.de/entity/Q33907112022-03-25Paper
A Note on Numbers2022-03-25Paper
Ordinal Sums, Clockwise Hackenbush, and Domino Shave2022-03-25Paper
Partizan Subtraction Games2022-03-25Paper
https://portal.mardi4nfdi.de/entity/Q33907312022-03-25Paper
Impartial games with entailing moves2022-03-25Paper
\AE quitas: Two-Player Counterfeit Coin Games2022-01-12Paper
Three-player \textsc{nim} with podium rule2021-09-24Paper
On lattices from combinatorial game theory: infinite case2021-09-24Paper
Cops and an insightful robber2021-04-01Paper
https://portal.mardi4nfdi.de/entity/Q51487092021-02-05Paper
Bounding game temperature using confusion intervals2021-01-25Paper
Complete Graphs and Polyominoes2020-10-13Paper
Corrigendum to: ``The orthogonal colouring game2020-10-12Paper
Counting Path Configurations in Parallel Diffusion2020-10-09Paper
https://portal.mardi4nfdi.de/entity/Q32956092020-07-10Paper
https://portal.mardi4nfdi.de/entity/Q32956112020-07-10Paper
https://portal.mardi4nfdi.de/entity/Q32956142020-07-10Paper
Games and Complexes I: Transformation via Ideals2020-07-10Paper
Games and Complexes II: Weight Games and Kruskal-Katona Type Bounds2020-07-10Paper
https://portal.mardi4nfdi.de/entity/Q32956262020-07-10Paper
Cheating Robot Games: A model for insider information2020-06-24Paper
Invertible Elements of the Misere Dicotic Universe2020-04-30Paper
Diffusion: Quiescence and Perturbation2020-03-23Paper
The orthogonal colouring game2019-10-18Paper
Simplicial complexes are game complexes2019-08-16Paper
https://portal.mardi4nfdi.de/entity/Q53842032019-06-21Paper
https://portal.mardi4nfdi.de/entity/Q46286412019-03-14Paper
Simultaneous Combinatorial Game Theory2018-10-05Paper
Wythoff partizan subtraction2018-10-04Paper
Games with guaranteed scores and waiting moves2018-10-04Paper
Progress on mis\`ere dead ends: game comparison, canonical form, and conjugate inverses2018-07-30Paper
Game comparison through play2018-05-15Paper
Misère-play Hackenbush sprigs2016-10-20Paper
Well-covered triangulations. IV2016-10-07Paper
Guaranteed scoring games2016-09-13Paper
When game comparison becomes play: Absolutely Categorical Game Theory2016-09-09Paper
Absolute Combinatorial Game Theory2016-06-06Paper
https://portal.mardi4nfdi.de/entity/Q27875872016-03-04Paper
https://portal.mardi4nfdi.de/entity/Q27875962016-03-04Paper
A note on the Grundy number and graph products2016-02-12Paper
Finding Golden Nuggets by Reduction2015-10-24Paper
https://portal.mardi4nfdi.de/entity/Q29491162015-10-07Paper
https://portal.mardi4nfdi.de/entity/Q29491222015-10-07Paper
https://portal.mardi4nfdi.de/entity/Q29491272015-10-07Paper
https://portal.mardi4nfdi.de/entity/Q29491362015-10-07Paper
https://portal.mardi4nfdi.de/entity/Q29491372015-10-07Paper
https://portal.mardi4nfdi.de/entity/Q55012162015-08-03Paper
When waiting moves you in scoring combinatorial games2015-05-07Paper
Elimination schemes and lattices2014-05-06Paper
On lattices from combinatorial game theory modularity and a representation theorem: finite case2014-03-13Paper
https://portal.mardi4nfdi.de/entity/Q28666092013-12-13Paper
\textsc{polish} -- Let us play the cleaning game2013-01-07Paper
Sketchy tweets: ten minute conjectures in graph theory2012-04-27Paper
Lattices of games2012-03-23Paper
Cleaning with brooms2012-01-24Paper
https://portal.mardi4nfdi.de/entity/Q30909342011-09-07Paper
https://portal.mardi4nfdi.de/entity/Q30134782011-07-18Paper
Edge critical cops and robber2010-10-11Paper
Clean the graph before you draw it!2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35741522010-07-09Paper
On well-covered triangulations. III2010-05-25Paper
Parallel cleaning of a network with brushes2010-05-05Paper
On well-covered triangulations. II.2010-04-28Paper
Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions2010-04-21Paper
The robot cleans up2010-02-24Paper
Small cycle double covers of products. II: Categorical and strong products with paths and cycles2009-12-09Paper
Chip firing and all-terminal network reliability bounds2009-11-23Paper
https://portal.mardi4nfdi.de/entity/Q36355082009-07-06Paper
https://portal.mardi4nfdi.de/entity/Q36140182009-03-16Paper
The Robot Cleans Up2009-01-27Paper
https://portal.mardi4nfdi.de/entity/Q55033432009-01-15Paper
Cleaning a network with brushes2008-06-24Paper
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm2008-04-15Paper
Small cycle double covers of products I: Lexicographic product with paths and cycles2008-02-13Paper
The structure of well-covered graphs with no cycles of length 42007-08-23Paper
https://portal.mardi4nfdi.de/entity/Q57545072007-08-22Paper
https://portal.mardi4nfdi.de/entity/Q34338762007-04-20Paper
The well-covered dimension of random graphs2007-02-13Paper
Research problems from the 5th Slovenian Conference (Bled, 2003)2007-02-13Paper
A Tandem version of the Cops and Robber Game played on products of graphs2006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54879222006-09-13Paper
Well-Covered Vector Spaces of Graphs2006-06-01Paper
BOUNDARY-OPTIMAL TRIANGULATION FLOODING2006-05-29Paper
https://portal.mardi4nfdi.de/entity/Q33775032006-03-23Paper
https://portal.mardi4nfdi.de/entity/Q33775182006-03-23Paper
https://portal.mardi4nfdi.de/entity/Q33775202006-03-23Paper
Algorithms and Computation2005-12-22Paper
Tandem-win graphs2005-10-10Paper
https://portal.mardi4nfdi.de/entity/Q27160052005-07-20Paper
https://portal.mardi4nfdi.de/entity/Q54608762005-07-20Paper
Average independence polynomials2005-03-08Paper
https://portal.mardi4nfdi.de/entity/Q48314952005-01-03Paper
Distributive online channel assignment for hexagonal cellular networks with constraints2004-11-23Paper
Periodicity and arithmetic-periodicity in hexadecimal games2004-10-27Paper
The \(k\)-fractal of a simplicial complex2004-08-19Paper
On the location of roots of independence polynomials2004-08-10Paper
On well-covered triangulations. I2003-12-04Paper
https://portal.mardi4nfdi.de/entity/Q44077142003-11-10Paper
Partitioning a graph into two isomorphic pieces2003-11-10Paper
The independence fractal of a graph.2003-08-25Paper
https://portal.mardi4nfdi.de/entity/Q48042762003-04-10Paper
https://portal.mardi4nfdi.de/entity/Q27704382003-03-06Paper
Roots of independence polynomials of well covered graphs2002-10-10Paper
Ordered graceful labellings of the 2-star2002-09-25Paper
https://portal.mardi4nfdi.de/entity/Q45522162002-08-29Paper
Dimension invariance of subdivisions2002-04-17Paper
https://portal.mardi4nfdi.de/entity/Q27443882002-03-11Paper
https://portal.mardi4nfdi.de/entity/Q44077202002-01-01Paper
The ultimate categorical matching in a graph2001-10-21Paper
The game of End-Nim2001-10-16Paper
Covering hypercubes by isometric paths2001-01-01Paper
The strong isometric dimension of finite reflexive graphs2000-12-20Paper
A game of cops and robbers played on products of graphs2000-11-02Paper
Monthly Unsolved Problems, 1969-19971998-05-26Paper
Associative graph products and their independence, domination and coloring numbers1997-06-29Paper
https://portal.mardi4nfdi.de/entity/Q31236701997-03-09Paper
The endomorphism spectrum of an ordered set1996-11-04Paper
The Ultimate Categorical Independence Ratio of a Graph1996-10-06Paper
https://portal.mardi4nfdi.de/entity/Q48818561996-07-14Paper
Monthly Unsolved Problems, 1969-19951996-05-09Paper
Coin-Weighing Problems1996-04-16Paper
Mousetrap1996-01-07Paper
https://portal.mardi4nfdi.de/entity/Q46975701995-10-05Paper
A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles1995-04-04Paper
Which Integers are Representable as the Product of the Sum of Three Integers with the Sum of their Reciprocals?1995-03-09Paper
https://portal.mardi4nfdi.de/entity/Q42846161994-08-28Paper
Lattices contained in planar orders are planar1993-05-16Paper
Search and sweep numbers of finite directed acyclic graphs1993-05-16Paper
A characterization of well covered graphs of girth 5 or greater1993-03-10Paper
https://portal.mardi4nfdi.de/entity/Q39730451992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39813461992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39720031992-06-25Paper
Representing orders on the plane by translating points and lines1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33563151990-01-01Paper
Ordered sets, pagenumbers and planarity1989-01-01Paper
Retract rigid Cartesian products of graphs1988-01-01Paper
The chromatic connectivity of graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37972341988-01-01Paper
Cutsets of Boolean lattices1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37641901987-01-01Paper
Neighbor-connected graphs and projective planes1987-01-01Paper
A Helly theorem for convexity in graphs1984-01-01Paper
Vertex-to-vertex pursuit in a graph1983-01-01Paper
The smallest graph variety containing all paths1983-01-01Paper
On a class of isometric subgraphs of a graph1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39505861981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39105511980-01-01Paper
Fixed-edge theorem for graphs with loops1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41964681978-01-01Paper
The Spectrum of a Finite Lattice: Breadth and Length Techniques1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40813071975-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Richard J. Nowakowski