References
- Even , S , Pneuli , A and Lempel , A . Journal of the ACM , 19 ( 3 ) 400 – 410 .
- Bar Yehuda R. Fogel S. Partitioning a Sequence into Few Monotone Subsequences Technical Report No. 840. Technion Institute of Technology Israel 1994
- Bloniarz , P. A. and Ravi , S. S. 1985 . Lower Bound for Decomposing a Set of Points into Chains . Information Processing Letters , 31 ( 3 ) : 319 – 322 .
- Bollobas , B. and Winkler , P. 1988 . The Longest Chain among Random Points in Euclidean Space . Proceedings of the American Mathematical Society , 103 ( 2 ) : 347 – 353 .
- Fredman , M. L. 1975 . On computing the length of longest increasing subsequences . Discrete Mathematics , 11 ( 2 ) : 29 – 35 .
- Golumbic , M. C. 1980 . Algorithmic Graph Theory and Perfect Graphs , New York : Academic Press .
- Hammersley , J. M. 1972 . “ A few Seedlings of Research ” . In Proceedings of Sixth Berkeley Symposium on Mathematics, Statistics, and Probability , 345 – 394 . Berkeley : University of California Press .
- Raghvan P. Lecture Notes on Randomized algorithms IBM research report, RC 15340 (#68237), 1/9/90 1990
- Sastry , P. S. , Jayakumar , N. and Veni Madhavan , C. E. Efficient Algorithms for Domination and Hamiltonian Circuit Problems on Permutation Graphs, Proceedings of the 7th Conference on Foundation of Software Technology and Theoretical Computer Science . Lecture Notes in Computer Science NoNew York
- Supowit , K. J. 1985 . Decomposing A Set of Points into Chains, with Applications to Permutation and Circle Graphs . Information Processings Letters , 21 : 249 – 252 .
- Sen , A. , Deng , H. and Guha , S. 1992 . On a graph partitioning problem with application to VLSI layout . Information Processing Letters , 43 : 87 – 94 .
- Hsu , C. P. 1986 . Signal Routing in Integrated Circuit Layout , UMI Research Press .
- Atallah , M. J. and Kosaraju , S. R. 1986 . An Efficient Algorithm for Maxdominance, with Applications . Algorithmica , 4 ( 2 ) : 221 – 236 .
- Yu , C. W. and Chen , G. H. 1993 . Parallel Algorithms for Permutation Graphs . BIT , 33 ( 2 ) : 413 – 419 .