Géza Tóth - RankMe

119 papers A* 4A 18B 1C 1Journal 79Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Canonical theorems in geometric Ramsey theory. Comb. Theory Panna Gehér, Arsenii Sagdeev, Géza Tóth
2025	J	`jnl`	1-planar unit distance graphs. Eur. J. Comb. Panna Gehér, Géza Tóth
2025	J	`jnl`	Coloring Geometric Hypergraphs: A Survey. CoRR Gábor Damásdi, Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2025	J	`jnl`	Monochromatic Infinite Sets in Minkowski Planes. Discret. Comput. Geom. Nóra Frankl, Panna Gehér, Arsenii Sagdeev, Géza Tóth
2025	J	`jnl`	Peeling Sequences. Discret. Comput. Geom. Adrian Dumitrescu, Géza Tóth
2025	J	`jnl`	Progressions in Euclidean Ramsey theory. Eur. J. Comb. Jakob Führer, Géza Tóth
2025	J	`jnl`	Two Trees Are Better than One. SIAM J. Discret. Math. Adrian Dumitrescu, János Pach, Géza Tóth
2024	A	`conf`	1-Planar Unit Distance Graphs. GD Panna Gehér, Géza Tóth
2024	J	`jnl`	Corrigendum to "An algorithm to find maximum area polygons circumscribed about a convex polygon" [Discrete Appl. Math. 255 (2019) 98-108]. Discret. Appl. Math. Markus Ausserhofer, Susanna Dann, Zsolt Lángi, Géza Tóth
2024	J	`jnl`	Disjointness graphs of short polygonal chains. J. Comb. Theory B János Pach, Gábor Tardos, Géza Tóth
2024	J	`jnl`	Monochromatic spanning trees and matchings in ordered complete graphs. J. Graph Theory János Barát, András Gyárfás, Géza Tóth
2023	J	`jnl`	Crossing lemma for the odd-crossing number. Comput. Geom. János Karl, Géza Tóth
2023	J	`jnl`	Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph. Order Csaba Biró, Jeno Lehel, Géza Tóth
2023	J	`jnl`	Saturated 2-plane drawings with few edges. Ars Math. Contemp. János Barát, Géza Tóth
2023	J	`jnl`	Two trees are better than one. CoRR Adrian Dumitrescu, János Pach, Géza Tóth
2022	J	`jnl`	Crossings between non-homotopic edges. J. Comb. Theory B János Pach, Gábor Tardos, Géza Tóth
2022	A*	`conf`	Disjointness Graphs of Short Polygonal Chains. SoCG János Pach, Gábor Tardos, Géza Tóth
2022	J	`jnl`	Improvement on the Crossing Number of Crossing-Critical Graphs. Discret. Comput. Geom. János Barát, Géza Tóth
2021	J	`jnl`	Disjointness graphs of segments in the space. Comb. Probab. Comput. János Pach, Gábor Tardos, Géza Tóth
2021	J	`jnl`	The number of crossings in multigraphs with no empty lens. J. Graph Algorithms Appl. Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2020	J	`jnl`	A Crossing Lemma for Multigraphs. Discret. Comput. Geom. János Pach, Géza Tóth
2020	A	`conf`	Crossings Between Non-homotopic Edges. GD János Pach, Gábor Tardos, Géza Tóth
2020	J	`jnl`	Dense Point Sets with Many Halving Lines. Discret. Comput. Geom. István Kovács, Géza Tóth
2020	A	`conf`	Improvement on the Crossing Number of Crossing-Critical Graphs. GD János Barát, Géza Tóth
2020	J	`jnl`	Petruska's question on planar convex sets. Discret. Math. Adam S. Jobson, André E. Kézdy, Jeno Lehel, Timothy J. Pervenecki, Géza Tóth
2019	J	`jnl`	An algorithm to find maximum area polygons circumscribed about a convex polygon. Discret. Appl. Math. Markus Ausserhofer, Susanna Dann, Zsolt Lángi, Géza Tóth
2019	J	`jnl`	Many touchings force many crossings. J. Comb. Theory B János Pach, Géza Tóth
2018	A*	`conf`	A Crossing Lemma for Multigraphs. SoCG János Pach, Géza Tóth
2018	J	`jnl`	Improvements on the density of maximal 1-planar graphs. J. Graph Theory János Barát, Géza Tóth
2018	J	`jnl`	Note on k-planar crossing numbers. Comput. Geom. János Pach, László A. Székely, Csaba D. Tóth, Géza Tóth
2018	A	`conf`	The Number of Crossings in Multigraphs with No Empty Lens. GD Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2018	J	`jnl`	The number of crossings in multigraphs with no empty lens. CoRR Michael Kaufmann, János Pach, Géza Tóth, Torsten Ueckerdt
2017	J	`jnl`	Dense point sets with many halving lines. CoRR István Kovács, Géza Tóth
2017	A*	`conf`	Disjointness Graphs of Segments. SoCG János Pach, Gábor Tardos, Géza Tóth
2017	A	`conf`	Many Touchings Force Many Crossings. GD János Pach, Géza Tóth
2016	J	`jnl`	Separation with restricted families of sets. J. Comb. Theory A Zsolt Lángi, Márton Naszódi, János Pach, Gábor Tardos, Géza Tóth
2015	J	`jnl`	Erdős-Szekeres Theorem for Lines. Discret. Comput. Geom. Imre Bárány, Edgardo Roldán-Pensado, Géza Tóth
2015	J	`jnl`	Multiple Coverings with Closed Polygons. Electron. J. Comb. István Kovács, Géza Tóth
2015	J	`jnl`	Saturated simple and k-simple topological graphs. Comput. Geom. Jan Kyncl, János Pach, Rados Radoicic, Géza Tóth
2014	J	`jnl`	A Note on Coloring Line Arrangements. Electron. J. Comb. Eyal Ackerman, János Pach, Rom Pinchasi, Rados Radoicic, Géza Tóth
2014	J	`jnl`	Multiple coverings with closed polygons. CoRR István Kovács, Géza Tóth
2013	J	`jnl`	Improvement on the Decay of Crossing Numbers. Graphs Comb. Jakub Cerný, Jan Kyncl, Géza Tóth
2013	J	`jnl`	Monochromatic empty triangles in two-colored point sets. Discret. Appl. Math. János Pach, Géza Tóth
2013	J	`jnl`	Separating families of convex sets. Comput. Geom. Dániel Gerbner, Géza Tóth
2012	J	`jnl`	Drawing Hamiltonian Cycles with no Large Angles. Electron. J. Comb. Adrian Dumitrescu, János Pach, Géza Tóth
2012	J	`jnl`	Erdős-Szekeres Theorem for Point Sets with Forbidden Subconfigurations. Discret. Comput. Geom. Gyula Károlyi, Géza Tóth
2012	J	`jnl`	Improvement on the decay of crossing numbers CoRR Jakub Cerný, Jan Kyncl, Géza Tóth
2011	J	`jnl`	Graph unique-maximum and conflict-free colorings. J. Discrete Algorithms Panagiotis Cheilaris, Géza Tóth
2011	A	`conf`	Monotone Crossing Number. GD János Pach, Géza Tóth
2011	—	`conf`	Tangled Thrackles. EGC János Pach, Rados Radoicic, Géza Tóth
2010	J	`jnl`	Convex Polygons are Cover-Decomposable. Discret. Comput. Geom. Dömötör Pálvölgyi, Géza Tóth
2010	J	`jnl`	Cubic graphs have bounded slope parameter. J. Graph Algorithms Appl. Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2010	C	`conf`	Graph Unique-Maximum and Conflict-Free Colorings. CIAC Panagiotis Cheilaris, Géza Tóth
2010	J	`jnl`	Towards the Albertson Conjecture. Electron. J. Comb. János Barát, Géza Tóth
2009	J	`jnl`	Decomposition of multiple coverings into many parts. Comput. Geom. János Pach, Géza Tóth
2009	J	`jnl`	Degenerate Crossing Numbers. Discret. Comput. Geom. János Pach, Géza Tóth
2009	A	`conf`	Drawing Hamiltonian Cycles with No Large Angles. GD Adrian Dumitrescu, János Pach, Géza Tóth
2009	J	`jnl`	Graph unique-maximum and conflict-free colorings CoRR Panagiotis Cheilaris, Géza Tóth
2008	A	`conf`	Cubic Graphs Have Bounded Slope Parameter. GD Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2008	J	`jnl`	Drawing cubic graphs with at most five slopes. Comput. Geom. Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2008	J	`jnl`	Long alternating paths in bicolored point sets. Discret. Math. Jan Kyncl, János Pach, Géza Tóth
2008	J	`jnl`	Note on the Pair-crossing Number and the Odd-crossing Number. Discret. Comput. Geom. Géza Tóth
2007	J	`jnl`	Crossing Stars in Topological Graphs. SIAM J. Discret. Math. Gábor Tardos, Géza Tóth
2007	—	`conf`	Decomposition of multiple coverings into many parts. SCG János Pach, Géza Tóth
2007	A	`conf`	Improvement on the Decay of Crossing Numbers. GD Jakub Cerný, Jan Kyncl, Géza Tóth
2007	J	`jnl`	Multiple Coverings of the Plane with Triangles. Discret. Comput. Geom. Gábor Tardos, Géza Tóth
2007	—	`conf`	Note on the Pair-Crossing Number and the Odd-Crossing Number. CCCG Géza Tóth
2006	—	`conf`	Degenerate crossing numbers. SCG János Pach, Géza Tóth
2006	A	`conf`	Drawing Cubic Graphs with at Most Five Slopes. GD Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth
2006	J	`jnl`	How Many Ways Can One Draw A Graph? Comb. János Pach, Géza Tóth
2006	J	`jnl`	Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs. Discret. Comput. Geom. János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth
2006	J	`jnl`	Planar Crossing Numbers of Graphs Embeddable in Another Surface. Int. J. Found. Comput. Sci. Károly J. Böröczky, János Pach, Géza Tóth
2005	A	`conf`	Crossing Number of Toroidal Graphs. GD János Pach, Géza Tóth
2005	—	`conf`	Indecomposable Coverings. CJCDGCGT János Pach, Gábor Tardos, Géza Tóth
2005	J	`jnl`	Topological Graphs with No Large Grids. Graphs Comb. János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth
2004	—	`conf`	Crossing Stars in Topological Graphs. JCDCG Gábor Tardos, Géza Tóth
2004	J	`jnl`	Geometric graphs with no self-intersecting path of length three. Eur. J. Comb. János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth
2004	—	`conf`	Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]. SCG János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth
2004	A	`conf`	Long Alternating Paths in Bicolored Point Sets. GD Jan Kyncl, János Pach, Géza Tóth
2004	J	`jnl`	Monotone drawings of planar graphs. J. Graph Theory János Pach, Géza Tóth
2003	—	`conf`	Disjoint Edges in Topological Graphs. IJCCGGT János Pach, Géza Tóth
2003	A	`conf`	How Many Ways Can One Draw a Graph? GD János Pach, Géza Tóth
2003	J	`jnl`	Monotone paths in line arrangements. Comput. Geom. Rados Radoicic, Géza Tóth
2003	J	`jnl`	Unavoidable Configurations in Complete Topological Graphs. Discret. Comput. Geom. János Pach, József Solymosi, Géza Tóth
2002	J	`jnl`	Crossing numbers of random graphs. Random Struct. Algorithms Joel Spencer, Géza Tóth
2002	A	`conf`	Geometric Graphs with No Self-intersecting Path of Length Three. GD János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth
2002	B	`conf`	Monotone Drawings of Planar Graphs. ISAAC János Pach, Géza Tóth
2002	J	`jnl`	Ramsey-Type Results for Unions of Comparability Graphs. Graphs Comb. Adrian Dumitrescu, Géza Tóth
2002	J	`jnl`	Recognizing String Graphs Is Decidable. Discret. Comput. Geom. János Pach, Géza Tóth
2002	—	`conf`	Relaxing Planarity for Topological Graphs. JCDCG János Pach, Rados Radoicic, Géza Tóth
2001	J	`jnl`	Convex Sets in the Plane with Three of Every Four Meeting. Comb. Daniel J. Kleitman, András Gyárfás, Géza Tóth
2001	—	`conf`	Monotone paths in line arrangement. SCG Rados Radoicic, Géza Tóth
2001	J	`jnl`	Point Sets with Many Discret. Comput. Geom. Géza Tóth
2001	A	`conf`	Recognizing String Graphs Is Decidable. GD János Pach, Géza Tóth
2000	J	`jnl`	Finding Convex Sets in Convex Position. Comb. Géza Tóth
2000	J	`jnl`	New Bounds on Crossing Numbers. Discret. Comput. Geom. János Pach, Joel Spencer, Géza Tóth
2000	J	`jnl`	Note on Geometric Graphs. J. Comb. Theory A Géza Tóth
2000	—	`conf`	Point sets with many SCG Géza Tóth
2000	A	`conf`	Unavoidable Configurations in Complete Topological Graphs. GD János Pach, Géza Tóth
2000	J	`jnl`	Which Crossing Number Is It Anyway? J. Comb. Theory B János Pach, Géza Tóth
1999	J	`jnl`	Geometric Graphs with Few Disjoint Edges. Discret. Comput. Geom. Géza Tóth, Pavel Valtr
1999	—	`conf`	New Bounds on Crossing Numbers. SCG János Pach, Joel Spencer, Géza Tóth
1999	—	`conf`	Ramsey-type results for unions of comparability graphs and convex sets inrestricted position. CCCG Adrian Dumitrescu, Géza Tóth
1998	J	`jnl`	A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets. Discret. Comput. Geom. János Pach, Géza Tóth
1998	—	`conf`	Geometric Graphs with Few Disjoint Edges. SCG Géza Tóth, Pavel Valtr
1998	J	`jnl`	Note on the Erdos - Szekeres Theorem. Discret. Comput. Geom. Géza Tóth, Pavel Valtr
1998	J	`jnl`	Ramsey-Type Results for Geometric Graphs, II. Discret. Comput. Geom. Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr
1998	A*	`conf`	Which Crossing Number is it, Anyway? FOCS János Pach, Géza Tóth
1998	J	`jnl`	ote on an art gallery problem. Comput. Geom. György Csizmadia, Géza Tóth
1997	J	`jnl`	Graphs Drawn with Few Crossings per Edge. Comb. János Pach, Géza Tóth
1997	—	`conf`	Ramsey-Type Results for Geometric Graphs II. SCG Gyula Károlyi, János Pach, Géza Tóth, Pavel Valtr
1997	J	`jnl`	Ramsey-Type Results for Geometric Graphs, I. Discret. Comput. Geom. Gyula Károlyi, János Pach, Géza Tóth
1997	J	`jnl`	The Shortest Distance Among Points in General Position. Comput. Geom. Géza Tóth
1997	A	`conf`	Three-dimensional Grid Drawings of Graphs. GD János Pach, Torsten Thiele, Géza Tóth
1996	J	`jnl`	A Ramsey-type problem on right-angled triangles in space. Discret. Math. Miklós Bóna, Géza Tóth
1996	J	`jnl`	A ramsey-type bound for rectangles. J. Graph Theory Géza Tóth
1996	A	`conf`	Graphs Drawn with Few Crossings Per Edge. GD János Pach, Géza Tóth
1996	—	`conf`	Ramsey-Type Results for Geometric Graphs. SCG Gyula Károlyi, János Pach, Géza Tóth
1994	J	`jnl`	Note on a Ramsey-Type Problem in Geometry. J. Comb. Theory A György Csizmadia, Géza Tóth