Items where Subject is "G Algorithms and Complexity > G.910 Symmetries"
Group by: Creators Name | Item Type Number of items at this level: 16. AAbbot, Alastair A. and Dinneen, Dr. Michael J. (2008) An Investigation of Algorithms to Aesthetically Draw Cayley Graphs. [Departmental Technical Report] (Unpublished) 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 , pp. 86-97(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_9). BBachl, Sabine (1999) Isomorphic Subgraphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 286-296(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_30). Buchheim, Christoph and Hong, Seok-Hee (2005) Crossing Minimization for Symmetries. [Journal (Paginated)] Buchheim, Christoph and Hong, Seok-Hee (2002) Crossing Minimization for Symmetries. In: 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002), November 20-23, 2002 , pp. 563-574(Official URL: http://dx.doi.org/10.1007/3-540-36136-7_49). Buchheim, Christoph and Jünger, Michael (2004) An Integer Programming Approach to Fuzzy Symmetry Detection. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 166-177(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_16). Buchheim, Christoph and Jünger, Michael (2002) Detecting Symmetries by Branch & Cut. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 178-188(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_15). CChen, Ho-Lin and Lu, Hsueh-I. and Yen, Hsu-Chun (2001) On Maximum Symmetric Subgraphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 372-383(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_35). DDe Fraysseix, Hubert (1999) An Heuristic for Graph Symmetry Detection. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 276-285(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_29). Delgado-Friedrichs, Olaf (2004) Barycentric Drawings of Periodic Graphs. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 178-189(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_17). HHong, Seok-Hee (2002) Drawing Graphs Symmetrically in Three Dimensions. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 189-204(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_16). Hong, Seok-Hee and Eades, Peter (2004) A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 307-317(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_31). Hong, Seok-Hee and Eades, Peter (2001) An Algorithm for Finding Three Dimensional Symmetry in Trees. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 360-371(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_34). Hong, Seok-Hee and Eades, Peter and Quigley, Aaron and Lee, Sang-Ho (1998) Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 198-209(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_15). PPurchase, Helen C. and Cohen, Robert F. and James, Murray (1996) Validating Graph Drawing Aesthetics. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 435-446(Official URL: http://dx.doi.org/10.1007/BFb0021827). SSugiyama, Kozo and Hong, Seok-Hee and Maeda, Atsuhiko (2004) The Puzzle Layout Problem. In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 500-501(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_50). |