Matches in DBpedia 2015-10 for { <http://doi.org/10.1016/S0304-3975(99)00152-8> ?p ?o }
Showing triples 1 to 13 of
13
with 100 triples per page.
- S0304-3975(99)00152-8 doi "10.1016/S0304-397500152-8".
- S0304-3975(99)00152-8 first1 "Thomas".
- S0304-3975(99)00152-8 first2 "Klaus".
- S0304-3975(99)00152-8 isCitedBy Edge_coloring.
- S0304-3975(99)00152-8 issue "1–2".
- S0304-3975(99)00152-8 journal "Theoretical Computer Science".
- S0304-3975(99)00152-8 last1 "Erlebach".
- S0304-3975(99)00152-8 last2 "Jansen".
- S0304-3975(99)00152-8 mr "1819065".
- S0304-3975(99)00152-8 pages "33–50".
- S0304-3975(99)00152-8 title "The complexity of path coloring and call scheduling".
- S0304-3975(99)00152-8 volume "255".
- S0304-3975(99)00152-8 year "2001".