[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/ppl/AliE93>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Hesham_El-Rewini>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Hesham_H._Ali>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1142%2FS0129626493000083>
foaf:homepage <https://doi.org/10.1142/S0129626493000083>
dc:identifier DBLP journals/ppl/AliE93 (xsd:string)
dc:identifier DOI doi.org%2F10.1142%2FS0129626493000083 (xsd:string)
dcterms:issued 1993 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/ppl>
rdfs:label The Time complexity of Scheduling Interval Orders with Communication Is Polynomial. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Hesham_El-Rewini>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Hesham_H._Ali>
swrc:pages 53-58 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/ppl/AliE93/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/ppl/AliE93>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/ppl/ppl3.html#AliE93>
rdfs:seeAlso <https://doi.org/10.1142/S0129626493000083>
dc:title The Time complexity of Scheduling Interval Orders with Communication Is Polynomial. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 3 (xsd:string)