Graph drawing, computing with curves on surfaces, string graphs

UR-CS Participating Faculty: Daniel Stefankovic

Project Description

This project studies theoretical problems arising in the area of graph drawing (network diagram visualization). Examples of questions studied are:

Bibliography

This is a list of selected journal (except when the work has not yet appeared in journal/book form) papers, from or related to this project, by University of Rochester authors.

  1. Michael Pelsmajer, Marcus Schaefer, and Daniel Stefankovic.
    Odd crossing number is not crossing number.
    Graph Drawing, 2005, LNCS 3843, p. 386-396, Springer Verlag, 2005.

  2. Marcus Schaefer and Daniel Stefankovic.
    Decidability of string graphs.
    J. Comput. System Sci., 68:2, p. 319-334, 2004.
    A preliminary version appeared in STOC 2001, p. 241-246.

  3. Marcus Schaefer, Eric Sedgwick, and Daniel Stefankovic.
    String graphs in NP.
    J. Comput. System Sci. 67:2, p. 365-380, 2003.
    A preliminary version appered in STOC 2002, p. 1-6.

  4. Marcus Schaefer, Eric Sedgwick, and Daniel Stefankovic.
    Algorithms for normal curves and surfaces.
    COCOON 2002, p. 370-380, 2002.

  5. Peter Hui, Marcus Schaefer, and Daniel Stefankovic.
    Graph Drawing, 2004, LNCS 3383, Springer-Verlag, 2004, p. 318-328.