Items where Subject is "Z Theory > Z.001 General"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items at this level: 14.

Klein, Rolf and Kutz, Martin (2007) Computing Geometric Minimum-Dilation Graphs is NP-Hard. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006, Karlsruhe, Germany , pp. 196-207 (Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_20).

Pach, János and Tóth, Géza (2006) Crossing number of toroidal graphs. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 334-342 (Official URL: http://dx.doi.org/10.1007/11618058_30).

Dujmovic, Vida and Wood, David R. (2006) Graph Treewidth and Geometric Thickness Parameters. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 129-140 (Official URL: http://dx.doi.org/10.1007/11618058_13).

Pelsmajer, Michael J. and Schaefer, Marcus and Stefankovic, Daniel (2006) Odd Crossing Number Is Not Crossing Number. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 386-396 (Official URL: http://dx.doi.org/10.1007/11618058_35).

De Fraysseix, Hubert and Ossona de Mendez, Patrice (2002) A Characterization of DFS Cotree Critical Graphs. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 84-95 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_7).

Abelson, David and Hong, Seok-Hee and Donald E., Taylor (2002) A Group-Theoretic Method for Drawing Graphs Symmetrically. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , pp. 86-97 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_9).

Djidjev, Hristo and Vrt'o, Imrich (2002) An Improved Lower Bound for Crossing Numbers. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 96-101 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_8).

Hlinený, Petr (2002) Crossing-Critical Graphs and Path-Width. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001, Vienna, Austria , pp. 102-114 (Official URL: http://dx.doi.org/10.1007/3-540-45848-4_9).

Ruskey, Frank (2002) Drawing Venn Diagrams. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002, Irvine, CA, USA , p. 381 (Official URL: http://dx.doi.org/10.1007/3-540-36151-0_43).

Thomas, Robin (1999) Graph Planarity and Related Topics. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 137-144 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_14).

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. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 131-142 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_364).

Brandenburg, Franz J. (1995) Designing Graph Drawings by Layout Graph Grammars. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994, Princeton, New Jersey, USA , pp. 416-427 (Official URL: http://dx.doi.org/10.1007/3-540-58950-3_395).

This list was generated on Thu Nov 27 04:04:53 2014 CET.