Domino tiling (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Domino tiling" in English language version.

refsWebsite

Global rank English rank

2^nd place

451^st place

277^th place

1,923^rd place

1,068^th place

low place

69^th place

59^th place

11^th place

8^th place

ams.org

Klarner & Pollack 1980. Klarner, David; Pollack, Jordan (1980), "Domino tilings of rectangles with fixed width", Discrete Mathematics, 32 (1): 45–52, doi:10.1016/0012-365X(80)90098-9, MR 0588907, Zbl 0444.05009
Ruskey & Woodcock 2009. Ruskey, Frank; Woodcock, Jennifer (2009), "Counting fixed-height Tatami tilings", Electronic Journal of Combinatorics, 16 (1): R126, doi:10.37236/215, MR 2558263
Erickson & Ruskey 2013. Erickson, Alejandro; Ruskey, Frank (2013), "Domino tatami covering is NP-complete", in Lecroq, Thierry; Mouchard, Laurent (eds.), Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, Lecture Notes in Computer Science, vol. 8288, Heidelberg: Springer, pp. 140–149, arXiv:1305.6669, doi:10.1007/978-3-642-45278-9_13, ISBN 978-3-642-45277-2, MR 3162068, S2CID 12738241

Erickson & Ruskey 2013. Erickson, Alejandro; Ruskey, Frank (2013), "Domino tatami covering is NP-complete", in Lecroq, Thierry; Mouchard, Laurent (eds.), Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, Lecture Notes in Computer Science, vol. 8288, Heidelberg: Springer, pp. 140–149, arXiv:1305.6669, doi:10.1007/978-3-642-45278-9_13, ISBN 978-3-642-45277-2, MR 3162068, S2CID 12738241

Klarner & Pollack 1980. Klarner, David; Pollack, Jordan (1980), "Domino tilings of rectangles with fixed width", Discrete Mathematics, 32 (1): 45–52, doi:10.1016/0012-365X(80)90098-9, MR 0588907, Zbl 0444.05009
Ruskey & Woodcock 2009. Ruskey, Frank; Woodcock, Jennifer (2009), "Counting fixed-height Tatami tilings", Electronic Journal of Combinatorics, 16 (1): R126, doi:10.37236/215, MR 2558263
Erickson & Ruskey 2013. Erickson, Alejandro; Ruskey, Frank (2013), "Domino tatami covering is NP-complete", in Lecroq, Thierry; Mouchard, Laurent (eds.), Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, Lecture Notes in Computer Science, vol. 8288, Heidelberg: Springer, pp. 140–149, arXiv:1305.6669, doi:10.1007/978-3-642-45278-9_13, ISBN 978-3-642-45277-2, MR 3162068, S2CID 12738241

Erickson & Ruskey 2013. Erickson, Alejandro; Ruskey, Frank (2013), "Domino tatami covering is NP-complete", in Lecroq, Thierry; Mouchard, Laurent (eds.), Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, Lecture Notes in Computer Science, vol. 8288, Heidelberg: Springer, pp. 140–149, arXiv:1305.6669, doi:10.1007/978-3-642-45278-9_13, ISBN 978-3-642-45277-2, MR 3162068, S2CID 12738241