On the public citation graph

Domination When the Stars Are Out

0 signed · 107 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.21797openalex-snapshot
Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ
inferredcites →https://doi.org/10.1002/jgt.v63:4openalex-snapshot
inferredcites →https://doi.org/10.1002/net.3230250205openalex-snapshot
Simple heuristics for unit disk graphs
inferredcites →https://doi.org/10.1006/jagm.2000.1090openalex-snapshot
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
inferredcites →https://doi.org/10.1006/jcss.2001.1774openalex-snapshot
Which Problems Have Strongly Exponential Complexity?
inferredcites →https://doi.org/10.1006/jctb.1993.1052openalex-snapshot
A Strengthening of Ben Rebea′s Lemma
inferredcites →https://doi.org/10.1007/11847250_13openalex-snapshot
edge dominating set: Efficient Enumeration-Based Exact Algorithms
inferredcites →https://doi.org/10.1007/11847250_14openalex-snapshot
Parameterized Complexity of Independence and Domination on Geometric Graphs
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-1-4612-0515-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-3-319-15612-5_21openalex-snapshot
An Improved Algorithm for Parameterized Edge Dominating Set Problem
inferredcites →https://doi.org/10.1007/978-3-319-21275-3openalex-snapshot
Parameterized Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_8openalex-snapshot
Reducibility Among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-540-68891-4_6openalex-snapshot
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_32openalex-snapshot
Incompressibility through Colors and IDs
inferredcites →https://doi.org/10.1007/978-3-642-04128-0_62openalex-snapshot
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
inferredcites →https://doi.org/10.1007/978-3-642-16533-7openalex-snapshot
Exact Exponential Algorithms
inferredcites →https://doi.org/10.1007/978-3-642-31155-0_9openalex-snapshot
Deterministic Parameterized Connected Vertex Cover
inferredcites →https://doi.org/10.1007/bfb0028546openalex-snapshot
A synthesis on partition refinement: A useful routine for strings, graphs, boolean matrices and automata
inferredcites →https://doi.org/10.1007/pl00009201openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1007/s00453-007-9015-8openalex-snapshot
Approximation Algorithms for Connected Dominating Sets
inferredcites →https://doi.org/10.1007/s00453-012-9630-xopenalex-snapshot
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion
inferredcites →https://doi.org/10.1007/s00453-014-9877-5openalex-snapshot
Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs
inferredcites →https://doi.org/10.1007/s00493-008-2244-xopenalex-snapshot
The stable set polytope of quasi-line graphs
inferredcites →https://doi.org/10.1016/0012-365x(78)90105-xopenalex-snapshot
On domination and independent domination numbers of a graph
inferredcites →https://doi.org/10.1016/0012-365x(90)90287-ropenalex-snapshot
Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile
inferredcites →https://doi.org/10.1016/0012-365x(90)90365-oopenalex-snapshot
Bibliography on domination in graphs and some basic definitions of domination parameters
inferredcites →https://doi.org/10.1016/0020-0190(73)90029-xopenalex-snapshot
A max {m,n} algorithm for determining the graph H from its line graph G
inferredcites →https://doi.org/10.1016/0020-0190(91)90165-eopenalex-snapshot
Linear time algorithms on circular-arc graphs
inferredcites →https://doi.org/10.1016/0095-8956(80)90074-xopenalex-snapshot
On maximal independent sets of vertices in claw-free graphs
inferredcites →https://doi.org/10.1016/0304-3975(94)00097-3openalex-snapshot
Fixed-parameter tractability and completeness II: On completeness for W[1]
inferredcites →https://doi.org/10.1016/0898-1221(93)90308-iopenalex-snapshot
Optimal greedy algorithms for indifference graphs
inferredcites →https://doi.org/10.1016/j.dam.2012.11.005openalex-snapshot
Normal Helly circular-arc graphs and its subclasses
inferredcites →https://doi.org/10.1016/j.endm.2010.05.130openalex-snapshot
The stable set polytope of claw-free graphs with large stability number
inferredcites →https://doi.org/10.1016/j.ic.2008.07.003openalex-snapshot
Approximation hardness of dominating set problems in bounded degree graphs
inferredcites →https://doi.org/10.1016/j.jcss.2009.04.001openalex-snapshot
On problems without polynomial kernels
inferredcites →https://doi.org/10.1016/j.jcss.2020.04.005openalex-snapshot
Disconnected cuts in claw-free graphs
inferredcites →https://doi.org/10.1016/j.jctb.2007.02.002openalex-snapshot
Claw-free graphs. I. Orientable prismatic graphs
inferredcites →https://doi.org/10.1016/j.jctb.2007.06.006openalex-snapshot
Claw-free graphs. II. Non-orientable prismatic graphs
inferredcites →https://doi.org/10.1016/j.jctb.2007.06.007openalex-snapshot
Claw-free graphs. IV. Decomposition theorem
inferredcites →https://doi.org/10.1016/j.jctb.2008.03.001openalex-snapshot
Claw-free graphs. III. Circular interval graphs
inferredcites →https://doi.org/10.1016/j.jctb.2008.03.002openalex-snapshot
Claw-free graphs. V. Global structure
inferredcites →https://doi.org/10.1016/j.jctb.2010.04.005openalex-snapshot
Claw-free graphs VI. Colouring
inferredcites →https://doi.org/10.1016/j.jctb.2012.07.005openalex-snapshot
Claw-free graphs. VII. Quasi-line graphs
inferredcites →https://doi.org/10.1016/j.jda.2012.11.003openalex-snapshot
Detecting 2-joins faster
inferredcites →https://doi.org/10.1016/j.orl.2011.04.002openalex-snapshot
A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.004openalex-snapshot
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
inferredcites →https://doi.org/10.1016/j.tcs.2008.09.065openalex-snapshot
On the parameterized complexity of multiple-interval graph problems
inferredcites →https://doi.org/10.1016/j.tcs.2011.09.010openalex-snapshot
Dominating set is fixed parameter tractable in claw-free graphs
inferredcites →https://doi.org/10.1016/j.tcs.2012.06.022openalex-snapshot
New parameterized algorithms for the edge dominating set problem
inferredcites →https://doi.org/10.1016/j.tcs.2017.06.012openalex-snapshot
Boundary classes for graph problems involving non-local properties
inferredcites →https://doi.org/10.1016/s0012-365x(85)80001-7openalex-snapshot
Compositions for perfect graphs
inferredcites →https://doi.org/10.1016/s0012-365x(96)00045-3openalex-snapshot
Claw-free graphs — A survey
inferredcites →https://doi.org/10.1016/s0020-0190(00)00047-8openalex-snapshot
Finding and counting small induced subgraphs efficiently
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s0166-218x(99)00052-9openalex-snapshot
Constrained weighted matchings and edge coverings in graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72937-2openalex-snapshot
A Composition for Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-3975(97)00241-7openalex-snapshot
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
inferredcites →https://doi.org/10.1016/s1571-0661(04)00301-9openalex-snapshot
Parameterized Complexity
inferredcites →https://doi.org/10.1017/cbo9780511734885.008openalex-snapshot
The structure of claw-free graphs
inferredcites →https://doi.org/10.1137/0132071openalex-snapshot
The Rectilinear Steiner Tree Problem is $NP$-Complete
inferredcites →https://doi.org/10.1137/0138030openalex-snapshot
Edge Dominating Sets in Graphs
inferredcites →https://doi.org/10.1137/0207033openalex-snapshot
Finding a Minimum Circuit in a Graph
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/10080052xopenalex-snapshot
Linear Time Split Decomposition Revisited
inferredcites →https://doi.org/10.1137/140963200openalex-snapshot
Induced Disjoint Paths in Claw-Free Graphs
inferredcites →https://doi.org/10.1137/s0097539792238431openalex-snapshot
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
inferredcites →https://doi.org/10.1137/s0097539792269095openalex-snapshot
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
inferredcites →https://doi.org/10.1145/115234.115366openalex-snapshot
Faster scaling algorithms for general graph matching problems
inferredcites →https://doi.org/10.1145/1250790.1250801openalex-snapshot
Fourier meets möbius: fast subset convolution
inferredcites →https://doi.org/10.1145/1367064.1367068openalex-snapshot
Balanced parentheses strike back
inferredcites →https://doi.org/10.1145/2213977.2214056openalex-snapshot
Multiplying matrices faster than coppersmith-winograd
inferredcites →https://doi.org/10.1145/2608628.2608664openalex-snapshot
Powers of tensors and fast matrix multiplication
inferredcites →https://doi.org/10.1145/2629600openalex-snapshot
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
inferredcites →https://doi.org/10.1145/285055.285059openalex-snapshot
A threshold of ln n for approximating set cover
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1201/9781315141428openalex-snapshot
Domination in graphs : advanced topics
inferredcites →https://doi.org/10.1201/9781482246582openalex-snapshot
Fundamentals of Domination in Graphs
inferredcites →https://doi.org/10.1201/b16132-65openalex-snapshot
Domination in Graphs
inferredcites →https://doi.org/10.15807/jorsj.44.194openalex-snapshot
A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
inferredcites →https://doi.org/10.2307/2005950openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.4153/cjm-1965-045-4openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.4230/lipics.fsttcs.2010.96openalex-snapshot
The effect of girth on the kernelization complexity of Connected Dominating Set
inferredcites →https://doi.org/10.48550/arxiv.1110.5111openalex-snapshot
Optimal antithickenings of claw-free trigraphs
inferredcites →https://doi.org/10.48550/arxiv.1501.05775openalex-snapshot
An ${\cal O}(n^2 \log(n))$ algorithm for the weighted stable set problem in claw-free graphs
inferredcites →https://doi.org/10.5555/1385429.1385433openalex-snapshot
Coloring quasi-line graphs
inferredcites →https://doi.org/10.5555/291511.291519openalex-snapshot
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
inferredcites →https://doi.org/10.82308/16876openalex-snapshot
Claw-free graphs and two conjectures on omega, Delta, and chi

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.23000openalex-snapshot
Clique‐width: Harnessing the power of atoms
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_10openalex-snapshot
Clique-Width: Harnessing the Power of Atoms
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_14openalex-snapshot
Induced Disjoint Paths in AT-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_45openalex-snapshot
Induced Disjoint Paths in Claw-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-34611-8_6openalex-snapshot
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-00965-5openalex-snapshot
Twin-width and Polynomial Kernels
inferred← citeshttps://doi.org/10.1007/s00453-023-01137-9openalex-snapshot
Finding Matching Cuts in H-Free Graphs
inferred← citeshttps://doi.org/10.1007/s10878-021-00736-yopenalex-snapshot
Declawing a graph: polyhedra and Branch-and-Cut algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.021openalex-snapshot
Revising Johnson’s table for the 21st century
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.2023.113498openalex-snapshot
Intersection graphs of non-crossing paths
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.04.005openalex-snapshot
Disconnected cuts in claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.009openalex-snapshot
Partitioning H-free graphs of bounded diameter
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114561openalex-snapshot
On the complexity of Dominating Set for graphs with fixed diameter
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114795openalex-snapshot
Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius
inferred← citeshttps://doi.org/10.1137/24m1677885openalex-snapshot
The Complexity of Diameter on \({H}\)-Free Graphs
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.