Publications
Search

Publications :: Search

On the obfuscation complexity of planar graphs.

Show publication

On this page you see the details of the selected publication.

    Publication properties
    Title: On the obfuscation complexity of planar graphs.
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 2008
    Publication type: Conference paper
    Authors:
    No. First name Last name Show
    1. Oleg Verbitsky
    Download (by DOI): 10.1016/j.tcs.2008.02.032
    BibTeX: journals/tcs/Verbitsky08
    DBLP: db/journals/tcs/tcs396.html#Verbitsky08
    Bookmark:

    The following keywords have been assigned to this publication so far. If you have logged in, you can tag this publication with additional keywords.

    Keywords
    No keywords have been assigned to this publication yet.

    If you log in you can tag this publication with additional keywords

    A publication can refer to another publication (outgoing references) or it can be referred to by other publications (incoming references).

    Incoming References
    No incoming references have been assigned to this publication yet.
    Outgoing References
    No outgoing references have been assigned to this publication yet.

    If you log in you can add references to other publications

    A publication can be assigned to a conference, a journal or a school.

    Journal
    Name: Theor. Comput. Sci.
    Year: 2008
    Volume: 396
    Number: 1
    DBLP: db/journals/tcs/tcs396.html