Géza Tóth

Discret. Comput. Geom., April, 2025

Two Trees Are Better than One.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2025

Progressions in Euclidean Ramsey theory.

[BibT_eX]

[DOI]

Jakob Führer

Eur. J. Comb., 2025

2024

Monochromatic spanning trees and matchings in ordered complete graphs.

[BibT_eX]

[DOI]

András Gyárfás

J. Graph Theory, April, 2024

Corrigendum to "An algorithm to find maximum area polygons circumscribed about a convex polygon" [Discrete Appl. Math. 255 (2019) 98-108].

[BibT_eX]

[DOI]

Discret. Appl. Math., 2024

1-Planar Unit Distance Graphs.

[BibT_eX]

[DOI]

Panna Gehér

Proceedings of the 32nd International Symposium on Graph Drawing and Network Visualization, 2024

2023

Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph.

[BibT_eX]

[DOI]

Csaba Biró

Jeno Lehel

Order, October, 2023

Crossing lemma for the odd-crossing number.

[BibT_eX]

[DOI]

János Karl

Comput. Geom., 2023

Saturated 2-plane drawings with few edges.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2023

2022

Disjointness Graphs of Short Polygonal Chains.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Disjointness graphs of segments in the space.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

2020

Petruska's question on planar convex sets.

[BibT_eX]

[DOI]

Adam S. Jobson

André E. Kézdy

Jeno Lehel

Timothy J. Pervenecki

Discret. Math., 2020

Dense Point Sets with Many Halving Lines.

[BibT_eX]

[DOI]

István Kovács

Discret. Comput. Geom., 2020

Crossings Between Non-homotopic Edges.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

Improvement on the Crossing Number of Crossing-Critical Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

An algorithm to find maximum area polygons circumscribed about a convex polygon.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

Improvements on the density of maximal 1-planar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Note on k-planar crossing numbers.

[BibT_eX]

[DOI]

Comput. Geom., 2018

The Number of Crossings in Multigraphs with No Empty Lens.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

A Crossing Lemma for Multigraphs.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017

Many Touchings Force Many Crossings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Disjointness Graphs of Segments.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016

Separation with restricted families of sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2016

2015

Erdős-Szekeres Theorem for Lines.

[BibT_eX]

[DOI]

Imre Bárány

Edgardo Roldán-Pensado

Discret. Comput. Geom., 2015

Saturated simple and k-simple topological graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Multiple Coverings with Closed Polygons.

[BibT_eX]

[DOI]

István Kovács

Electron. J. Comb., 2015

2014

A Note on Coloring Line Arrangements.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2013

Monochromatic empty triangles in two-colored point sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Separating families of convex sets.

[BibT_eX]

[DOI]

Dániel Gerbner

Comput. Geom., 2013

2012

Erdős-Szekeres Theorem for Point Sets with Forbidden Subconfigurations.

[BibT_eX]

[DOI]

Gyula Károlyi

Discret. Comput. Geom., 2012

2011

Tangled Thrackles.

[BibT_eX]

[DOI]

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

Monotone Crossing Number.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

Convex Polygons are Cover-Decomposable.

[BibT_eX]

[DOI]

Dömötör Pálvölgyi

Discret. Comput. Geom., 2010

Towards the Albertson Conjecture.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

Graph Unique-Maximum and Conflict-Free Colorings.

[BibT_eX]

[DOI]

Panagiotis Cheilaris

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Drawing Hamiltonian Cycles with No Large Angles.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

2008

Cubic Graphs Have Bounded Slope Parameter.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Multiple Coverings of the Plane with Triangles.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

Improvement on the Decay of Crossing Numbers.

[BibT_eX]

[DOI]

Jakub Cerný

Jan Kyncl

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Decomposition of multiple coverings into many parts.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

Note on the Pair-Crossing Number and the Odd-Crossing Number.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Planar Crossing Numbers of Graphs Embeddable in Another Surface.

[BibT_eX]

[DOI]

Károly J. Böröczky

Int. J. Found. Comput. Sci., 2006

Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

Drawing Cubic Graphs with at Most Five Slopes.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 14th International Symposium, 2006

Degenerate crossing numbers.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Topological Graphs with No Large Grids.

[BibT_eX]

[DOI]

Graphs Comb., 2005

Crossing Number of Toroidal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

Indecomposable Coverings.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry, 2005

2004

Crossing Stars in Topological Graphs.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

Long Alternating Paths in Bicolored Point Sets.

[BibT_eX]

[DOI]

Jan Kyncl

Proceedings of the Graph Drawing, 12th International Symposium, 2004

Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003

Unavoidable Configurations in Complete Topological Graphs.

[BibT_eX]

[DOI]

József Solymosi

Discret. Comput. Geom., 2003

Monotone paths in line arrangements.

[BibT_eX]

[DOI]

Comput. Geom., 2003

Disjoint Edges in Topological Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

How Many Ways Can One Draw a Graph?

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

Crossing numbers of random graphs.

[BibT_eX]

[DOI]

Joel Spencer

Random Struct. Algorithms, 2002

Ramsey-Type Results for Unions of Comparability Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2002

Relaxing Planarity for Topological Graphs.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Monotone Drawings of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Geometric Graphs with No Self-intersecting Path of Length Three.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 10th International Symposium, 2002

2001

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

[BibT_eX]

[DOI]

Daniel J. Kleitman

András Gyárfás

Comb., 2001

Recognizing String Graphs Is Decidable.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

Monotone paths in line arrangement.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

Note on Geometric Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2000

Finding Convex Sets in Convex Position.

[BibT_eX]

[DOI]

Comb., 2000

Unavoidable Configurations in Complete Topological Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 8th International Symposium, 2000

Point sets with many <i>k</i>-sets.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999

New Bounds on Crossing Numbers.

[BibT_eX]

[DOI]

Joel Spencer

Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

Ramsey-type results for unions of comparability graphs and convex sets inrestricted position.

[BibT_eX]

[DOI]

Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998

Note on the Erdos - Szekeres Theorem.

[BibT_eX]

[DOI]

Pavel Valtr

Discret. Comput. Geom., 1998

A Generalization of the Erdos - Szekeres Theorem to Disjoint Convex Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1998

ote on an art gallery problem.

[BibT_eX]

[DOI]

György Csizmadia

Comput. Geom., 1998

Which Crossing Number is it, Anyway?

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Geometric Graphs with Few Disjoint Edges.

[BibT_eX]

[DOI]

Pavel Valtr

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

Ramsey-Type Results for Geometric Graphs, I.

[BibT_eX]

[DOI]

Gyula Károlyi

Discret. Comput. Geom., 1997

The Shortest Distance Among Points in General Position.

[BibT_eX]

[DOI]

Comput. Geom., 1997

Three-dimensional Grid Drawings of Graphs.

[BibT_eX]

[DOI]

Torsten Thiele

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Ramsey-Type Results for Geometric Graphs II.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

A ramsey-type bound for rectangles.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

A Ramsey-type problem on right-angled triangles in space.

[BibT_eX]

[DOI]

Miklós Bóna

Discret. Math., 1996

Graphs Drawn with Few Crossings Per Edge.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

Ramsey-Type Results for Geometric Graphs.

[BibT_eX]

[DOI]

Gyula Károlyi

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1994

Note on a Ramsey-Type Problem in Geometry.

[BibT_eX]

György Csizmadia