On the public citation graph
An exact algorithm for the maximum stable set problem
0 signed · 57 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/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1002/net.3230030305openalex-snapshot
Algorithms for a maximum clique and a maximum independent set of a circle graph
inferredcites →https://doi.org/10.1002/net.3230040407openalex-snapshot
Algorithms on circular‐arc graphs
inferredcites →https://doi.org/10.1002/net.3230120410openalex-snapshot
Efficient algorithms for interval graphs and circular‐arc graphs
inferredcites →https://doi.org/10.1007/bf01096415openalex-snapshot
Test case generators and computational results for the maximum clique problem
inferredcites →https://doi.org/10.1007/bf01582907openalex-snapshot
An interior point algorithm to solve computationally difficult set covering problems
inferredcites →https://doi.org/10.1007/bf01588309openalex-snapshot
A note on some computationally difficult set covering problems
inferredcites →https://doi.org/10.1007/bf01589347openalex-snapshot
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
inferredcites →https://doi.org/10.1007/bf02257777openalex-snapshot
Finding maximum cliques in arbitrary and in special graphs
inferredcites →https://doi.org/10.1007/bfb0120689openalex-snapshot
Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems
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/0095-8956(86)90087-0openalex-snapshot
Relaxations of vertex packing
inferredcites →https://doi.org/10.1016/0167-6377(89)90002-3openalex-snapshot
A probabilistic heuristic for a computationally difficult set covering problem
inferredcites →https://doi.org/10.1016/0167-6377(90)90057-copenalex-snapshot
An exact algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1016/0305-0548(90)90048-copenalex-snapshot
Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph
inferredcites →https://doi.org/10.1016/0305-0548(92)90067-fopenalex-snapshot
A branch and bound algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1057/jors.1992.71openalex-snapshot
A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
inferredcites →https://doi.org/10.1109/spdp.1991.218194openalex-snapshot
Test generation in a distributed environment
inferredcites →https://doi.org/10.1137/0215075openalex-snapshot
Finding a Maximum Clique in an Arbitrary Graph
inferredcites →https://doi.org/10.1145/359094.359101openalex-snapshot
New methods to color the vertices of a graph
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-684x(199705)28:5<60::aid-scj7>3.0.co;2-mopenalex-snapshot
A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations
inferred← citeshttps://doi.org/10.1002/net.20088openalex-snapshot
A branch-and-price approach for the maximum weight independent set problem
inferred← citeshttps://doi.org/10.1002/net.20209openalex-snapshot
The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms
inferred← citeshttps://doi.org/10.1002/net.22139openalex-snapshot
Maximum weight perfect matching problem with additional disjunctive conflict constraints
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_37openalex-snapshot
An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_634openalex-snapshot
Stable Set Problem: Branch & Cut Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_634-1openalex-snapshot
Stable Set Problem: Branch & Cut Algorithms
inferred← citeshttps://doi.org/10.1007/bf02243394openalex-snapshot
A fast algorithm for the maximum weight clique problem
inferred← citeshttps://doi.org/10.1007/bf02430368openalex-snapshot
Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
inferred← citeshttps://doi.org/10.1007/s10107-005-0700-6openalex-snapshot
Computational study of large-scale p-Median problems
inferred← citeshttps://doi.org/10.1007/s10107-012-0513-3openalex-snapshot
Strong lift-and-project cutting planes for the stable set problem
inferred← citeshttps://doi.org/10.1007/s10852-012-9203-7openalex-snapshot
Solving a Bicriteria Problem of Optimal Service Centers Location
inferred← citeshttps://doi.org/10.1007/s10951-005-4780-1openalex-snapshot
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00034-hopenalex-snapshot
Solving hard set covering problems
inferred← citeshttps://doi.org/10.1016/j.dam.2003.09.007openalex-snapshot
Block linear majorants in quadratic 0–1 optimization
inferred← citeshttps://doi.org/10.1016/j.dam.2005.05.022openalex-snapshot
A Branch-and-Cut algorithm for graph coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2021.06.008openalex-snapshot
Reformulations and complexity of the clique interdiction problem by graph mapping
inferred← citeshttps://doi.org/10.1016/j.dam.2026.01.015openalex-snapshot
Semidefinite programming bounds and a Branch-and-bound algorithm for the Chordless Cycle Problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.11.050openalex-snapshot
The generalized independent set problem: Polyhedral analysis and solution approaches
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/s0167-6377(00)00060-2openalex-snapshot
A branch-and-cut algorithm for the maximum cardinality stable set problem
inferred← citeshttps://doi.org/10.1016/s1093-3263(97)00089-2openalex-snapshot
Clique-Detection Algorithms for Matching Three-Dimensional Molecular Structures
inferred← citeshttps://doi.org/10.1023/a:1018370201421openalex-snapshot
Solving the Minimum Weighted Integer Coloring Problem
inferred← citeshttps://doi.org/10.1023/a:1021315911306openalex-snapshot
Facets of the Graph Coloring Polytope
inferred← citeshttps://doi.org/10.1023/a:1026456624746openalex-snapshot
An Augmentation Algorithm for the Maximum Weighted Stable Set Problem
inferred← citeshttps://doi.org/10.1109/icoa58279.2023.10308818openalex-snapshot
New approach to solve Uncapacitated Facility Location Problem using Continuous Hopfield Network and modified K-means clustering
inferred← citeshttps://doi.org/10.1109/ipps.1998.669935openalex-snapshot
Solving the maximum clique problem using PUBB
inferred← citeshttps://doi.org/10.11591/ijece.v7i6.pp3583-3592openalex-snapshot
CHN and Swap Heuristic to Solve the Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1287/ijoc.10.4.438openalex-snapshot
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph
inferred← citeshttps://doi.org/10.1287/ijoc.2022.1164openalex-snapshot
Exact Solution Algorithms for the Chordless Cycle Problem
inferred← citeshttps://doi.org/10.1287/mnsc.1040.0336openalex-snapshot
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
inferred← citeshttps://doi.org/10.1287/opre.1070.0397openalex-snapshot
Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem
inferred← citeshttps://doi.org/10.3182/20060517-3-fr-2903.00225openalex-snapshot
A BICRITERIA PROBLEM OF OPTIMAL SERVICE CENTERS LOCATION
inferred← citeshttps://doi.org/10.48550/arxiv.1407.1209openalex-snapshot
A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph
inferred← citeshttps://doi.org/10.7551/mitpress/9780262033428.003.0015openalex-snapshot
Optimal Winner Determination Algorithms
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.