On the public citation graph
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
0 signed · 43 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/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/bf01580222openalex-snapshot
Properties of vertex packing and independence system polyhedra
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(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230170402openalex-snapshot
An algorithmic framework for the matching problem in some hypergraphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_38openalex-snapshot
On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_18openalex-snapshot
Min-Max Results in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/bf01299447openalex-snapshot
An exact algorithm for the maximum stable set problem
inferred← citeshttps://doi.org/10.1007/bf01415983openalex-snapshot
A branch and bound algorithm for the maximum clique problem
inferred← citeshttps://doi.org/10.1007/bf02257777openalex-snapshot
Finding maximum cliques in arbitrary and in special graphs
inferred← citeshttps://doi.org/10.1007/bf02591727openalex-snapshot
A polynomial algorithm for the max-cut problem on graphs without long odd cycles
inferred← citeshttps://doi.org/10.1007/s00224-018-9858-1openalex-snapshot
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90032-jopenalex-snapshot
Stability number of bull- and chair-free graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00122-topenalex-snapshot
Strongly polynomial simplex algorithm for bipartite vertex packing
inferred← citeshttps://doi.org/10.1016/j.disc.2017.11.012openalex-snapshot
The list chromatic index of simple graphs whose odd cycles intersect in at most one edge
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.03.006openalex-snapshot
Tuza’s Conjecture for graphs with maximum average degree less than 7
inferred← citeshttps://doi.org/10.1016/j.trpro.2017.03.037openalex-snapshot
A Multicriteria Analysis for the Green VRP: A Case Discussion for the Distribution Problem of a Spanish Retailer
inferred← citeshttps://doi.org/10.1016/j.trpro.2017.12.056openalex-snapshot
Multi-Criteria Optimization for Fleet Size with Environmental Aspects
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00268-0openalex-snapshot
On (P5, diamond)-free graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00124-2openalex-snapshot
On the use of Boolean methods for the computation of the stability number
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00081-4openalex-snapshot
Polyhedral characterizations and perfection of line graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72449-6openalex-snapshot
An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73110-4openalex-snapshot
How to Find Long Paths Efficiently
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00286-3openalex-snapshot
Enumerating all connected maximal common subgraphs in two graphs
inferred← citeshttps://doi.org/10.1016/s0305-0548(00)00053-8openalex-snapshot
Finding all k-cliques in k-partite graphs, an application in textile engineering
inferred← citeshttps://doi.org/10.1080/00207168208803311openalex-snapshot
Determining the number of internal stability of a graph
inferred← citeshttps://doi.org/10.1080/00207168308803357openalex-snapshot
An algorithm for the maximum internally stable set in a weighted graph
inferred← citeshttps://doi.org/10.1080/00207169108803967openalex-snapshot
An algorithm for finding a maximum weighted independent set in an arbitrary graph
inferred← citeshttps://doi.org/10.1108/s0276-897620180000019006openalex-snapshot
Weighted-Sum Approach for Bi-objective Optimization of Fleet Size with Environmental Aspects
inferred← citeshttps://doi.org/10.1134/s1990478918020023openalex-snapshot
New Cases of the Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Paths
inferred← citeshttps://doi.org/10.1134/s1990478923010210openalex-snapshot
New Cases of Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Triodes
inferred← citeshttps://doi.org/10.1145/23005.31330openalex-snapshot
Recognizing planar perfect graphs
inferred← citeshttps://doi.org/10.1287/moor.12.3.522openalex-snapshot
On the Maximum Weight Clique Problem
inferred← citeshttps://doi.org/10.18130/v37t14openalex-snapshot
A Spectrum Allocation and Auction Mechanism With The Maximum Weighed Independent Set
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.