Publication | Date of Publication | Type |
---|
A complete solution for the partisan chocolate game | 2023-10-20 | Paper |
Indecomposable combinatorial games | 2023-06-12 | Paper |
The complexity of two colouring games | 2023-04-11 | Paper |
A complete solution for a nontrivial ruleset with entailing moves | 2023-04-02 | Paper |
Infinitely many absolute universes | 2023-03-09 | Paper |
Disjunctive sums of quasi-nimbers | 2023-02-01 | Paper |
Atomic weights and the combinatorial game of \textsc{bipass} | 2022-11-23 | Paper |
The game of flipping coins | 2022-10-14 | Paper |
A note on numbers | 2022-10-14 | Paper |
Ordinal sums, clockwise hackenbush, and domino shave | 2022-10-14 | Paper |
Partizan subtraction games | 2022-10-14 | Paper |
Recursive comparison tests for dicot and dead-ending games under misère play | 2022-10-14 | Paper |
Impartial games with entailing moves | 2022-10-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q5088675 | 2022-07-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q3390711 | 2022-03-25 | Paper |
A Note on Numbers | 2022-03-25 | Paper |
Ordinal Sums, Clockwise Hackenbush, and Domino Shave | 2022-03-25 | Paper |
Partizan Subtraction Games | 2022-03-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q3390731 | 2022-03-25 | Paper |
Impartial games with entailing moves | 2022-03-25 | Paper |
\AE quitas: Two-Player Counterfeit Coin Games | 2022-01-12 | Paper |
Three-player \textsc{nim} with podium rule | 2021-09-24 | Paper |
On lattices from combinatorial game theory: infinite case | 2021-09-24 | Paper |
Cops and an insightful robber | 2021-04-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5148709 | 2021-02-05 | Paper |
Bounding game temperature using confusion intervals | 2021-01-25 | Paper |
Complete Graphs and Polyominoes | 2020-10-13 | Paper |
Corrigendum to: ``The orthogonal colouring game | 2020-10-12 | Paper |
Counting Path Configurations in Parallel Diffusion | 2020-10-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q3295609 | 2020-07-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q3295611 | 2020-07-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q3295614 | 2020-07-10 | Paper |
Games and Complexes I: Transformation via Ideals | 2020-07-10 | Paper |
Games and Complexes II: Weight Games and Kruskal-Katona Type Bounds | 2020-07-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q3295626 | 2020-07-10 | Paper |
Cheating Robot Games: A model for insider information | 2020-06-24 | Paper |
Invertible Elements of the Misere Dicotic Universe | 2020-04-30 | Paper |
Diffusion: Quiescence and Perturbation | 2020-03-23 | Paper |
The orthogonal colouring game | 2019-10-18 | Paper |
Simplicial complexes are game complexes | 2019-08-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q5384203 | 2019-06-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4628641 | 2019-03-14 | Paper |
Simultaneous Combinatorial Game Theory | 2018-10-05 | Paper |
Wythoff partizan subtraction | 2018-10-04 | Paper |
Games with guaranteed scores and waiting moves | 2018-10-04 | Paper |
Progress on mis\`ere dead ends: game comparison, canonical form, and conjugate inverses | 2018-07-30 | Paper |
Game comparison through play | 2018-05-15 | Paper |
Misère-play Hackenbush sprigs | 2016-10-20 | Paper |
Well-covered triangulations. IV | 2016-10-07 | Paper |
Guaranteed scoring games | 2016-09-13 | Paper |
When game comparison becomes play: Absolutely Categorical Game Theory | 2016-09-09 | Paper |
Absolute Combinatorial Game Theory | 2016-06-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q2787587 | 2016-03-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q2787596 | 2016-03-04 | Paper |
A note on the Grundy number and graph products | 2016-02-12 | Paper |
Finding Golden Nuggets by Reduction | 2015-10-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q2949116 | 2015-10-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q2949122 | 2015-10-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q2949127 | 2015-10-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q2949136 | 2015-10-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q2949137 | 2015-10-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q5501216 | 2015-08-03 | Paper |
When waiting moves you in scoring combinatorial games | 2015-05-07 | Paper |
Elimination schemes and lattices | 2014-05-06 | Paper |
On lattices from combinatorial game theory modularity and a representation theorem: finite case | 2014-03-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q2866609 | 2013-12-13 | Paper |
\textsc{polish} -- Let us play the cleaning game | 2013-01-07 | Paper |
Sketchy tweets: ten minute conjectures in graph theory | 2012-04-27 | Paper |
Lattices of games | 2012-03-23 | Paper |
Cleaning with brooms | 2012-01-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q3090934 | 2011-09-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q3013478 | 2011-07-18 | Paper |
Edge critical cops and robber | 2010-10-11 | Paper |
Clean the graph before you draw it! | 2010-08-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q3574152 | 2010-07-09 | Paper |
On well-covered triangulations. III | 2010-05-25 | Paper |
Parallel cleaning of a network with brushes | 2010-05-05 | Paper |
On well-covered triangulations. II. | 2010-04-28 | Paper |
Extensions and restrictions of Wythoff's game preserving its \(\mathcal P\) positions | 2010-04-21 | Paper |
The robot cleans up | 2010-02-24 | Paper |
Small cycle double covers of products. II: Categorical and strong products with paths and cycles | 2009-12-09 | Paper |
Chip firing and all-terminal network reliability bounds | 2009-11-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q3635508 | 2009-07-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q3614018 | 2009-03-16 | Paper |
The Robot Cleans Up | 2009-01-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q5503343 | 2009-01-15 | Paper |
Cleaning a network with brushes | 2008-06-24 | Paper |
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm | 2008-04-15 | Paper |
Small cycle double covers of products I: Lexicographic product with paths and cycles | 2008-02-13 | Paper |
The structure of well-covered graphs with no cycles of length 4 | 2007-08-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q5754507 | 2007-08-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q3433876 | 2007-04-20 | Paper |
The well-covered dimension of random graphs | 2007-02-13 | Paper |
Research problems from the 5th Slovenian Conference (Bled, 2003) | 2007-02-13 | Paper |
A Tandem version of the Cops and Robber Game played on products of graphs | 2006-10-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q5487922 | 2006-09-13 | Paper |
Well-Covered Vector Spaces of Graphs | 2006-06-01 | Paper |
BOUNDARY-OPTIMAL TRIANGULATION FLOODING | 2006-05-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q3377503 | 2006-03-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q3377518 | 2006-03-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q3377520 | 2006-03-23 | Paper |
Algorithms and Computation | 2005-12-22 | Paper |
Tandem-win graphs | 2005-10-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q2716005 | 2005-07-20 | Paper |
https://portal.mardi4nfdi.de/entity/Q5460876 | 2005-07-20 | Paper |
Average independence polynomials | 2005-03-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q4831495 | 2005-01-03 | Paper |
Distributive online channel assignment for hexagonal cellular networks with constraints | 2004-11-23 | Paper |
Periodicity and arithmetic-periodicity in hexadecimal games | 2004-10-27 | Paper |
The \(k\)-fractal of a simplicial complex | 2004-08-19 | Paper |
On the location of roots of independence polynomials | 2004-08-10 | Paper |
On well-covered triangulations. I | 2003-12-04 | Paper |
https://portal.mardi4nfdi.de/entity/Q4407714 | 2003-11-10 | Paper |
Partitioning a graph into two isomorphic pieces | 2003-11-10 | Paper |
The independence fractal of a graph. | 2003-08-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4804276 | 2003-04-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q2770438 | 2003-03-06 | Paper |
Roots of independence polynomials of well covered graphs | 2002-10-10 | Paper |
Ordered graceful labellings of the 2-star | 2002-09-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4552216 | 2002-08-29 | Paper |
Dimension invariance of subdivisions | 2002-04-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q2744388 | 2002-03-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4407720 | 2002-01-01 | Paper |
The ultimate categorical matching in a graph | 2001-10-21 | Paper |
The game of End-Nim | 2001-10-16 | Paper |
Covering hypercubes by isometric paths | 2001-01-01 | Paper |
The strong isometric dimension of finite reflexive graphs | 2000-12-20 | Paper |
A game of cops and robbers played on products of graphs | 2000-11-02 | Paper |
Monthly Unsolved Problems, 1969-1997 | 1998-05-26 | Paper |
Associative graph products and their independence, domination and coloring numbers | 1997-06-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q3123670 | 1997-03-09 | Paper |
The endomorphism spectrum of an ordered set | 1996-11-04 | Paper |
The Ultimate Categorical Independence Ratio of a Graph | 1996-10-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4881856 | 1996-07-14 | Paper |
Monthly Unsolved Problems, 1969-1995 | 1996-05-09 | Paper |
Coin-Weighing Problems | 1996-04-16 | Paper |
Mousetrap | 1996-01-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4697570 | 1995-10-05 | Paper |
A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles | 1995-04-04 | Paper |
Which Integers are Representable as the Product of the Sum of Three Integers with the Sum of their Reciprocals? | 1995-03-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q4284616 | 1994-08-28 | Paper |
Lattices contained in planar orders are planar | 1993-05-16 | Paper |
Search and sweep numbers of finite directed acyclic graphs | 1993-05-16 | Paper |
A characterization of well covered graphs of girth 5 or greater | 1993-03-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q3973045 | 1992-06-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3981346 | 1992-06-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3972003 | 1992-06-25 | Paper |
Representing orders on the plane by translating points and lines | 1990-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3356315 | 1990-01-01 | Paper |
Ordered sets, pagenumbers and planarity | 1989-01-01 | Paper |
Retract rigid Cartesian products of graphs | 1988-01-01 | Paper |
The chromatic connectivity of graphs | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3797234 | 1988-01-01 | Paper |
Cutsets of Boolean lattices | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3764190 | 1987-01-01 | Paper |
Neighbor-connected graphs and projective planes | 1987-01-01 | Paper |
A Helly theorem for convexity in graphs | 1984-01-01 | Paper |
Vertex-to-vertex pursuit in a graph | 1983-01-01 | Paper |
The smallest graph variety containing all paths | 1983-01-01 | Paper |
On a class of isometric subgraphs of a graph | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3950586 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3910551 | 1980-01-01 | Paper |
Fixed-edge theorem for graphs with loops | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4196468 | 1978-01-01 | Paper |
The Spectrum of a Finite Lattice: Breadth and Length Techniques | 1977-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4081307 | 1975-01-01 | Paper |