{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:14:52Z","timestamp":1649182492920},"reference-count":20,"publisher":"Informa UK Limited","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Algorithms and Applications"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1080\/10637199608915542","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T06:52:05Z","timestamp":1183791125000},"page":"21-34","source":"Crossref","is-referenced-by-count":3,"title":["SCHEDULING INTERVAL ORDERS IN PARALLEL"],"prefix":"10.1080","volume":"8","author":[{"given":"ERNST W.","family":"MAYR","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288685"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676223"},{"key":"CIT0004","unstructured":"D. Dolev , E. Upfal and M. Warmuth , Scheduling trees in parallel . In VLSI: Algorithms and Architecture!. Proceedings of the International Workshop on Parallel Computing and VLSI ( Amalfi, Italy, May 23\u201325, 1984 ), P. Bertolazzi and F. Luccio , eds. Amsterdam-New York-Oxford , Elsevier North-Holland , 1985 , 91 \u2013 102 ."},{"key":"CIT0005","volume-title":"Interval Orders and Interval Graphs. A Study of Partially Ordered Sets","author":"Fishburn P. C.","year":"1985"},{"key":"CIT0006","doi-asserted-by":"crossref","unstructured":"S. Fortune and J. Wyllie , Parallelism in random access machines . In Proceedings of the 10th Ann. ACM Symposium on Theory of Computing (San Diego, CA) , New York , ACM , ACM Press , 1978 , 114 \u2013 118 .","DOI":"10.1145\/800133.804339"},{"key":"CIT0007","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"Fulkerson D.","year":"1965","journal-title":"Pac. J. Math."},{"key":"CIT0008","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garcy M. R.","year":"1979"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1137\/0201013"},{"key":"CIT0010","doi-asserted-by":"crossref","unstructured":"D. Helmbold and E. Mayr , Applications of parallel scheduling to perfect graphs . In Proceedings of the International Workshop WG\u201986, Bernried, FRG, June 1986. Graph-Theoretic Concepts in Computer Science , G. Tinhofer and G. Schmidt , eds. , LNCS 246 , Berlin-Heidelberg-New York-London-Paris-Tokyo-Hong Kong . Springer-Verlag , 1987 , 188 \u2013 203 .","DOI":"10.1007\/3-540-17218-1_59"},{"key":"CIT0011","first-page":"39","volume-title":"Advances in Computing Research; Parallel and Distributed Computing","volume":"4","author":"Helmbold D.","year":"1987"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1137\/0216050"},{"key":"CIT0013","first-page":"67","volume-title":"Handbook of Theoretical Computer Science. Volume A Algorithms and Complexity","author":"Johnson D. S.","year":"1990"},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"D. Kozen , U. V. Vazirani and V. V. Vazirani , NC algorithms for comparability graphs, interval graphs and testing for unique perfect matching . In Proceedings Fifth Conference on Foundations of Software Technology and Theoretical Computer Science , LNCS 206 , Berlin-Heidelberg-New York-London-Paris-Tokyo-Hong Kong , Springer-Verlag , 1985 , 496 \u2013 503 .","DOI":"10.1007\/3-540-16042-6_28"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1145\/358690.363066"},{"key":"CIT0016","doi-asserted-by":"crossref","unstructured":"T. Leighton,Tight bounds on the complexity of parallel sorting. In Proceedings of the 16th Ann. ACM Symposium on Theory of Computing ( Washington, DC), New York, ACM,ACM Press,1984,71\u201380.","DOI":"10.1145\/800057.808667"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1137\/0218023"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1137\/0208031"},{"key":"CIT0019","doi-asserted-by":"crossref","unstructured":"S. Sunder and X. He , Scheduling interval ordered tasks in parallel . In Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS 93 ( W\u00fcrzburg, Germany, February 1993 ), P. Enjalbert , A. Finkel and K. Wagner , eds. , LNCS 665 , Berlin-Heidelberg-New York -London-Paris-Tokyo-Hong Kong-Barcelona-Budapest , GI, afcet , Springer-Verlag , 1993 , 100 \u2013 109 .","DOI":"10.1007\/3-540-56503-5_13"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80008-0"}],"container-title":["Parallel Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10637199608915542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T07:02:48Z","timestamp":1556607768000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10637199608915542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["10.1080\/10637199608915542"],"URL":"https:\/\/doi.org\/10.1080\/10637199608915542","relation":{},"ISSN":["1063-7192"],"issn-type":[{"value":"1063-7192","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}