Author:
Yang Bing,Chen Jing,Lu En-Yue,Zheng Si-Qing
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software
Reference17 articles.
1. Erdös P, Szekeres G. A combinatorial problem in geometry. Compositio Mathematica, 1935, 2: 463–470.
2. Yehuda R B, Fogel S. Partitioning a sequence into few monotone subsequences. Acta Informatica, 1998, 35(5): 421–440.
3. Fomin F V, Kratsch D, Novelli J. Approximating minimum cocolorings. Information Processing Letters, 2002, 84(5): 285–290.
4. Brandstädt A, Kratsch D. On partitions of permutations into increasing and decreasing subsequences. Elektron. Inf. Verarb. Kybern., 1986, 22: 263–273.
5. Wagner K. Monotonic coverings of finite sets. Elektron. Inf. Verarb. Kybern., Dec. 1984, 20(12): 633–639.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献