On the public citation graph

Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography

https://doi.org/10.1137/100799733
0 signed · 47 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.1002/jgt.3190150209openalex-snapshot
Seven criteria for integer sequences being graphic
inferredcites →https://doi.org/10.1007/978-0-8176-4543-4openalex-snapshot
Advances in Discrete Tomography and Its Applications
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_17openalex-snapshot
A Theorem on Flows in Networks
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_18openalex-snapshot
Combinatorial Properties of Matrices of Zeros and Ones
inferredcites →https://doi.org/10.1007/bf02020548openalex-snapshot
Valencies of graphs with 1-factors
inferredcites →https://doi.org/10.1016/0012-365x(73)90037-xopenalex-snapshot
Algorithms for constructing graphs and digraphs with given valences and factors
inferredcites →https://doi.org/10.1016/0012-365x(73)90068-xopenalex-snapshot
The k-factor conjecture is true
inferredcites →https://doi.org/10.1016/0024-3795(80)90105-6openalex-snapshot
Matrices of zeros and ones with fixed row and column sum vectors
inferredcites →https://doi.org/10.1016/0024-3795(80)90228-1openalex-snapshot
On Ryser's maximum term rank formula
inferredcites →https://doi.org/10.1016/0196-6774(85)90022-7openalex-snapshot
An algorithmic proof of Tutte's f-factor theorem
inferredcites →https://doi.org/10.1016/j.dam.2010.09.011openalex-snapshot
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem
inferredcites →https://doi.org/10.1016/s0304-3975(02)00032-4openalex-snapshot
Tiling with bars under tomographic constraints
inferredcites →https://doi.org/10.1016/s0304-3975(02)00542-xopenalex-snapshot
On tiling under tomographic constraints
inferredcites →https://doi.org/10.1016/s0304-3975(97)00298-3openalex-snapshot
On the computational complexity of determining polyatomic structures by X-rays
inferredcites →https://doi.org/10.1016/s0304-3975(99)00312-6openalex-snapshot
Reconstruction of domino tiling from its two orthogonal projections
inferredcites →https://doi.org/10.1016/s0304-3975(99)00325-4openalex-snapshot
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
inferredcites →https://doi.org/10.1090/s0002-9904-1960-10494-6openalex-snapshot
Matrices of zeros and ones
inferredcites →https://doi.org/10.1137/0110037openalex-snapshot
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
inferredcites →https://doi.org/10.21136/cpm.1955.108220openalex-snapshot
A remark on the existence of finite graphs
inferredcites →https://doi.org/10.2140/pjm.1957.7.1073openalex-snapshot
A theorem on flows in networks
inferredcites →https://doi.org/10.4153/cjm-1957-044-3openalex-snapshot
Combinatorial Properties of Matrices of Zeros and Ones

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-14085-4_16openalex-snapshot
On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
inferred← citeshttps://doi.org/10.1007/978-3-032-09544-2_8openalex-snapshot
Tilepaint and Aquarium Puzzles in Periodic Grids
inferred← citeshttps://doi.org/10.1007/978-3-319-09955-2_21openalex-snapshot
Discrete Tomography Reconstruction Algorithms for Images with a Blocking Component
inferred← citeshttps://doi.org/10.1007/978-3-319-68560-1_52openalex-snapshot
A Convexity Measure for Gray-Scale Images Based on hv-Convexity
inferred← citeshttps://doi.org/10.1007/978-3-642-37067-0_26openalex-snapshot
On the Degree Sequences of Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00026-024-00715-0openalex-snapshot
Sequential Stub Matching for Asymptotically Uniform Generation of Directed Graphs with a Given Degree Sequence
inferred← citeshttps://doi.org/10.1007/s00454-020-00180-5openalex-snapshot
On Polyatomic Tomography over Abelian Groups: Some Remarks on Consistency, Tree Packings and Complexity
inferred← citeshttps://doi.org/10.1016/j.dam.2013.11.022openalex-snapshot
A formulation of the wide partition conjecture using the atom problem in discrete tomography
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.025openalex-snapshot
Colour degree matrices of graphs with at most one cycle
inferred← citeshttps://doi.org/10.1016/j.dam.2017.06.003openalex-snapshot
Half-regular factorizations of the complete bipartite graph
inferred← citeshttps://doi.org/10.1016/j.dam.2018.06.034openalex-snapshot
Navigating between packings of graphic sequences
inferred← citeshttps://doi.org/10.1016/j.dam.2023.02.004openalex-snapshot
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
inferred← citeshttps://doi.org/10.1016/j.disc.2015.07.017openalex-snapshot
A note on packing of graphic n -tuples
inferred← citeshttps://doi.org/10.1016/j.endm.2013.10.055openalex-snapshot
The Wide Partition Conjecture and the Atom Problem in Discrete Tomography
inferred← citeshttps://doi.org/10.1016/j.jda.2016.07.001openalex-snapshot
Reconstructing binary matrices with timetabling constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.016openalex-snapshot
Reconstruction of convex polyominoes with a blocking component
inferred← citeshttps://doi.org/10.1137/140987912openalex-snapshot
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem
inferred← citeshttps://doi.org/10.1137/17m1115629openalex-snapshot
On Double-Resolution Imaging and Discrete Tomography
inferred← citeshttps://doi.org/10.1287/moor.2017.0881openalex-snapshot
Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
inferred← citeshttps://doi.org/10.1287/moor.2017.0883openalex-snapshot
Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs
inferred← citeshttps://doi.org/10.14232/phd.2719openalex-snapshot
Application of Discrete Tomographic Methods in Nondestructive Testing and Materials Science
inferred← citeshttps://doi.org/10.1515/9783110560855-013openalex-snapshot
13. On the reconstruction of static and dynamic discrete structures
inferred← citeshttps://doi.org/10.3233/fi-2013-866openalex-snapshot
Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge
inferred← citeshttps://doi.org/10.3233/fi-2014-1111openalex-snapshot
A New Approach for the Reconstruction of Object-Based Images in Discrete Tomography
inferred← citeshttps://doi.org/10.3233/fi-2017-1588openalex-snapshot
Reconstructing Binary Matrices under Window Constraints from their Row and Column Sums
inferred← citeshttps://doi.org/10.48550/arxiv.1309.7832openalex-snapshot
Characterization of the degree sequences of (quasi) regular uniform hypergraphs
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.