Browse by Author

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 27.

Conference Paper

Pach, János and Tóth, Géza (2017) Many Touchings Force Many Crossings. In: Graph Drawing and Network Visualization, GD 2017, September 25-27 , pp. 153-159(Official URL: https://doi.org/10.1007/978-3-319-73915-1_13).

Fulek, Radoslav and Pach, János (2017) Thrackles: An Improved Upper Bound. In: Graph Drawing and Network Visualization. GD 2017, September 25-27 , pp. 160-168(Official URL: https://doi.org/10.1007/978-3-319-73915-1_14).

Fox, Jacob and Pach, János and Suk, Andrew (2016) Approximating the Rectilinear Crossing Number. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 413-426(Official URL: http://dx.doi.org/10.1007/978-3-319-50106-2_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).

Frati, Fabrizio and Kaufmann, Michael and Pach, János and Tóth, Csaba D. and Wood, David R. (2013) On the Upward Planarity of Mixed Plane Graphs. In: 21st International Symposium, GD 2013 , September 23-25, 2013 , pp. 1-12(Official URL: http://dx.doi.org/10.1007/978-3-319-03841-4_1).

Nivasch, Gabriel and Pach, János and Tardos, Gábor (2013) The Visible Perimeter of an Arrangement of Disks. In: 20th International Symposium, GD 2012, September 19-21, 2012 , pp. 364-375(Official URL: http://link.springer.com/chapter/10.1007/978-3-642...).

Pach, János (2012) Every Graph Admits an Unambiguous Bold Drawing. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 332-342(Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_32).

Pach, János and Tóth, Géza (2012) Monotone Crossing Number. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 278-289(Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_27).

Keszegh, Balázs and Pach, János and Pálvölgyi, Dömötör (2011) Drawing Planar Graphs of Bounded Degree with Few Slopes. In: Graph Drawing 18th International Symposium, GD 2010, September 21-24, 2010 , pp. 293-304(Official URL: http://dx.doi.org/10.1007/978-3-642-18469-7_27).

Dumitrescu, Adrian and Pach, János and Tóth, Géza (2010) Drawing Hamiltonian Cycles with No Large Angles. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , pp. 3-14(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_3).

Pach, János (2010) Why Are String Graphs So Beautiful? (Extended Abstract). In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009 , p. 1(Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_1).

Keszegh, Balázs and Pach, János and Pálvölgyi, Dömötör and Tóth, Géza (2009) Cubic Graphs Have Bounded Slope Parameter. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008 , pp. 50-60(Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_6).

Fox, Jacob and Pach, János and Tóth, Csaba D. (2008) A Bipartite Strengthening of the Crossing Lemma. In: Graph Drawing 15th International Symposium, GD 2007, September 24-26, 2007 , pp. 13-24(Official URL: http://dx.doi.org/10.1007/978-3-540-77537-9_4).

Keszegh, Balázs and Pach, János and Pálvölgyi, Dömötör and Tóth, Géza (2007) Drawing cubic graphs with at most five slopes. In: Graph Drawing 14th International Symposium, GD 2006, September 18-20, 2006 , pp. 114-125(Official URL: http://dx.doi.org/10.1007/978-3-540-70904-6_13).

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 , pp. 334-342(Official URL: http://dx.doi.org/10.1007/11618058_30).

Pach, János and Tóth, Géza (2004) How Many Ways Can One Draw a Graph? In: Graph Drawing 11th International Symposium, GD 2003, September 21-24, 2003 , pp. 47-58(Official URL: http://dx.doi.org/10.1007/978-3-540-24595-7_5).

Kynčl, Jan and Pach, János and Tóth, Géza (2004) Long Alternating Paths in Bicolored Point Sets. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004 , pp. 340-348(Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_34).

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 (2002) Recognizing String Graphs Is Decidable. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 247-260(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_20).

Pach, János and Tardos, Gábor (2002) Untangling a Polygon. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 154-161(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_13).

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

Pach, János and Wenger, Rephael (1998) Embedding Planar Graphs at Fixed Vertex Locations. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998 , pp. 263-274(Official URL: http://dx.doi.org/10.1007/3-540-37623-2_20).

Pach, János and Thiele, Torsten and Tóth, Géza (1998) Three-Dimensional Grid Drawings of Graphs. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997 , pp. 47-51(Official URL: http://dx.doi.org/10.1007/3-540-63938-1_49).

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

Agarwal, Pankaj K. and Aronov, Boris and Pach, János and Pollack, Richard and Sharir, Micha (1996) Quasi-Planar Graphs Have a Linear Number of Edges. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 1-7(Official URL: http://dx.doi.org/10.1007/BFb0021784).

Journal (Paginated)

De Fraysseix, Hubert and Ossona de Mendez, Patrice and Pach, János (1995) A Left-First Search Algorithm for Planar Graphs. [Journal (Paginated)]

De Fraysseix, Hubert and Ossona de Mendez, Patrice and Pach, János (1991) Representation of planar graphs by segments. [Journal (Paginated)]

This list was generated on Mon Jul 6 00:59:19 2020 CEST.