| | |
@article{DBLP:journals/tcs/Verbitsky08,
author = {Oleg Verbitsky},
title = {On the obfuscation complexity of planar graphs},
journal = {Theor. Comput. Sci.},
volume = {396},
number = {1-3},
year = {2008},
pages = {294-300},
ee = {http://dx.doi.org/10.1016/j.tcs.2008.02.032},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Last update 2009-06-09 CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page