Search filters

List of works by János Pach

A Computational Approach to Conway’s Thrackle Conjecture

scientific article (publication date: 2011)

A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing

scholarly article from 'SIAM Journal on Computing' published in 2016

A Problem of Leo Moser About Repeated Distances on the Sphere

A Problem of Ulam on Planar Graphs

A Ramsey-type theorem for bipartite graphs

scientific article published on 00 October 2000

Almost tight bounds forɛ-Nets

article by János Komlós et al published February 1992 in Discrete and Computational Geometry

An upper bound on the number of planarK-sets

article

Bounded VC-Dimension Implies the Schur-Erdős Conjecture

scientific article published in 2021

Coloring Hasse Diagrams and Disjointness Graphs of Curves

Common Tangents and Common Transversals

Conflict-Free Colourings of Graphs and Hypergraphs

scholarly article published in September 2009

Conway’s Conjecture for Monotone Thrackles

scientific article (publication date: 2011)

Crossing families

scientific article published in 1994

Cutting a graph into two dissimilar halves

scientific article published in 1988

Decomposition of Geometric Graphs into Star-Forests

Distinct distances determined by subsets of a point set in space

scientific article published in 1991

E3341

Embedding Planar Graphs at Fixed Vertex Locations

Fat Triangles Determine Linearly Many Holes

journal article from 'SIAM J. Comput.' published in 1994

From Tarski′s Plank Problem to Simultaneous Approximation

Helly's Theorem with Volumes

Homogeneous selections from hyperplanes

scientific article published in 2014

How hard is half-space range searching?

scientific article (publication date: August 1993)

How to draw a planar graph on a grid

How to make a graph bipartite

scientific article published in August 1988

Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs

Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon

Nearly equal distances in the plane

New bounds on crossing numbers

On Conway's Thrackle Conjecture

scientific article published in 1997

On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm

scientific article published in June 1991

On a metric generalization of Ramsey’s theorem

scientific article published in December 1997

On a problem of L. Fejes Tóth

scientific article (publication date: 1980)

On a quasi-Ramsey problem

scientific article published in 1983

On arrangements of Jordan arcs with three intersections per pair

On the Queue Number of Planar Graphs

On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles

scientific article published in 1986

On the Upward Planarity of Mixed Plane Graphs

Online Conflict-Free Coloring for Intervals

journal article from 'SIAM J. Comput.' published in 2007

Optimal Embedded and Enclosing Isosceles Triangles

scientific article published on 5 October 2023

Overlap properties of geometric expanders

scientific article published in 2012

PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE

scientific article published in 2006

Popular distances in 3-space

Radius, diameter, and minimum degree

article published in 1989

Ramsey-type results for semi-algebraic relations

scientific article published in 2014

Repeated distances in space

scientific article published in December 1988

Small sets supporting fary embeddings of planar graphs

scientific article (publication date: 1988)

String graphs and incomparability graphs

The Beginnings of Geometric Graph Theory

The complexity of a class of infinite graphs

scientific article published in 1994

The grid revisited

scientific article published in February 1993

The number of crossings in multigraphs with no empty lens

Tight lower bounds for the size of epsilon-nets

Weaving Patterns of Lines and Line Segments in Space

journal article from 'Algorithmica' published in 1993

Which Crossing Number Is It Anyway?

Which crossing number is it, anyway? [computational geometry]