On the public citation graph
Every directed graph has a semi-kernel
0 signed · 59 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.1007/bf02476378openalex-snapshot
On dominance relations and the structure of animal societies: III The condition for a score structure
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.10169openalex-snapshot
On the number of quasi‐kernels in digraphs
inferred← citeshttps://doi.org/10.1002/jgt.20646openalex-snapshot
Gallai colorings and domination in multipartite digraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_27openalex-snapshot
Algorithmic Aspects of Small Quasi-Kernels
inferred← citeshttps://doi.org/10.1007/978-3-031-82014-4_4openalex-snapshot
On the Small Quasi-kernel Conjecture—A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_6openalex-snapshot
Locally Semicomplete Digraphs and Generalizations
inferred← citeshttps://doi.org/10.1007/978-3-540-77200-2_10openalex-snapshot
Infinite Combinatorics: From Finite to Infinite
inferred← citeshttps://doi.org/10.1007/978-3-642-87563-2_3openalex-snapshot
Quasi-Kernels of Outranking Relations
inferred← citeshttps://doi.org/10.1007/s00373-005-0618-zopenalex-snapshot
Monochromatic Paths and at Most 2-Coloured Arc Sets in Edge-Coloured Tournaments
inferred← citeshttps://doi.org/10.1007/s00373-007-0721-4openalex-snapshot
Vašek Chvátal: A Very Short Introduction
inferred← citeshttps://doi.org/10.1007/s10472-022-09785-3openalex-snapshot
Indepth combinatorial analysis of admissible sets for abstract argumentation
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90057-7openalex-snapshot
Quasi-kernels of minimum weakness in a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90168-8openalex-snapshot
On Ramsey-Turán type problems in tournaments
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90054-9openalex-snapshot
Sur les quasi-noyaux d'un graphe
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90365-oopenalex-snapshot
Bibliography on domination in graphs and some basic definitions of domination parameters
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90021-7openalex-snapshot
Complexity of finding k-path-free dominating sets in graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(82)90047-8openalex-snapshot
On monochromatic paths in edge-coloured digraphs
inferred← citeshttps://doi.org/10.1016/0191-2607(84)90110-9openalex-snapshot
Methodological aspects of a decision aid for transportation choices under uncertainty
inferred← citeshttps://doi.org/10.1016/0377-2217(77)90047-9openalex-snapshot
Generalized solution principles and out-ranking relations in multi-criteria decision-making
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.03.002openalex-snapshot
(, )-kernels and Sands, Sauer and Woodrow’s theorem
inferred← citeshttps://doi.org/10.1016/j.dam.2011.08.017openalex-snapshot
At least three minimal quasi-kernels
inferred← citeshttps://doi.org/10.1016/j.dam.2019.11.012openalex-snapshot
Kernels by rainbow paths in arc-colored tournaments
inferred← citeshttps://doi.org/10.1016/j.dam.2024.10.009openalex-snapshot
Quasi-kernels in split graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.053openalex-snapshot
Compositions of digraphs: a survey
inferred← citeshttps://doi.org/10.1016/j.disc.2005.10.003openalex-snapshot
Digraphs with unique minimal king sets
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.031openalex-snapshot
Perfect graphs, kernels, and cores of cooperative games
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.042openalex-snapshot
Reachability problems in edge-colored digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.08.006openalex-snapshot
Quasi-kernels and quasi-sinks in infinite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.05.005openalex-snapshot
k -kernels in k -transitive and k -quasi-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2018.02.014openalex-snapshot
Kernels by properly colored paths in arc-colored digraphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2011.03.003openalex-snapshot
A Greedy Partition Lemma for directed domination
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.10.028openalex-snapshot
A collective choice method based on individual preferences relational systems (p.r.s.)
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.11.020openalex-snapshot
Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
inferred← citeshttps://doi.org/10.1016/j.ipl.2015.06.017openalex-snapshot
A note on quasi-kernels in digraphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)71054-9openalex-snapshot
Bibliography on Domination in Graphs and Some Basic Definitions of Domination Parameters
inferred← citeshttps://doi.org/10.1080/09728600.2011.12088942openalex-snapshot
K-Kernels in Multipartite Tournaments
inferred← citeshttps://doi.org/10.1137/0404008openalex-snapshot
Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph
inferred← citeshttps://doi.org/10.1137/0606006openalex-snapshot
On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints
inferred← citeshttps://doi.org/10.1137/s0895480195291370openalex-snapshot
Semikernels and ( k,l )-Kernels in Digraphs
inferred← citeshttps://doi.org/10.1145/3689625openalex-snapshot
Breaking the Metric Voting Distortion Barrier
inferred← citeshttps://doi.org/10.1287/opre.1080.0536openalex-snapshot
Coalition Stability in Assembly Models
inferred← citeshttps://doi.org/10.37236/11043openalex-snapshot
Towards the Small Quasi-Kernel Conjecture
inferred← citeshttps://doi.org/10.37236/6315openalex-snapshot
King-Serf Duo by Monochromatic Paths in $k$-Edge-Coloured Tournaments
inferred← citeshttps://doi.org/10.4236/ojdm.2012.22010openalex-snapshot
Quasi-Kernels for Oriented Paths and Cycles
inferred← citeshttps://doi.org/10.48550/arxiv.2006.05607openalex-snapshot
Kings and Kernels in Semicomplete Compositions
inferred← citeshttps://doi.org/10.48550/arxiv.2110.00789openalex-snapshot
Kernels and Small Quasi-Kernels in Digraphs
inferred← citeshttps://doi.org/10.70675/4f1a5deez2163z4f85za5a5z12eb7d4cb498openalex-snapshot
Kernels and quasi-kernels in digraphs.
inferred← citeshttps://doi.org/10.7146/brics.v8i7.20461openalex-snapshot
On the Number of Quasi-Kernels in Digraphs
inferred← citeshttps://doi.org/10.7151/dmgt.1458openalex-snapshot
Independent transversals of longest paths in locally semicomplete and transitive digraphs
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.