메뉴 건너뛰기




Volumn 3354, Issue , 2005, Pages 128-139

Ordering and convex polyominoes

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; MATRIX ALGEBRA; SET THEORY;

EID: 24144440393     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31834-7_10     Document Type: Conference Paper
Times cited : (14)

References (14)
  • 1
    • 0030108487 scopus 로고    scopus 로고
    • Reconstructing convex polyominoes from horizontal and vertical projections
    • Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.:Reconstructing convex polyominoes from horizontal and vertical projections. Theoret. Comput. Sci. 155 (1996) 321-347.
    • (1996) Theoret. Comput. Sci. , vol.155 , pp. 321-347
    • Barcucci, E.1    Del Lungo, A.2    Nivat, M.3    Pinzani, R.4
  • 2
    • 0002314615 scopus 로고    scopus 로고
    • A method for the enumeration of various classes of columnconvex polygons
    • Bousquet-Mélou, M.: A method for the enumeration of various classes of columnconvex polygons. Discrete Math. 155 (1996) 1-25.
    • (1996) Discrete Math. , vol.155 , pp. 1-25
    • Bousquet-Mélou, M.1
  • 7
    • 9644309537 scopus 로고
    • Une Généralisation des théorèmes de Higman et de Simon aux Mots Infinis
    • Finkel, A.: Une Généralisation des théorèmes de Higman et de Simon aux Mots Infinis. Theoret. Comput. Sci. 38 (1985) 137-142
    • (1985) Theoret. Comput. Sci. , vol.38 , pp. 137-142
    • Finkel, A.1
  • 9
    • 84963086911 scopus 로고
    • Ordering by divisibility in abstract algebra
    • Higman, G.H.: Ordering by divisibility in abstract algebra. Proc. London Math. Soc. 2 (1952) 326-336
    • (1952) Proc. London Math. Soc. , vol.2 , pp. 326-336
    • Higman, G.H.1
  • 10
    • 84916498981 scopus 로고
    • Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture
    • Kruskal, J.B.: Well-quasi-ordering, the Tree Theorem, and Vazsonyi's conjecture. Trans. Amer. Math. Soc. 95 (1960) 210-225
    • (1960) Trans. Amer. Math. Soc. , vol.95 , pp. 210-225
    • Kruskal, J.B.1
  • 11
    • 0000429352 scopus 로고
    • The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept
    • Kruskal, J.B.: The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept. J. Combin. Theory Ser. A 13 (1972) 297-305
    • (1972) J. Combin. Theory Ser. A , vol.13 , pp. 297-305
    • Kruskal, J.B.1
  • 12
    • 0037062723 scopus 로고    scopus 로고
    • Reconstruction of convex 2D discrete sets in polynomial time
    • Kuba, A., Balogh, E.: Reconstruction of convex 2D discrete sets in polynomial time, Theoret. Comput. Sci. 283 (2002) 223-242.
    • (2002) Theoret. Comput. Sci. , vol.283 , pp. 223-242
    • Kuba, A.1    Balogh, E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.