Pages that link to "Item:Q2902905"

The following pages link to Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography (Q2902905):

Displayed 14 items.

• Reconstruction of convex polyominoes with a blocking component (Q265062) ‎ (← links)
• Colour degree matrices of graphs with at most one cycle (Q298973) ‎ (← links)
• Reconstructing binary matrices with timetabling constraints (Q350725) ‎ (← links)
• A note on packing of graphic \(n\)-tuples (Q501040) ‎ (← links)
• Navigating between packings of graphic sequences (Q2026343) ‎ (← links)
• On polyatomic tomography over abelian groups: some remarks on consistency, tree packings and complexity (Q2197684) ‎ (← links)
• Half-regular factorizations of the complete bipartite graph (Q2399287) ‎ (← links)
• A formulation of the wide partition conjecture using the atom problem in discrete tomography (Q2440106) ‎ (← links)
• Constructing bounded degree graphs with prescribed degree and neighbor degree sequences (Q2696614) ‎ (← links)
• Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (Q3449866) ‎ (← links)
• On Double-Resolution Imaging and Discrete Tomography (Q4568092) ‎ (← links)
• Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) ‎ (← links)
• Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs (Q5219669) ‎ (← links)
• On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition (Q5237060) ‎ (← links)