On the public citation graph
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
0 signed · 68 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.1002/jgt.21679openalex-snapshot
Asymptotics of the Chromatic Number for Quasi‐Line Graphs
inferredcites →https://doi.org/10.1006/jctb.1993.1052openalex-snapshot
A Strengthening of Ben Rebea′s Lemma
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-22006-7_39openalex-snapshot
Domination When the Stars Are Out
inferredcites →https://doi.org/10.1007/978-3-642-34611-8_6openalex-snapshot
Minimum Weighted Clique Cover on Strip-Composed Perfect 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(90)90287-ropenalex-snapshot
Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile
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/0095-8956(80)90074-xopenalex-snapshot
On maximal independent sets of vertices in claw-free graphs
inferredcites →https://doi.org/10.1016/j.disc.2011.12.029openalex-snapshot
On the recognition of fuzzy circular interval 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.002openalex-snapshot
Claw-free graphs. V. Global structure
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.tcs.2007.09.031openalex-snapshot
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
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/s0166-218x(01)00208-6openalex-snapshot
On claw-free asteroidal triple-free graphs
inferredcites →https://doi.org/10.1016/s0166-218x(02)00571-1openalex-snapshot
On linear and circular structure of (claw, net)-free graphs
inferredcites →https://doi.org/10.1017/cbo9780511734885.008openalex-snapshot
The structure of claw-free graphs
inferredcites →https://doi.org/10.1137/110847585openalex-snapshot
A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line 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/2583863openalex-snapshot
Network Flows: Theory, Algorithms, and Applications.
inferredcites →https://doi.org/10.48550/arxiv.1103.6222openalex-snapshot
Finding a smallest odd hole in a claw-free graph using global structure
inferredcites →https://doi.org/10.5555/320176.320229openalex-snapshot
Data structures for weighted matching and nearest common ancestors with linking
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
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.22611openalex-snapshot
Minimum weighted clique cover on claw‐free perfect graphs
inferred← citeshttps://doi.org/10.1002/net.22232openalex-snapshot
Getting linear time in graphs of bounded neighborhood diversity
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_2openalex-snapshot
Linear-Time Algorithms for Eliminating Claws in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-04520-2_3openalex-snapshot
Complexity and Polynomially Solvable Special Cases of QUBO
inferred← citeshttps://doi.org/10.1007/s10107-016-1080-9openalex-snapshot
An $$\mathcal{O}(m\log n)$$ O ( m log n ) algorithm for the weighted stable set problem in claw-free graphs with $$\alpha ({G}) \le 3$$ α ( G ) ≤ 3
inferred← citeshttps://doi.org/10.1007/s10107-019-01461-5openalex-snapshot
An $${\mathcal {O}}(n^2 \log {n})$$ algorithm for the weighted stable set problem in claw-free graphs
inferred← citeshttps://doi.org/10.1007/s10107-020-01502-4openalex-snapshot
Separation routine and extended formulations for the stable set problem in claw-free graphs
inferred← citeshttps://doi.org/10.1007/s10479-021-04449-7openalex-snapshot
On the facets of stable set polytopes of circular interval graphs
inferred← citeshttps://doi.org/10.1007/s11590-023-02076-8openalex-snapshot
A polytime preprocess algorithm for the maximum independent set problem
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.023openalex-snapshot
A sufficient condition to extend polynomial results for the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.003openalex-snapshot
Maximum Weight Independent Sets for ( P 7 ,triangle)-free graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/j.dam.2017.11.029openalex-snapshot
Maximum weight independent set for ℓ claw-free graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/j.dam.2023.01.012openalex-snapshot
Lovász–Schrijver PSD-operator and the stable set polytope of claw-free 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.2018.06.043openalex-snapshot
Equimatchable claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.01.002openalex-snapshot
An O(nm) algorithm for the weighted stable set problem in {claw, net}-free graphs with α(G)≥4
inferred← citeshttps://doi.org/10.1016/j.endm.2017.07.021openalex-snapshot
Colouring Squares of Claw-free Graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.11.003openalex-snapshot
Reconfiguration in bounded bandwidth and tree-depth
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.orl.2020.07.013openalex-snapshot
Polynomial size IP formulations of knapsack may require exponentially large coefficients
inferred← citeshttps://doi.org/10.1016/j.orl.2024.107144openalex-snapshot
The total matching polytope of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.05.027openalex-snapshot
Maximum weight independent sets for (S1,2,4,triangle)-free graphs in polynomial time
inferred← citeshttps://doi.org/10.1109/lcomm.2021.3102116openalex-snapshot
Graph-Theoretical Dynamic User Pairing for Downlink NOMA Systems
inferred← citeshttps://doi.org/10.1109/meditcom58224.2023.10266627openalex-snapshot
Age of Information Minimizing Dynamic User Pairing in Downlink NOMA Systems
inferred← citeshttps://doi.org/10.1109/pimrc.2017.8292404openalex-snapshot
Scheduling wireless ad hoc networks in polynomial time using claw-free conflict graphs
inferred← citeshttps://doi.org/10.1109/tmc.2024.3460170openalex-snapshot
The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems
inferred← citeshttps://doi.org/10.1109/tnet.2019.2959797openalex-snapshot
Performance Guarantees of Distributed Algorithms for QoS in Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/twc.2020.3025448openalex-snapshot
A Novel Method for Scheduling of Wireless Ad Hoc Networks in Polynomial Time
inferred← citeshttps://doi.org/10.1137/1.9781611975994.139openalex-snapshot
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H -free graphs
inferred← citeshttps://doi.org/10.1137/20m1333778openalex-snapshot
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs
inferred← citeshttps://doi.org/10.1137/20m1347747openalex-snapshot
Counting Weighted Independent Sets beyond the Permanent
inferred← citeshttps://doi.org/10.1145/3571306.3571335openalex-snapshot
Structured Hypergraphs in Cellular Mobile Communication Systems
inferred← citeshttps://doi.org/10.36227/techrxiv.20213360openalex-snapshot
Structured Hypergraphs in Cellular Mobile Communication Systems
inferred← citeshttps://doi.org/10.36227/techrxiv.20213360.v1openalex-snapshot
Structured Hypergraphs in Cellular Mobile Communication Systems
inferred← citeshttps://doi.org/10.4153/cjm-2017-029-9openalex-snapshot
Colouring Squares of Claw-free Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1501.05773openalex-snapshot
An ${\cal O}(m\log n)$ algorithm for the weighted stable set problem in claw-free graphs with $α({G}) \le 3$
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05838openalex-snapshot
Maximum Weight Independent Set in lClaw-Free Graphs in Polynomial Time
inferred← citeshttps://doi.org/10.48550/arxiv.1712.00658openalex-snapshot
Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time
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.