Pages that link to "Item:Q5955147"

The following pages link to Hard tiling problems with simple tiles (Q5955147):

Displaying 50 items.

• Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
• Fast domino tileability (Q312152) (← links)
• Maximizing Nash product social welfare in allocating indivisible goods (Q320030) (← links)
• Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
• Algorithmic complexity of proper labeling problems (Q391137) (← links)
• The complexity of generalized domino tilings (Q396923) (← links)
• Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
• Two-machine interval shop scheduling with time lags (Q892834) (← links)
• A covering problem that is easy for trees but \(\mathbf{NP}\)-complete for trivalent graphs (Q1005227) (← links)
• The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950) (← links)
• Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
• Variations of the maximum leaf spanning tree problem for bipartite graphs (Q1045917) (← links)
• Tile invariants: New horizons. (Q1401369) (← links)
• Ribbon tile invariants from the signed area (Q1601417) (← links)
• A short scientific biography of Maurice Nivat (Q1605477) (← links)
• Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
• Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
• Eulerian disjoint paths problem in grid graphs is NP-complete (Q1887070) (← links)
• The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs (Q2032841) (← links)
• Blocking total dominating sets via edge contractions (Q2034793) (← links)
• Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs (Q2077391) (← links)
• On the hardness of determining the irregularity strength of graphs (Q2089679) (← links)
• Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
• Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← links)
• The complexity of finding optimal subgraphs to represent spatial correlation (Q2149864) (← links)
• The complexity of restricted star colouring (Q2161257) (← links)
• The complexity of finding common partitions of genomes with predefined block sizes (Q2163952) (← links)
• \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\) (Q2182309) (← links)
• On minimizing the maximum color for the 1-2-3 conjecture (Q2217460) (← links)
• On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem (Q2217500) (← links)
• Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) (← links)
• The complexity of synthesizing elementary net systems relative to natural parameters (Q2304629) (← links)
• Edge weights and vertex colours: minimizing sum count (Q2334038) (← links)
• Small polyomino packing (Q2361496) (← links)
• Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity (Q2373445) (← links)
• Complexity of tiling a polygon with trominoes or bars (Q2411829) (← links)
• Connecting guards with minimum Steiner points inside simple polygons (Q2419109) (← links)
• Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
• Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
• Minimum entropy orientations (Q2517793) (← links)
• On the algorithmic complexity of zero-sum edge-coloring (Q2630333) (← links)
• An injective version of the 1-2-3 conjecture (Q2657086) (← links)
• On the semi-proper orientations of graphs (Q2663989) (← links)
• The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
• 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)