![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/isa/LeeS91
@inproceedings{DBLP:conf/isa/LeeS91, author = {D. T. Lee and Majid Sarrafzadeh}, editor = {Wen{-}Lian Hsu and Richard C. T. Lee}, title = {Maximum Independent Set of a Permutation Graph in \emph{k} Tracks}, booktitle = {{ISA} '91 Algorithms, 2nd International Symposium on Algorithms, Taipei, Republic of China, December 16-18, 1991, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {557}, pages = {2--11}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-54945-5\_43}, doi = {10.1007/3-540-54945-5\_43}, timestamp = {Tue, 14 May 2019 10:00:42 +0200}, biburl = {https://dblp.org/rec/conf/isa/LeeS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.