메뉴 건너뛰기




Volumn 35, Issue 5, 1998, Pages 421-440

Partitioning a sequence into few monotone subsequences

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0039988045     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050126     Document Type: Article
Times cited : (26)

References (9)
  • 1
    • 0028379002 scopus 로고
    • Variations on ray shooting
    • R. Bar Yehuda, S. Fogel: Variations on Ray Shooting, Algorithmica 11 (1994), 133-145.
    • (1994) Algorithmica , vol.11 , pp. 133-145
    • Bar Yehuda, R.1    Fogel, S.2
  • 2
    • 0002758475 scopus 로고
    • Embedding graphs in books: A layout problem with applications to VLSI design
    • F. R. Chung, F. T. Leighton, A. L. Rosenberg: Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebr. Discr. Methods., 8:33-58, (1987).
    • (1987) SIAM J. Algebr. Discr. Methods. , vol.8 , pp. 33-58
    • Chung, F.R.1    Leighton, F.T.2    Rosenberg, A.L.3
  • 3
    • 0006036921 scopus 로고
    • Some beautiful arguments using mathematical induction
    • E. W. Dijkstra: Some beautiful arguments using mathematical induction. Acta Informatica, 13:1-8, (1980).
    • (1980) Acta Informatica , vol.13 , pp. 1-8
    • Dijkstra, E.W.1
  • 4
    • 0001086798 scopus 로고
    • A combinatorial problem in geometry
    • P. Erdös, G. Szekeres: A combinatorial problem in geometry. Compositio Mathematica, 2:463-470, (1935).
    • (1935) Compositio Mathematica , vol.2 , pp. 463-470
    • Erdös, P.1    Szekeres, G.2
  • 5
    • 0003638065 scopus 로고
    • On computing the length of longest increasing subsequences
    • M. L. Fredman: On computing the length of longest increasing subsequences. Discrete Math, 11:29-35, (1975).
    • (1975) Discrete Math , vol.11 , pp. 29-35
    • Fredman, M.L.1
  • 7
    • 34250239747 scopus 로고
    • A priority queue in which initialization and queue operations take O(loglogD) time
    • D. B. Johnson: A priority queue in which initialization and queue operations take O(loglogD) time. Math. System Theory, 15:295-309, (1982).
    • (1982) Math. System Theory , vol.15 , pp. 295-309
    • Johnson, D.B.1
  • 8
    • 0023828063 scopus 로고
    • Scanline algorithms on a grid
    • R. Karlsson, M. Overmars: Scanline algorithms on a grid. BIT, 28:227-241, (1988).
    • (1988) BIT , vol.28 , pp. 227-241
    • Karlsson, R.1    Overmars, M.2


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