Pages that link to "Item:Q5955147"
From MaRDI portal
The following pages link to Hard tiling problems with simple tiles (Q5955147):
Displaying 24 items.
- The complexity of blocking (semi)total dominating sets with edge contractions (Q2690876) (← links)
- Decomposing Cubic Graphs into Connected Subgraphs of Size Three (Q2817881) (← links)
- Planar Embeddings with Small and Uniform Faces (Q2942666) (← links)
- On the Number of Neighbors in Normal Tiling (Q2968511) (← links)
- Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
- A new mathematical model for tiling finite regions of the plane with polyominoes (Q3303533) (← links)
- Idiot-proof tiles (Q3981392) (← links)
- A neural network approach to tiling problems (Q4328848) (← links)
- Narrowing down the hardness barrier of synthesizing elementary net systems (Q5009430) (← links)
- The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues (Q5044398) (← links)
- NP‐completeness of list coloring and precoloring extension on the edges of planar graphs (Q5311921) (← links)
- Hard and easy instances of L-tromino tilings (Q5919532) (← links)
- Obtaining a proportional allocation by deleting items (Q5925523) (← links)
- Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)
- A notion of vertex equitability for proper labellings (Q6153474) (← links)
- Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (Q6174144) (← links)
- On the \(d\)-claw vertex deletion problem (Q6182678) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← links)
- The complexity of iterated reversible computation (Q6566596) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)
- The complexity of finding and enumerating optimal subgraphs to represent spatial correlation (Q6623585) (← links)
- Adding direction constraints to the 1-2-3 conjecture (Q6652479) (← links)
- Graphs whose vertices of degree at least 2 lie in a triangle (Q6667338) (← links)