Items where Subject is "Z Theory > Z.999 Others"

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 | D | E | F | G | J | K | L | M | P | R | S | W
Number of items at this level: 37.

A

Aggarwal, Alok and Kosaraju, Rao and Pop, Mihai (1998) Drawing of Two-Dimensional Irregular Meshes. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 1-14(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_1).

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).

Biedl, Therese and Thiele, Torsten and Wood, David R. (2001) Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 284-295(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_27).

Binucci, Carla and Di Giacomo, Emilio and Didimo, Walter and Montecchiani, Fabrizio and Patrignani, Maurizio and Tollis, Ioannis G. (2014) Fan-Planar Graphs: Combinatorial Properties and Complexity Results. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 186-197(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_16).

Borradaile, Glencora and Eppstein, David and Zhu, Pingan (2014) Planar Induced Subgraphs of Sparse Graphs. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 1-12(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_1).

Bose, Prosenjit and Dean, Alice M. and Hutchinson, Joan P. and Shermer, Thomas (1997) On Rectangle Visibility Graphs. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 25-44(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_35).

D

De Castro, Natalia and Cobos, F. J. and Dana, J. C. and Márquez, Alberto and Noy, M. (1999) Triangle-Free Planar Graphs as Segments Intersection Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999 , pp. 341-350(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_35).

De Fraysseix, Hubert and Ossona de Mendez, Patrice (2001) On topological aspects of orientations. [Journal (Paginated)]

De Fraysseix, Hubert and Ossona de Mendez, Patrice (1995) Regular Orientations, Arboricity, and Augmentation. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 111-118(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_362).

Dean, Alice M. (2001) A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 350-359(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_33).

Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Meijer, Henk and Wismath, Stephen (2014) Planar and Quasi Planar Simultaneous Geometric Embedding. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 52-63(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_5).

Dujmović, Vida and Whitesides, Sue (2002) An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 118-129(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_12).

Duncan, Christian A. (2015) Maximizing the Degree of (Geometric) Thickness-t Regular Graphs. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 199-204(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_17).

E

Eppstein, David (2002) Separating Thickness from Geometric Thickness. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 150-161(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_15).

F

Fox, Jacob and Tóth, Csaba D. (2007) On the Decay of Crossing Numbers. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 174-183(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_18).

G

Garg, Ashim and Rusu, Adrian (2002) Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio (Extended Abstract). In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 320-331(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_30).

J

Jensen, David (2001) Knowledge Discovery from Graphs (Invited Talk). In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , p. 170(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_16).

Jéron, Thierry and Jard, Claude (1995) 3D Layout of Reachability Graphs of Communicating Processes. In: Graph Drawing DIMACS International Workshop, GD 1994, October 10–12, 1994 , pp. 25-32(Official URL: http://dx.doi.org/10.1007/3-540-58950-3_353).

K

Kostitsyna, Irina and Nöllenburg, Martin and Polishchuk, Valentin and Schulz, André and Strash, Darren (2015) On Minimizing Crossings in Storyline Visualizations. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 192-198(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_16).

Kratochvíl, Jan (1998) Crossing Number of Abstract Topological Graphs. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 238-245(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_18).

L

Lenhart, William J. and Liotta, Giuseppe (1996) How to Draw Outerplanar Minimum Weight Triangulations. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 373-384(Official URL: http://dx.doi.org/10.1007/BFb0021821).

Lenhart, William J. and Liotta, Giuseppe (2001) Minimum Weight Drawings of Maximal Triangulations (Extended Abstract). In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 338-349(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_32).

M

Mamakani, Khalegh and Ruskey, Frank (2013) The First Simple Symmetric 11-Venn Diagram. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 563-565(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Massow, Mareike and Felsner, Stefan (2007) Thickness of Bar 1-Visibility Graphs. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 330-342(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_32).

Mustafa, Nabil H. and Pach, János (2015) On the Zarankiewicz Problem for Intersection Hypergraphs. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015 , pp. 207-216(Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_18).

P

Pach, János and Pinchasi, Rom and Tardos, Gábor and Tóth, Géza (2002) Geometric Graphs with No Self-intersecting Path of Length Three. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 295-311(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_28).

Pach, János and Tóth, Géza (1997) Graphs Drawn with Few Crossings per Edge. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996 , pp. 345-354(Official URL: http://dx.doi.org/10.1007/3-540-62495-3_59).

Pach, János and Tóth, Géza (2001) Unavoidable Configurations in Complete Topological Graphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 328-337(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_31).

Patrignani, Maurizio (2004) A Note on the Self-similarity of Some Orthogonal Drawings. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 389-394(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_39).

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 (2010) Complexity of Some Geometric and Topological Problems. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 334-344(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_32).

Shahrokhi, Farhad and Sýkora, Ondrej and Székely, László A. and Vrt'o, Imrich (1996) Crossing Numbers of Meshes. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 463-471(Official URL: http://dx.doi.org/10.1007/BFb0021830).

Soss, Michael (1998) The Size of the Open Sphere of Influence Graph in L ∞ Metric Spaces. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 458-459(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_45).

Stola, Jan (2008) Colorability in Orthogonal Graph Drawing. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 327-338(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_32).

Stola, Jan (2009) Unimaximal Sequences of Pairs in Rectangle Visibility Drawing. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 61-66(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_7).

W

Wood, David R. (2001) Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 259-271(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_25).

Wood, David R. and Telle, Jan Arne (2007) Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 150-161(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_16).

This list was generated on Wed Nov 22 14:44:23 2017 CET.