On the public citation graph
Combinatorial Game Theory Foundations Applied to Digraph Kernels
0 signed · 46 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcom.1995.1022openalex-snapshot
Complexities of Winning Strategies in Diophantine Games
inferredcites →https://doi.org/10.1006/jctb.1995.1011openalex-snapshot
The List Chromatic Index of a Bipartite Multigraph
inferredcites →https://doi.org/10.1007/bf00383202openalex-snapshot
Tarski's Fixpoint Lemma and combinatorial games
inferredcites →https://doi.org/10.1007/bf01448847openalex-snapshot
Zur Theorie der Gesellschaftsspiele
inferredcites →https://doi.org/10.1016/0012-365x(90)90008-6openalex-snapshot
Integral lexicographic codes
inferredcites →https://doi.org/10.1016/0020-0190(94)00072-7openalex-snapshot
Enumerating the kernels of a directed graph with no odd circuits
inferredcites →https://doi.org/10.1016/0097-3165(86)90058-0openalex-snapshot
The generalized Sprague-Grundy function and its invariance under certain mappings
inferredcites →https://doi.org/10.1016/0166-218x(81)90003-2openalex-snapshot
Planar kernel and grundy with d≤3, dout≤2, din≤2 are NP-complete
inferredcites →https://doi.org/10.1016/0304-3975(82)90125-6openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1016/0890-5401(92)90048-kopenalex-snapshot
The complexity of stochastic games
inferredcites →https://doi.org/10.1016/s0021-9800(66)80005-4openalex-snapshot
Graphs and composite games
inferredcites →https://doi.org/10.1017/s0013091500002790openalex-snapshot
Paul R. Halmos, Naive Set Theory (Van Nostrand, Princeton, 1960), 26s. 6d.
inferredcites →https://doi.org/10.1080/00029890.1962.11989827openalex-snapshot
College Admissions and the Stability of Marriage
inferredcites →https://doi.org/10.1080/00029890.1974.11993620openalex-snapshot
Hugo Steinhaus — A Reminiscence and a Tribute
inferredcites →https://doi.org/10.1090/mbk/121/32openalex-snapshot
Theory of games and economic behavior
inferredcites →https://doi.org/10.1109/tit.1986.1057187openalex-snapshot
Lexicographic codes: Error-correcting codes from game theory
inferredcites →https://doi.org/10.1515/9781400882151-008openalex-snapshot
6. EFFECTIVE COMPUTABILITY OF WINNING STRATEGIES
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
inferredcites →https://doi.org/10.2307/2550081openalex-snapshot
Theory of Games and Economic Behaviour.
inferredcites →https://doi.org/10.48550/arxiv.math/9504211openalex-snapshot
Error-correcting codes derived from combinatorial games
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-032-05134-9_27openalex-snapshot
Winning by Numbers: Connecting Strong Admissibility to Optimal Play in Argumentation
inferred← citeshttps://doi.org/10.1007/978-3-642-54373-9_3openalex-snapshot
A Normal Form for Argumentation Frameworks
inferred← citeshttps://doi.org/10.1007/s40590-025-00711-1openalex-snapshot
The theorem of Richardson and its generalizations: a survey
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.03.020openalex-snapshot
On kernels in strongly game-perfect digraphs and a characterisation of weakly game-perfect digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.044openalex-snapshot
On variants of Vertex Geography on undirected graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.04.018openalex-snapshot
Counting kernels in directed graphs with arbitrary orientations
inferred← citeshttps://doi.org/10.1016/j.disc.2010.09.022openalex-snapshot
Kernels by monochromatic paths in digraphs with covering number 2
inferred← citeshttps://doi.org/10.1016/j.disc.2012.05.004openalex-snapshot
Kernels in digraphs that are not kernel perfect
inferred← citeshttps://doi.org/10.1016/j.disc.2013.03.008openalex-snapshot
Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.02.003openalex-snapshot
Kernels in planar digraphs
inferred← citeshttps://doi.org/10.1016/j.riit.2016.06.003openalex-snapshot
Un algoritmo para el Strip Packing Problem obtenido mediante la extracción de habilidades de expertos usando minería de datos
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1080/00029890.1998.12004988openalex-snapshot
Multivision: An Intractable Impartial Game With a Linear Winning Strategy
inferred← citeshttps://doi.org/10.11575/cdm.v7i2.62146.g46744openalex-snapshot
Tournaments with kernels by monochromatic paths
inferred← citeshttps://doi.org/10.2307/2589284openalex-snapshot
Multivision: An Intractable Impartial Game with a Linear Winning Strategy
inferred← citeshttps://doi.org/10.37236/1597openalex-snapshot
Aviezri Fraenkel and Combinatorial Games
inferred← citeshttps://doi.org/10.48550/arxiv.2105.00044openalex-snapshot
On $(k,l,H)$-kernels by walks and the H-class digraph
inferred← citeshttps://doi.org/10.52842/conf.caadria.2022.2.759openalex-snapshot
Decentralised Solar Economy: Unattended and Smart Solar Energy Urban System (UnSSEUS)
inferred← citeshttps://doi.org/10.70675/b9a69b41z56efz40ccz814dza2639f67b149openalex-snapshot
Reconfiguration and combinatorial games
inferred← citeshttps://doi.org/10.7151/dmgt.1544openalex-snapshot
Kernels by monochromatic paths and the color-class digraph
inferred← citeshttps://doi.org/10.7151/dmgt.1747openalex-snapshot
On the existence of (k,l)-kernels in infinite digraphs: A survey
inferred← citeshttps://doi.org/10.7151/dmgt.2463openalex-snapshot
$(k,H)$-kernels in nearly tournaments
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.