Matches in DBpedia 2016-04 for { <http://doi.org/10.1016/j.tcs.2008.02.032> ?p ?o }
Showing triples 1 to 14 of
14
with 100 triples per page.
- j.tcs.2008.02.032 arxiv "0705.3748".
- j.tcs.2008.02.032 doi "10.1016/j.tcs.2008.02.032".
- j.tcs.2008.02.032 first "Oleg".
- j.tcs.2008.02.032 isCitedBy Circular_layout.
- j.tcs.2008.02.032 isCitedBy Planarity.
- j.tcs.2008.02.032 issue "1-3".
- j.tcs.2008.02.032 journal Theoretical_Computer_Science_(journal).
- j.tcs.2008.02.032 journal "Theoretical Computer Science".
- j.tcs.2008.02.032 last "Verbitsky".
- j.tcs.2008.02.032 mr "2412266".
- j.tcs.2008.02.032 pages "294–300".
- j.tcs.2008.02.032 title "On the obfuscation complexity of planar graphs".
- j.tcs.2008.02.032 volume "396".
- j.tcs.2008.02.032 year "2008".