Items where Subject is "M Methods > M.100 Algebraic"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creators Name | Item Type
Jump to: A | B | C | D | E | F | G | K | R | S | T
Number of items at this level: 18.

A

Abbot, Alastair A. and Dinneen, Dr. Michael J. (2008) An Investigation of Algorithms to Aesthetically Draw Cayley Graphs. [Departmental Technical Report] (Unpublished)

B

Bannister, Michael J. and Devanny, William E. and Eppstein, David and Goodrich, Michael T. (2014) The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 149-161(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_13).

Brandes, Ulrik and Pich, Christian (2007) Eigensolver Methods for Progressive Multidimensional Scaling of Large Data. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 42-53(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_6).

Brandes, Ulrik and Mader, Martin (2012) A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 99-110(Official URL: http://dx.doi.org/ 10.1007/978-3-642-25878-7_11).

C

Civril, Ali and Magdon-Ismail, Malik and Bocek-Rivele, Eli (2006) SDE: Graph Drawing Using Spectral Distance Embedding. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 512-513(Official URL: http://dx.doi.org/10.1007/11618058_48).

Civril, Ali and Magdon-Ismail, Malik and Bocek-Rivele, Eli (2007) SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 30-41(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_5).

D

Dwyer, Tim and Marriott, Kim (2008) Constrained Stress Majorization Using Diagonally Scaled Gradient Projection. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 219-230(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_23).

Dwyer, Tim and Robertson, George (2010) Layout with Circular and Other Non-linear Constraints Using Procrustes Projection. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 393-404(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_37).

E

Emiris, Ioannis Z. and Tsigaridas, Elias P. and Varvitsiotis, Antonios E. (2010) Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 195-200(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_19).

F

Fulek, Radoslav and Kynčl, Jan and Malinović, Igor and Pálvölgyi , Dömötör (2014) Clustered Planarity Testing Revisited. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 428-439(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_36).

G

Gotsman, Craig and Koren, Yehuda (2004) Distributed Graph Layout for Sensor Networks. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 273-284(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_28).

Gropp, Harald (1996) The Drawing of Configurations. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 267-276(Official URL: http://dx.doi.org/10.1007/BFb0021810).

K

Klimenta, Mirza and Brandes, Ulrik (2013) Graph Drawing by Classical Multidimensional Scaling: New Perspectives. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 55-66(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Kratochvíl, Jan and Przytycka, Teresa (1996) Grid Intersection and Box Intersection Graphs on Surfaces. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 365-372(Official URL: http://dx.doi.org/10.1007/BFb0021820).

Kynčl, Jan (2015) Simple Realizability of Complete Abstract Topological Graphs Simplified. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 309-320(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_26).

R

Ruis-Vargas, Andres J. and Suk, Andrew and Tóth, Csaba D. (2014) Disjoint Edges in Topological Graphs and the Tangled-Thrackle Conjecture. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 284-293(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_24).

S

Schaefer, Marcus and Štefankovič, Daniel (2015) The Degenerate Crossing Number and Higher-Genus Embeddings. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 63-74(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_6).

T

Tsiaras, Vassilis and Tollis, Ioannis G. and Sakkalis, Vangelis (2009) Brain Network Analyzer. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 451-452(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_51).

This list was generated on Wed Nov 22 07:04:22 2017 CET.