On the public citation graph
On provably best construction heuristics for hard combinatorial optimization problems
0 signed · 63 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/0-306-48056-5_8openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/978-0-387-30165-5openalex-snapshot
Handbook of Optimization in Telecommunications
inferredcites →https://doi.org/10.1007/978-1-4613-0219-3_4openalex-snapshot
A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.1007/978-1-4614-5242-3openalex-snapshot
Connected Dominating Set: Theory and Applications
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferredcites →https://doi.org/10.1007/978-3-642-78240-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01096763openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/bf02289146openalex-snapshot
A Method of Matrix Analysis of Group Structure
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/s10479-005-3971-7openalex-snapshot
Metaheuristics in Combinatorial Optimization
inferredcites →https://doi.org/10.1007/s10878-005-1857-xopenalex-snapshot
Novel Approaches for Analyzing Biological Networks
inferredcites →https://doi.org/10.1007/s11590-013-0698-2openalex-snapshot
Solving maximum clique in sparse graphs: an $$O(nm+n2^{d/4})$$ O ( n m + n 2 d / 4 ) algorithm for $$d$$ d -degenerate graphs
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/0022-0000(80)90060-4openalex-snapshot
The node-deletion problem for hereditary properties is NP-complete
inferredcites →https://doi.org/10.1016/0095-8956(75)90089-1openalex-snapshot
Three short proofs in graph theory
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/0196-6774(88)90006-5openalex-snapshot
A fast parallel algorithm to color a graph with Δ colors
inferredcites →https://doi.org/10.1016/0304-3975(75)90016-xopenalex-snapshot
A comparison of polynomial time reducibilities
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/0304-3975(89)90121-7openalex-snapshot
An NC algorithm for Brooks' Theorem
inferredcites →https://doi.org/10.1016/j.disc.2006.01.004openalex-snapshot
On NP-hardness of the clique partition—Independence number gap recognition and related problems
inferredcites →https://doi.org/10.1016/j.disopt.2012.02.002openalex-snapshot
On inclusionwise maximal and maximum cardinality k -clubs in graphs
inferredcites →https://doi.org/10.1016/j.ejor.2005.05.026openalex-snapshot
Clique-detection models in computational biochemistry and genomics
inferredcites →https://doi.org/10.1016/j.ejor.2012.10.021openalex-snapshot
On clique relaxation models in network analysis
inferredcites →https://doi.org/10.1016/j.ipl.2005.12.007openalex-snapshot
Δ-List vertex coloring in linear time
inferredcites →https://doi.org/10.1016/s0166-218x(01)00195-0openalex-snapshot
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP
inferredcites →https://doi.org/10.1016/s0166-218x(01)00290-6openalex-snapshot
A fast algorithm for the maximum clique problem
inferredcites →https://doi.org/10.1016/s0305-0548(99)00047-7openalex-snapshot
Heuristics for finding k-clubs in an undirected graph
inferredcites →https://doi.org/10.1016/s0377-2217(01)00133-3openalex-snapshot
An exact algorithm for the maximum k-club problem in an undirected graph
inferredcites →https://doi.org/10.1023/a:1011925109392openalex-snapshot
Adaptive, Restart, Randomized Greedy Heuristics for Maximum Clique
inferredcites →https://doi.org/10.1057/palgrave.jors.2600392openalex-snapshot
The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1111/j.1475-3995.2009.00696.xopenalex-snapshot
A survey on vertex coloring problems
inferredcites →https://doi.org/10.1145/1008293.1008294openalex-snapshot
Planar 3-colorability is polynomial complete
inferredcites →https://doi.org/10.1145/1132516.1132612openalex-snapshot
Linear degree extractors and the inapproximability of max clique and chromatic number
inferredcites →https://doi.org/10.1145/237814.238005openalex-snapshot
Efficiently four-coloring planar graphs
inferredcites →https://doi.org/10.1145/261342.571216openalex-snapshot
Approximation Algorithms for NP-Hard Problems
inferredcites →https://doi.org/10.1145/321958.321975openalex-snapshot
P-Complete Approximation Problems
inferredcites →https://doi.org/10.1145/937503.937505openalex-snapshot
Metaheuristics in combinatorial optimization
inferredcites →https://doi.org/10.1287/moor.10.2.180openalex-snapshot
A Best Possible Heuristic for the k-Center Problem
inferredcites →https://doi.org/10.1287/opre.42.5.860openalex-snapshot
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
inferredcites →https://doi.org/10.5555/314613.314829openalex-snapshot
Fast distributed algorithms for Brooks-Vizing colourings
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.21791openalex-snapshot
On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_9-1openalex-snapshot
Degree and Distance-Based Clique Relaxations
inferred← citeshttps://doi.org/10.1007/978-3-032-00385-0_47openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-07124-4_47openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_47-1openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_47-2openalex-snapshot
The Maximum Clique and Vertex Coloring
inferred← citeshttps://doi.org/10.1007/s00453-017-0344-yopenalex-snapshot
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
inferred← citeshttps://doi.org/10.1007/s11227-019-02971-xopenalex-snapshot
An investigation of latency prediction for NoC-based communication architectures using machine learning techniques
inferred← citeshttps://doi.org/10.1007/s11590-015-0971-7openalex-snapshot
Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.05.020openalex-snapshot
On biconnected and fragile subgraphs of low diameter
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.05.010openalex-snapshot
On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
inferred← citeshttps://doi.org/10.1088/1751-8121/ae6cc6openalex-snapshot
Efficient quantum detection of maximum clique via hybrid heuristic and global information encoding
inferred← citeshttps://doi.org/10.1287/ijoc.2019.0914openalex-snapshot
The Optimal Design of Low-Latency Virtual Backbones
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.