On the public citation graph

https://doi.org/10.4086/toc.2013.v009a024

0 signed · 34 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_22openalex-snapshot
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
inferredcites →https://doi.org/10.1007/978-3-642-32512-0_26openalex-snapshot
Hardness of Vertex Deletion and Project Scheduling
inferredcites →https://doi.org/10.1007/bf01200760openalex-snapshot
Packing directed circuits fractionally
inferredcites →https://doi.org/10.1007/pl00009191openalex-snapshot
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
inferredcites →https://doi.org/10.1007/s00236-004-0150-2openalex-snapshot
Project scheduling with irregular costs: complexity, approximability, and algorithms
inferredcites →https://doi.org/10.1016/0377-2217(94)00187-hopenalex-snapshot
The discrete time-cost tradeoff problem revisited
inferredcites →https://doi.org/10.1109/12.312117openalex-snapshot
Deleting vertices to bound path length
inferredcites →https://doi.org/10.1109/afips.1959.79openalex-snapshot
Critical-Path Planning and Scheduling
inferredcites →https://doi.org/10.1109/focs.2009.23openalex-snapshot
Optimal Long Code Test with One Free Bit
inferredcites →https://doi.org/10.1109/sfcs.1988.21958openalex-snapshot
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
inferredcites →https://doi.org/10.1137/090756144openalex-snapshot
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
inferredcites →https://doi.org/10.1145/1374376.1374414openalex-snapshot
Optimal algorithms and inapproximability results for every CSP?
inferredcites →https://doi.org/10.1145/1460299.1460318openalex-snapshot
Critical-path planning and scheduling
inferredcites →https://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferredcites →https://doi.org/10.1145/509907.510017openalex-snapshot
On the power of unique 2-prover 1-round games
inferredcites →https://doi.org/10.1287/mnsc.7.2.167openalex-snapshot
A Network Flow Computation for Project Cost Curves
inferredcites →https://doi.org/10.1287/moor.23.4.909openalex-snapshot
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
inferredcites →https://doi.org/10.1287/opre.9.3.296openalex-snapshot
Critical-Path Planning and Scheduling: Mathematical Basis
inferredcites →https://doi.org/10.4007/annals.2005.162.439openalex-snapshot
On the hardness of approximating vertex cover
inferredcites →https://doi.org/10.4007/annals.2010.171.295openalex-snapshot
Noise stability of functions with low influences: Invariance and optimality
inferredcites →https://doi.org/10.4086/tocopenalex-snapshot
Theory of Computing

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-17402-6_21openalex-snapshot
Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_3openalex-snapshot
Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth
inferred← citeshttps://doi.org/10.1007/s10107-022-01777-9openalex-snapshot
Approximating the discrete time-cost tradeoff problem with bounded depth
inferred← citeshttps://doi.org/10.1016/j.dam.2021.09.003openalex-snapshot
Target set selection for conservative populations
inferred← citeshttps://doi.org/10.1016/j.disopt.2022.100740openalex-snapshot
Parameterized algorithms for generalizations of Directed Feedback Vertex Set
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103730openalex-snapshot
Search-space reduction via essential vertices revisited: Vertex multicut and cograph deletion
inferred← citeshttps://doi.org/10.1137/1.9781611974782.160openalex-snapshot
Optimization of Bootstrapping in Circuits
inferred← citeshttps://doi.org/10.1137/16m1070670openalex-snapshot
Inapproximability of $H$-Transversal/Packing
inferred← citeshttps://doi.org/10.1201/b19714-12openalex-snapshot
Gate Sizing
inferred← citeshttps://doi.org/10.1287/moor.2017.0918openalex-snapshot
No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ
inferred← citeshttps://doi.org/10.3390/a11010010openalex-snapshot
Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis
inferred← citeshttps://doi.org/10.4086/toc.2016.v012a006openalex-snapshot
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.