Géza Tóth

According to our database1, Géza Tóth authored at least 71 papers between 1994 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 



On csauthors.net:


Petruska's question on planar convex sets.
Discret. Math., 2020

A Crossing Lemma for Multigraphs.
Discret. Comput. Geom., 2020

Dense Point Sets with Many Halving Lines.
Discret. Comput. Geom., 2020

Many touchings force many crossings.
J. Comb. Theory, Ser. B, 2019

An algorithm to find maximum area polygons circumscribed about a convex polygon.
Discret. Appl. Math., 2019

Improvements on the density of maximal 1-planar graphs.
J. Graph Theory, 2018

Note on k-planar crossing numbers.
Comput. Geom., 2018

The Number of Crossings in Multigraphs with No Empty Lens.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

Disjointness Graphs of Segments.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Separation with restricted families of sets.
J. Comb. Theory, Ser. A, 2016

Erdős-Szekeres Theorem for Lines.
Discret. Comput. Geom., 2015

Saturated simple and k-simple topological graphs.
Comput. Geom., 2015

Multiple Coverings with Closed Polygons.
Electron. J. Comb., 2015

A Note on Coloring Line Arrangements.
Electron. J. Comb., 2014

Improvement on the Decay of Crossing Numbers.
Graphs Comb., 2013

Monochromatic empty triangles in two-colored point sets.
Discret. Appl. Math., 2013

Separating families of convex sets.
Comput. Geom., 2013

Erdős-Szekeres Theorem for Point Sets with Forbidden Subconfigurations.
Discret. Comput. Geom., 2012

Drawing Hamiltonian Cycles with no Large Angles.
Electron. J. Comb., 2012

Graph unique-maximum and conflict-free colorings.
J. Discrete Algorithms, 2011

Tangled Thrackles.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Monotone Crossing Number.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Cubic graphs have bounded slope parameter.
J. Graph Algorithms Appl., 2010

Convex Polygons are Cover-Decomposable.
Discret. Comput. Geom., 2010

Towards the Albertson Conjecture.
Electron. J. Comb., 2010

Degenerate Crossing Numbers.
Discret. Comput. Geom., 2009

Decomposition of multiple coverings into many parts.
Comput. Geom., 2009

Long alternating paths in bicolored point sets.
Discret. Math., 2008

Note on the Pair-crossing Number and the Odd-crossing Number.
Discret. Comput. Geom., 2008

QUBIT4MATLAB V3.0: A program package for quantum information science and quantum optics for MATLAB.
Comput. Phys. Commun., 2008

Drawing cubic graphs with at most five slopes.
Comput. Geom., 2008

Crossing Stars in Topological Graphs.
SIAM J. Discret. Math., 2007

Multiple Coverings of the Plane with Triangles.
Discret. Comput. Geom., 2007

Planar Crossing Numbers of Graphs Embeddable in Another Surface.
Int. J. Found. Comput. Sci., 2006

Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.
Discret. Comput. Geom., 2006

How Many Ways Can One Draw A Graph?
Comb., 2006

Topological Graphs with No Large Grids.
Graphs Comb., 2005

Crossing Number of Toroidal Graphs.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

Indecomposable Coverings.
Proceedings of the Discrete Geometry, 2005

Monotone drawings of planar graphs.
J. Graph Theory, 2004

Geometric graphs with no self-intersecting path of length three.
Eur. J. Comb., 2004

Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Unavoidable Configurations in Complete Topological Graphs.
Discret. Comput. Geom., 2003

Monotone paths in line arrangements.
Comput. Geom., 2003

Disjoint Edges in Topological Graphs.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

Crossing numbers of random graphs.
Random Struct. Algorithms, 2002

Ramsey-Type Results for Unions of Comparability Graphs.
Graphs Comb., 2002

Recognizing String Graphs Is Decidable.
Discret. Comput. Geom., 2002

Relaxing Planarity for Topological Graphs.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Point Sets with Many <i>k</i>-Sets.
Discret. Comput. Geom., 2001

Convex Sets in the Plane with Three of Every Four Meeting.
Comb., 2001

Monotone paths in line arrangement.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Note on Geometric Graphs.
J. Comb. Theory, Ser. A, 2000

Which Crossing Number Is It Anyway?
J. Comb. Theory, Ser. B, 2000

New Bounds on Crossing Numbers.
Discret. Comput. Geom., 2000

Finding Convex Sets in Convex Position.
Comb., 2000

Unavoidable Configurations in Complete Topological Graphs.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

Geometric Graphs with Few Disjoint Edges.
Discret. Comput. Geom., 1999

Ramsey-type results for unions of comparability graphs and convex sets inrestricted position.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Note on the Erdos - Szekeres Theorem.
Discret. Comput. Geom., 1998

A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets.
Discret. Comput. Geom., 1998

Ramsey-Type Results for Geometric Graphs, II.
Discret. Comput. Geom., 1998

ote on an art gallery problem.
Comput. Geom., 1998

Ramsey-Type Results for Geometric Graphs, I.
Discret. Comput. Geom., 1997

The Shortest Distance Among Points in General Position.
Comput. Geom., 1997

Graphs Drawn with Few Crossings per Edge.
Comb., 1997

Three-dimensional Grid Drawings of Graphs.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

A ramsey-type bound for rectangles.
J. Graph Theory, 1996

A Ramsey-type problem on right-angled triangles in space.
Discret. Math., 1996

Ramsey-Type Results for Geometric Graphs.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

Note on a Ramsey-Type Problem in Geometry.
J. Comb. Theory, Ser. A, 1994