On the public citation graph
Richard M. Karp. Reducibility among combinatorial problems. Complexity of computer computations, Proceedings of a Symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Center, Yorktown Heights, New York, edited by Raymond E. Miller and James W.…
0 signed · 31 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ett.3709openalex-snapshot
Dynamic network service deployment across multiple SDN domains
inferred← citeshttps://doi.org/10.1002/wcm.2448openalex-snapshot
Effective sensor deployment based on field information coverage in precision agriculture
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_26openalex-snapshot
How to Fit a Tree in a Box
inferred← citeshttps://doi.org/10.1007/978-3-031-48882-5_8openalex-snapshot
Temporal Reachability Dominating Sets: Contagion in Temporal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-18178-8_20openalex-snapshot
Selective Regular Expression Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-36899-8_30openalex-snapshot
Randomized Post-optimization for t-Restrictions
inferred← citeshttps://doi.org/10.1007/s00373-022-02558-zopenalex-snapshot
How to Fit a Tree in a Box
inferred← citeshttps://doi.org/10.1007/s10878-012-9455-1openalex-snapshot
The decycling number of outerplanar graphs
inferred← citeshttps://doi.org/10.1007/s10878-020-00529-9openalex-snapshot
An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
inferred← citeshttps://doi.org/10.1007/s40840-025-01972-9openalex-snapshot
On Decycling and Forest Numbers of Cartesian Products of Trees
inferred← citeshttps://doi.org/10.1016/b978-0-12-803801-7.00025-0openalex-snapshot
Agriculture Cyber-Physical Systems
inferred← citeshttps://doi.org/10.1016/j.cie.2015.07.001openalex-snapshot
A job profile oriented scheduling architecture for improving the throughput of industrial printing environments
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.09.013openalex-snapshot
On the decycling number of generalized Kautz digraphs
inferred← citeshttps://doi.org/10.1016/j.neucom.2012.08.070openalex-snapshot
Manifold-preserving graph reduction for sparse semi-supervised learning
inferred← citeshttps://doi.org/10.1038/s41598-020-61722-8openalex-snapshot
Identifying vital nodes based on reverse greedy method
inferred← citeshttps://doi.org/10.1080/00207543.2021.1978577openalex-snapshot
Centralized collaborative production scheduling with evaluation of a practical order-merging strategy
inferred← citeshttps://doi.org/10.1109/ecc.2014.6862411openalex-snapshot
Formation control of a large group of UAVs with safe path planning and obstacle avoidance
inferred← citeshttps://doi.org/10.1109/isda.2009.75openalex-snapshot
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Detection
inferred← citeshttps://doi.org/10.1109/sbes.2009.23openalex-snapshot
A New Approach to the Software Release Planning
inferred← citeshttps://doi.org/10.1109/tai.2026.3664774openalex-snapshot
TD($\lambda$)-GA: A Reinforcement Learning-Based Game Algorithm for Weighted Vertex Cover of Networks
inferred← citeshttps://doi.org/10.1109/tc.2012.194openalex-snapshot
Quality-Driven Dynamic Scheduling for Real-Time Adaptive Applications on Multiprocessor Systems
inferred← citeshttps://doi.org/10.1109/tnet.2012.2200107openalex-snapshot
Time-Bounded Essential Localization for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tvt.2024.3405733openalex-snapshot
Optimized Routing Protocol Through Exploitation of Trajectory Knowledge for UAV Swarms
inferred← citeshttps://doi.org/10.1142/s1793830917500628openalex-snapshot
New bounds on the decycling number of generalized de Bruijn digraphs
inferred← citeshttps://doi.org/10.1155/2021/9980093openalex-snapshot
Roadside Unit Deployment Mechanism Based on Node Popularity
inferred← citeshttps://doi.org/10.1186/s12859-019-3007-yopenalex-snapshot
Identifying protein complexes based on an edge weight algorithm and core-attachment structure
inferred← citeshttps://doi.org/10.20537/2076-7633-2017-9-5-679-703openalex-snapshot
Direct multiplicative methods for sparse matrices. Newton methods
inferred← citeshttps://doi.org/10.26782/jmcms.2020.08.00011openalex-snapshot
RELATIONSHIP BETWEENCOLORING,EMBEDDINGAND DECYCLING NUMBER OF A GRAPH
inferred← citeshttps://doi.org/10.3233/mgs-200323openalex-snapshot
A multiagent reinforcement learning algorithm to solve the maximum independent set problem
inferred← citeshttps://doi.org/10.3311/ppee.7080openalex-snapshot
Formation Control of Quadrotor Helicopters with Guaranteed Collision Avoidance via Safe Path
inferred← citeshttps://doi.org/10.70675/eff54415z7c4ez475dz9c62z6cbda2665514openalex-snapshot
Calcul de plus courts chemins multicritères et problèmes géométriques connexes
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.