On the public citation graph

Cutting and partitioning a graph after a fixed pattern

https://doi.org/10.1007/bfb0036950
0 signed · 44 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-0-8176-4842-8_10openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.1007/bf02253207openalex-snapshot
The complexity of comparability graph recognition and coloring
inferredcites →https://doi.org/10.1016/0196-6774(82)90018-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1145/322307.322309openalex-snapshot
The complexity of restricted spanning tree problems
inferredcites →https://doi.org/10.1145/800070.802179openalex-snapshot
How to assemble tree machines (Extended Abstract)
inferredcites →https://doi.org/10.1145/800070.802180openalex-snapshot
A layout strategy for VLSI which is provably good (Extended Abstract)
inferredcites →https://doi.org/10.1145/800133.804355openalex-snapshot
Node-and edge-deletion NP-complete problems
inferredcites →https://doi.org/10.2307/1969503openalex-snapshot
A Decomposition Theorem for Partially Ordered Sets
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/ecjc.20341openalex-snapshot
Algorithms for the minimum partitioning problems in graphs
inferred← citeshttps://doi.org/10.1007/11751595_83openalex-snapshot
Two-Server Network Disconnection Problem
inferred← citeshttps://doi.org/10.1007/3-540-57659-2_18openalex-snapshot
Maximizing loop parallelism and improving data locality via loop fusion and distribution
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_92openalex-snapshot
Multiway cuts in directed and node weighted graphs
inferred← citeshttps://doi.org/10.1007/3-540-59408-6_38openalex-snapshot
Approximating minimum feedback sets and multi-cuts in directed graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-15914-5_19openalex-snapshot
Parameterized Complexity of Weighted Multicut in Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_24openalex-snapshot
The Multi-multiway Cut Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_21openalex-snapshot
Correlation Clustering – Minimizing Disagreements on Arbitrary Weighted Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_1openalex-snapshot
Correlation Clustering with Partial Information
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_12openalex-snapshot
A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
inferred← citeshttps://doi.org/10.1007/bf02523685openalex-snapshot
Primal-dual approximation algorithms for integral flow and multicut in trees
inferred← citeshttps://doi.org/10.1007/pl00009191openalex-snapshot
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
inferred← citeshttps://doi.org/10.1007/s00453-018-0443-4openalex-snapshot
An FPT Algorithm for Planar Multicuts with Sources and Sinks on the Outer Face
inferred← citeshttps://doi.org/10.1007/s00454-024-00646-wopenalex-snapshot
On the Dominant of the Multicut Polytope
inferred← citeshttps://doi.org/10.1016/j.dam.2008.11.010openalex-snapshot
A simple algorithm for multicuts in planar graphs with outer terminals
inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.021openalex-snapshot
Restricted vertex multicut on permutation graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.03.003openalex-snapshot
Parameterized complexity dichotomy for Steiner Multicut
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.05.008openalex-snapshot
Correlation clustering in general weighted graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.026openalex-snapshot
The multi-multiway cut problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.003openalex-snapshot
On the hardness of finding near-optimal multicuts in directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.015openalex-snapshot
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
inferred← citeshttps://doi.org/10.1017/s0960129524000124openalex-snapshot
An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties
inferred← citeshttps://doi.org/10.1038/s41598-019-53585-5openalex-snapshot
A QUBO Formulation of Minimum Multicut Problem Instances in Trees for D-Wave Quantum Annealers
inferred← citeshttps://doi.org/10.1134/s1064230706040083openalex-snapshot
Models and methods for solving the problem of network vulnerability
inferred← citeshttps://doi.org/10.1137/s0097539792225297openalex-snapshot
The Complexity of Multiterminal Cuts
inferred← citeshttps://doi.org/10.1145/129712.129736openalex-snapshot
The complexity of multiway cuts (extended abstract)
inferred← citeshttps://doi.org/10.1145/167088.167266openalex-snapshot
Approximate max-flow min-(multi)cut theorems and their applications
inferred← citeshttps://doi.org/10.1145/1993636.1993699openalex-snapshot
Fixed-parameter tractability of multicut parameterized by the size of the cutset
inferred← citeshttps://doi.org/10.1145/276627.276653openalex-snapshot
Cut as a querying unit for WWW, Netnews, e-mail
inferred← citeshttps://doi.org/10.1145/3035918.3064010openalex-snapshot
Synthesizing Mapping Relationships Using Table Corpus
inferred← citeshttps://doi.org/10.24355/dbbs.084-200605170200-19openalex-snapshot
Increasing distances in graphs
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.