Publications
Publications
[1] G. Csizmadia, G. Tóth: Note on a Ramsey-Type problem in
Geometry, Journal of Combinatorial Theory, Series A 65 (1994), 302-306.
ps
pdf
[2] M. Bóna, G. Tóth: A Ramsey-type problem on right-angled
triangles in space, Discrete Mathematics 150 (1996), 61-67.
ps
pdf
[3] J. Pach, G. Tóth: On the Independence Number of Coin Graphs,
Geombinatorics 6, Issue 1 (1996), 30-33.
ps
pdf
[4] G. Tóth: A Ramsey-type bound for rectangles, Journal of
Graph Theory 23 (1996), 53-56.
ps
pdf
[5] G. Tóth: The shortest distance among points in general
position, Computational Geometry: Theory and Applications
8/1 (1997), 33-38.
ps
pdf
[6] G. Károlyi, J. Pach, G. Tóth: Ramsey-Type Results for
Geometric Graphs. I, Discrete and Computational Geometry 18 (1997), 247-255.
Also in:
Proceedings of the 12th Annual ACM Symposium on
Computational Geometry 1996, 359-365.
ps
pdf
[7] G. Károlyi, J. Pach, G. Tardos, G. Tóth:
An algorithm for finding many disjoint monochromatic edges in a
complete 2-colored geometric graph, in: Intuitive Geometry,
(I. Bárány, K. Böröczky, eds.), Bolyai Soc. Math. Studies 6,
J. Bolyai Math. Society, Budapest, 1997, 367-372.
ps
pdf
[8] J. Pach, G. Tóth: Graphs drawn with few crossings per edge,
Lecture Notes in Computer Science 1190, Springer-Verlag, 1997,
345--354.
Also in: Combinatorica 17 (1997), 427-439.
ps
pdf
[9] G. Károlyi, J. Pach, G. Tóth, P. Valtr:
Ramsey-Type Results for Geometric Graphs. II,
Discrete and Computational Geometry 20 (1998), 375-388.
Also in:
Proceedings of the 13th Annual ACM
Symposium on Computational Geometry 1997, 94-103.
ps
pdf
[10] G. Csizmadia, G. Tóth: Note on an Art Gallery Problem,
Computational Geometry: Theory and Applications
10/1 (1998), 47-55.
ps
pdf
[11] J. Pach, T. Thiele, G. Tóth: Three-dimensional grid
drawings of graphs,
Lecture Notes in Computer Science 1353, Spinger-Verlag, 1998,
47-51.
Also in: Advances in
Discrete and Computational Geometry
(B. Chazelle, J. E. Goodman, R. Pollack, eds.), Contemporary
Mathematics 233, AMS, Providence 1999, 251-255.
ps
pdf
[12] J. Pach, G. Tóth: A generalization of the
Erdös-Szekeres theorem to disjoint convex sets, Discrete and
Computational Geometry 19 (1998), 437-445.
ps
pdf
[13] G. Tóth, P. Valtr: Note on the Erdös-Szekeres theorem,
Discrete and Computational Geometry 19 (1998), 457-459.
ps
pdf
[14] G. Tóth, P. Valtr: Geometric graphs with few
disjoint edges, Proceedings of the 14th Annual ACM
Symposium on Computational Geometry 1998, 184-191.
Also in: Discrete and Computational Geometry 22 (1999), 633-642.
ps
pdf
[15] J. Pach, G. Tóth: Erdös-Szekeres-type
theorems for segments and non-crossing convex sets,
Geometriae Dedicata 81 (2000), 1-12.
ps
pdf
[16] G. Tóth: Finding convex sets in convex position,
Combinatorica 20 (2000), 589-596.
ps
pdf
[17] J. Pach, G. Tóth: Which crossing number is it anyway?
Proceedings of the 39th Annual Symposium on Foundation of Computer Science 1998, 617-626. Also in: Journal of Combinatorial Theory B 80 (2000), 225-246.
ps
pdf
[18] J. Pach, J. Spencer, G. Tóth: New bounds for crossing numbers,
Proceedings of the 15th Annual ACM
Symposium on Computational Geometry 1999, 124-133.
Also in: Discrete and Computational Geometry 24 (2000), 623-644.
ps
pdf
[19] G. Tóth: Note on geometric graphs,
Journal of Combinatorial Theory, Series A 89 (2000), 126-132.
ps
pdf
[20] A. Dumitrescu, G. Tóth: Ramsey-type results for unions of
comparability graphs, Proceedings of the 11th Canadian Conference on
Computational Geometry 1999, 178-181. Also in: Graphs and Combinatorics
18 (2002), 245-251.
ps
pdf
[21] G. Tóth: Point sets with many k-sets,
Proceedings of the 16th Annual ACM
Symposium on Computational Geometry 2000, 37-42.
Also in: Discrete and Computational Geometry 26 (2001), 187-194.
ps
pdf
[22] D. J. Kleitman, A. Gyárfás, G. Tóth:
Convex sets in the plane with three of every four meeting,
Combinatorica 21 (2001), 221-232.
ps
pdf
[23] J. Pach, G. Tóth:
Thirteen problems on crossing numbers,
Geombinatorics 9 (2000), 194-207.
ps
pdf
[24] G. Károlyi, G. Tóth:
An Erdös-Szekeres-type problem in the plane ,
Periodica Mathematica Hungarica 39 (1999), 153-159.
ps
pdf
[25] G. Károlyi, J. Pach, G. Tóth: A modular version of the
Erdös-Szekeres theorem, Studia Mathematica Hungarica 38 (2001), 245-259.
ps
pdf
[26] J. Pach, J. Solymosi, G. Tóth: Unavoidable configurations
in complete topological graphs, , Lecture Notes in Computer Science
1984 Springer-Verlag, 2001, 328-337.
Also in: Discrete and Computational Geometry 30 (2003), 311-320.
ps
pdf
[27] R. Radoičić, G. Tóth: Monotone paths in line arrangements,
Proceedings of the 17th Annual ACM
Symposium on Computational Geometry 2001, 312-314.
Also in: Computational Geometry: Theory and Applications 264 (20013,
129-134.
ps
pdf
[28] J. Pach, G. Tóth: The string graph problem is decidable,
Lecture Notes in Computer Science 2265 Spinger-Verlag, Berlin 2001,
247-260. Also in: Discrete and Computational Geometry 28 (2002),
593-606.
ps
pdf
[29] R. Radoičić, G. Tóth: Note on the chromatic number of the
space,
Algorithms and Combinatorics, 25 Springer-Verlag, Berlin 2003, 695-698.
ps
pdf
[30] J. Spencer, G. Tóth: Crossing numbers of random graphs,
Random Structures and Algorithms 21 (2002), 347-358.
ps
pdf
[31] J. Pach, G. Tóth: How many ways one can draw a graph?
Graph Drawing (G. Liotta, ed.), Lecture Notes in Computer Science 2919
Springer-Verlag, Berlin, 2004, 47-58. Also in: Combinatorica (accepted).
ps
pdf
[32] J. Pach, G. Tóth: Monotone drawings of planar graphs,
Algorithms and Computation (P. Bose, P. Morin, eds.)
Lecture Notes in Computer Science 2518
Springer-Verlag, Berlin, 2002, 647-653. Also in: Journal of Graph Theory 46,
(2004), 39-47.
ps
pdf
[33] J. Pach, R. Pinchasi, G. Tardos, G. Tóth: Geometric
graphs with no crossing path of length three,
Graph Drawing (M. T. Goodrich, S. G. Kobourov, eds.),
Lecture Notes in Computer Science 2528
Springer-Verlag, Berlin, 2002, 295-311. Also in: European Journal of Combinatorics 25,
(2004), 793-811.
ps
pdf
[34] G. Tóth: Ramsey-type theorems and exercises (in
Hungarian),
in: New Mathematical Mosaic (A. Hraskó, ed.), Typotex, Budapest, 2002, 211-221.
ps
pdf
[35] J. Pach, R. Radoičić, G. Tardos, G. Tóth:
Improving the Crossing Lemma
by finding more crossings in sparse graphs,
Proceedings of the 19th Annual ACM
Symposium on Computational Geometry 2004, 68-75.
Also in: Discrete and Computational Geometry 36,
(2006), 527-552.
ps
pdf
[36] J. Pach, G. Tóth: Note on conflict-free colorings,
in: Discrete and Computational Geometry (S. Basu et al. eds.),
Algorithms and Combinatorics 25, Springer-Verlag, Berlin, 2003, 665-672.
ps
pdf
[37] J. Pach, R. Radoičić, G. Tóth: Relaxing planarity for
topological graphs, Discrete and Computational Geometry (J. Akiyama, M. Kano, eds.),
Lecture Notes in Computer Science 2866
Springer-Verlag, Berlin, 2003, 221-232.
ps
pdf
[38] J. Pach, R. Pinchasi, M. Sharir, G. Tóth: Topological
graphs with no large grids,
Special Issue dedicated to Victor Neumann-Lara,
Graphs and Combinatorics 21,
(2005), 355-364.
ps
pdf
[39] J. Pach, R. Radoičić, G. Tóth: A generalization of quasi-planarity,
Towards a Theory of Geometric Graphs, (J. Pach, ed.), Contamporary Mathematics 342,
AMS, 2004, 177-183.
ps
pdf
[40] J. Pach, G. Tóth: Disjoint edges in topological graphs,
Lecture Notes in Computer Science 3330
Springer-Verlag, Berlin, 2005, 133-140.
ps
pdf
[41] G. Tóth, P. Valtr: The Erdös-Szekeres theorem, upper bounds and generalizations,
Discrete and Computational Geometry - Papers from the MSRI Special Program
(J. E. Goodman et al. eds.), MSRI Publications 52 Cambridge University Press, Cambridge (2005),
557-568.
ps
pdf
[42] G. Tardos, G. Tóth: Crossing stars in topological graphs,
Japan Conference on Discrete and Computational Geometry 2004,
Lecture Notes in Computer Science 3742
Springer-Verlag, Berlin, 184-197.
ps
pdf
[43] J. Kyncl, J. Pach, G. Tóth: Long alternating paths in bicolored point sets,
Graph Drawing 2004, (J, Pach, ed.), Lecture Notes in Computer Science
3383,
Springer-Verlag, Berlin, 2005, 340-348.
Also in: Special Volume of Discrete Mathematics Honouring the
60th birthday of M. Simonovits 308 (2008), 4315-4322.
ps
pdf
[44] J. Pach, G. Tóth: Crossing numbers of toroidal graphs,
Graph Drawing 2005, Lecture Notes in Computer Science 3843
Springer-Verlag, Berlin, 2006, 334-342.
Also in:
Topics in discrete mathematics,
Algorithms and Combinatorics, 26, Springer, Berlin, 2006, 581-590.
ps
pdf
[45] G. Tardos, G. Tóth: Multiple coverings of the plane
with triangles,
Discrete and Computational Geometry 38 (2007), 443-450.
Special issue dedicated to the memory of Laszló Fejes Tóth
(I. Bárány, J. Pach, eds.)
ps
pdf
[46] A. Dumitrescu, J. Pach, G. Tóth:
The maximum number of empty congruent triangles determined by a
point set,
Revue Roumaine de Mathématiques Pures et Appliquées, 50 (2005), 613-618.
ps
pdf
[47] J. Pach, Tóth:
Degenerate crossing numbers,
Discrete and Computational Geometry 41 (2009),
376-384.
Also in: Proceedings of the 22nd Annual ACM
Symposium on Computational Geometry 2006, 255-258.
ps
pdf
[48] J. Pach, G. Tardos, G. Tóth:
Indecomposable coverings,
In: The China--Japan Joint Conference
on Discrete Geometry, Combinatorics and Graph Theory
(CJCDGCGT 2005), Lecture Notes in Computer Science,
Springer, 4381,
Springer-Verlag, Berlin, 2007, 135-148.
Also in: Canadian Mathematical Bulletin, submitted
ps
pdf
[49] J. Pach, G. Tóth:
Comment on Fox News,
Geombinatorics 15 (2006), 150-154.
ps
pdf
[50]
K. Böröczky, J. Pach, G. Tóth:
Crossing number of graphs embeddable in another surface,
International Journal of Foundations
of Computer Science, Special Issue on Graph Drawing
17 (2006), 1005-1017.
ps
pdf
[51] B. Keszegh, J. Pach, D. Pálvölgyi, G. Tóth:
Drawing cubic graphs with at most five slopes,
Computational Geometry: Theory and Applications
40, (2008), 138-147.
Also in:
Graph Drawing 2006, Lecture Notes in Computer Science 4372
Springer-Verlag, Berlin, 2007, 114-125.
ps
pdf
[52] G. Tóth:
Note on the pair-crossing number and the odd-crossing number,
Discrete and Computational Geometry 39 (2008), 791-799.
Also in: Proceedings of the 19th Canadian Conference on Computational
Geometry, Ottawa, Canada, 2007.
ps
pdf
[53] J. Pach, G. Tóth:
Decomposition of multiple coverings into many parts,
Computational Geometry: Theory and Applications 42
(2009), 127-133.
Also in: Proceedings of the 23rd Annual Symposium on Computational Geometry,
Gyeongju, South-Korea, 2007, 133-137, ACM Press, New York.
ps
pdf
[54] J. Cerny, J. Kyncl, G. Tóth:
Improvement on the decay of crossing numbers,
Graph Drawing 2007, Lecture Notes in Computer Science
4875
Springer-Verlag, Berlin, 2008, 25-30.
ps
pdf
[55] J. Pach, G. Tóth:
Families of convex sets not representable
by points,
Indian Statistical Institute Platinum Jubilee Commemorative
Volume--Architecture and Algorithms, World Scientific, Singapore,
2009, 43-53.
ps
pdf
[56] R. Radoičić, G. Tóth:
The discharging method in combinatorial geometry and the Pach--Sharir conjecture
Proceedings of the Joint Summer Research Conference on Discrete and
Computational Geometry, (J. E. Goodman, J. Pach, J. Pollack, eds.),
Contemporary Mathematics, AMS, 453 (2008),
319-342.
ps
pdf
[57] J. Pach, G. Tóth:
Monochromatic empty triangles in two-colored point sets
Geometry, Games, Graphs and Education: the Joe Malkevitch
Festschrift (S. Garfunkel, R. Nath, eds.), COMAP, Bedford, MA, 2008,
195-198.
ps
pdf
[58] B. Keszegh, J. Pach, D. Pálvölgyi, G. Tóth:
Cubic graphs have bounded slope parameter
Graph Drawing 2008, Also in: Journal of Graph Algorithms and Applications,
accepted
ps
pdf
[59] D. Pálvölgyi, G. Tóth:
Convex polygons are cover-decomposable
Discrete and Computational Geometry, 43 (2010), 483--496.
ps
pdf
[60] A. Dumitrescu, J. Pach, G. Tóth:
Drawing Hamiltonian path with no large angles
Graph Drawing 2009, Lecture Notes in Computer Science 5849
Springer-Verlag, Berlin, 2010
ps
pdf
[61] A. Dumitrescu, J. Pach, G. Tóth:
A note on blocking visibilities between points
Geombinatorics 19 (2009), 67-73.
ps
pdf
[62] J. Barát, G. Tóth:
Towards the Albertson conjecture
Electronic Journal of Combinatorics 17 (1) R73
ps
pdf
[63] P. Cheilaris, G. Tóth:
Graph unique-maximum and conflict-free colorings
In:
Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC),
Lecture Notes in Computer Science 6078
Springer-Verlag, Berlin, 2010, 143-154.
ps
pdf