Matches in DBpedia 2015-10 for { <http://doi.org/10.1016/j.jcss.2003.12.001> ?p ?o }
Showing triples 1 to 29 of
29
with 100 triples per page.
- j.jcss.2003.12.001 authorlink "Erik Demaine".
- j.jcss.2003.12.001 authorlink1 "Erik Demaine".
- j.jcss.2003.12.001 doi "10.1016/j.jcss.2003.12.001".
- j.jcss.2003.12.001 first1 "E.".
- j.jcss.2003.12.001 first1 "Erik D.".
- j.jcss.2003.12.001 first2 "M.".
- j.jcss.2003.12.001 first2 "MohammedTaghi".
- j.jcss.2003.12.001 first3 "N.".
- j.jcss.2003.12.001 first3 "Naomi".
- j.jcss.2003.12.001 first4 "P.".
- j.jcss.2003.12.001 first4 "Prabhakar".
- j.jcss.2003.12.001 first5 "D.".
- j.jcss.2003.12.001 first5 "Dimitrios".
- j.jcss.2003.12.001 isCitedBy Bakers_technique.
- j.jcss.2003.12.001 isCitedBy Clique-sum.
- j.jcss.2003.12.001 issue "2".
- j.jcss.2003.12.001 journal "J. Comput. Syst. Sci.".
- j.jcss.2003.12.001 journal "Journal of Computing and Systems Sciences".
- j.jcss.2003.12.001 last1 "Demaine".
- j.jcss.2003.12.001 last2 "Hajiaghayi".
- j.jcss.2003.12.001 last3 "Nishimura".
- j.jcss.2003.12.001 last4 "Ragde".
- j.jcss.2003.12.001 last5 "Thilikos".
- j.jcss.2003.12.001 mr "2077379".
- j.jcss.2003.12.001 pages "166–195".
- j.jcss.2003.12.001 title "Approximation algorithms for classes of graphs excluding single-crossing graphs as minors".
- j.jcss.2003.12.001 title "Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.".
- j.jcss.2003.12.001 volume "69".
- j.jcss.2003.12.001 year "2004".