Browse by Classification

Klein, Rolf and Kutz, Martin (2007) Computing Geometric Minimum-Dilation Graphs is NP-Hard. [Conference Paper]

Pach, János and Tóth, Géza (2006) Crossing number of toroidal graphs. [Conference Paper]

Dujmovic, Vida and Wood, David R. (2006) Graph Treewidth and Geometric Thickness Parameters. [Conference Paper]

Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2006) Odd Crossing Number Is Not Crossing Number. [Conference Paper]

de Fraysseix, Hubert and Ossona de Mendez, Patrice (2002) A Characterization of DFS Cotree Critical Graphs. [Conference Paper]

Abelson, David and Hong, Seok-Hee and Donald E., Taylor (2002) A Group-Theoretic Method for Drawing Graphs Symmetrically. [Conference Paper]

Djidjev, Hristo and Vrt'o, Imrich (2002) An Improved Lower Bound for Crossing Numbers. [Conference Paper]

Hlinený, Petr (2002) Crossing-Critical Graphs and Path-Width. [Conference Paper]

Ruskey, Frank (2002) Drawing Venn Diagrams. [Conference Paper]

Thomas, Robin (1999) Graph Planarity and Related Topics. [Conference Paper]

de Fraysseix, Hubert and Ossona de Mendez, Patrice (1997) Planarity and edge poset dimension. [Journal (Paginated)]

de Fraysseix, Hubert and Ossona de Mendez, Patrice and Rosenstiehl, Pierre (1995) Bipolar orientations revisited. [Journal (Paginated)]

Shahrokhi, Farhad and Székely, László A. and Vrt'o, Imrich (1995) Crossing Numbers of Graphs, Lower Bound Techniques and Algorithms: A Survey. [Conference Paper]