- Which crossing number is it anyway? Janos Pach #
- On the independence number of coin graphs
- Sliding disks in the plane Sergey Bereg 1 , Adrian Dumitrescu 2 , and J anos Pach 3?
- THE MAXIMUM NUMBER OF EMPTY CONGRUENT TRIANGLES
- On The Number Of Balanced Lines Janos Pach1
- Rich Cells In An Arrangement Of Hyperplanes
- Untangling a polygon J anos Pach
- Halving lines and perfect crossmatchings J'anos Pach 1 and J'ozsef Solymosi 2
- Indecomposable coverings Janos Pach1
- Unavoidable con gurations in complete topological graphs J anos Pach
- Uniformly distributed distances { a geometric application of Janson's inequality
- Drawing cubic graphs with at most five slopes B. Keszegh 1 , J. Pach 2,4 , D. Palvolgyi 3 , and G. Toth 4
- K et helyen egyszerre (Eml ekek Erd}os P alr ol)
- Monotone drawings of planar graphs J anos Pach
- Cutting glass Dedicated to Professor Branko Grunbaum on the occasion of his seventieth birthday
- Crossing number of toroidal graphs J anos Pach and G eza T oth y
- Ramsey-type theorems with forbidden subgraphs
- Cellular telephone networks and random maps in hypergraphs
- Isosceles triangles determined by a planar point set
- Geometric graphs with no self-intersecting path of length three ?
- Forbidden paths and cycles in ordered graphs and matrices J anos Pach G abor Tardos
- Crossing Families Boris Aronov 1 , Paul Erd}os 2 , Wayne Goddard 3 ,
- A Long Noncrossing Path Among Disjoint Segments in the Plane
- Distinct Distances in Three and Higher Dimensions Boris Aronov y J anos Pach z Micha Sharir x G abor Tardos {
- A computational approach to Conway's thrackle conjecture Radoslav Fulek
- Opposite-quadrant depth in the plane Herve Bronnimann
- A Tverberg-type result on multicolored J anos Pach
- Erdos--Hajnaltype results on intersection patterns of geometric objects
- On the complexity of the union of geometric objects
- Bounded-degree graphs can have arbitrarily large slope numbers
- On the Queue Number of Planar Graphs Giuseppe Di Battista, Fabrizio Frati
- On the Boundary of the Union of Planar Convex Sets \Lambda J'anos Pach y Micha Sharir z
- S k mez}oben h armas Pach J anos 1
- On the Number of Incidences Between Points and Curves \Lambda J'anos Pach y Micha Sharir z
- Minimum clique partition in unit disk graphs Adrian Dumitrescu1
- Tight Lower Bounds for the Size of Epsilon-Nets Janos Pach
- Comment on Fox News J anos Pach and G eza T oth y
- 0-8493-8524-5/97/$0.00+$.50 1997 by CRC Press LLC
- Problems and Results on Geometric Patterns Peter Brass, J anos Pach*
- Nearly equal distances in the plane Paul Erdos, Endre Makai and J anos Pach
- New results on the distribution of distances determined by separated point sets
- Crossing patterns of segments J anos Pach 1 and J ozsef Solymosi 2
- A generalization of the ErdosSzekeres theorem to disjoint convex sets
- OVERLAP PROPERTIES OF GEOMETRIC EXPANDERS JACOB FOX, MIKHAIL GROMOV, VINCENT LAFFORGUE, ASSAF NAOR, AND JANOS PACH
- A Happy End problema --A kombinatorikus geometria kezdetei
- Thirteen Problems on Crossing Numbers
- New bounds on crossing numbers J anos Pach
- Crossing numbers Janos Pach #
- Coloring axisparallel rectangles Janos Pach # Gabor Tardos +
- Tight Lower Bounds for the Size of Epsilon-Nets [Extended Abstract]
- A NOTE ON BLOCKING VISIBILITY BETWEEN POINTS
- An algorithm for nding many disjoint monochromatic edges in a complete 2-colored geometric graph
- On The Number Of Balanced Lines Janos Pach 1 and Rom Pinchasi 2
- A RAMSEYTYPE THEOREM FOR BIPARTITE GRAPHS
- Relaxing planarity for topological graphs ? J anos Pach 1 , Rado s Radoi ci c 2 , and G eza T oth 3
- The maximum number of times the same distance can occur among the vertices of a
- International Journal of Computational Geometry & Applications World Scienti c Publishing Company
- Lenses in Arrangements of Pseudocircles and their Applications
- A Happy End problema A kombinatorikus geometria kezdetei
- Decomposition of multiple coverings into many parts Janos Pach # and Geza Toth +
- Graphs drawn with few crossings per edge J'anos Pach \Lambda and G'eza T'oth y
- Boundeddegree graphs can have arbitrarily large slope numbers
- A Tur an-type theorem on chords of a convex Vasilis Capoyleas J anos Pach y
- Reconfigurations in graphs and grids Gruia Calinescu Adrian Dumitrescu y Janos Pach z
- Conway's conjecture for monotone thrackles Janos Pach
- Bichromatic lines with few points J anos Pach 1 and Rom Pinchasi 2
- How Many Unit Equilateral Triangles Can Be Generated by n Points in Convex Position?
- On the boundary complexity of the union of fat triangles Janos Pach y
- Applications of the Crossing Number J'anos Pach \Lambda
- A modular version of the Erd}os-Szekeres theorem Gyula K arolyi
- Contemporary Mathematics A generalization of quasi-planarity
- POPULAR DISTANCES IN 3-SPACE Paul Erd} os, Gergely Harcos and J anos Pach
- THE COMPLEXITY OF A CLASS OF INFINITE GRAPHS P eter Komj ath and J anos Pach
- Canonical theorems for convex sets J anos Pach
- The maximum number of times the same distance can occur among the vertices of a
- Delaunay graphs of point sets in the plane with respect to axisparallel rectangles
- A Ramsey-type Result for Convex Sets David Larman
- How many ways can one draw a graph? J anos Pach
- Con ict-free colorings J anos Pach
- Contemporary Mathematics State of the Union (of Geometric Objects)
- Submitted exclusively to the London Mathematical Society doi:10.1112/0000/000000
- Two places at once (A remembrance of Paul Erd}os)
- A Bipartite Strengthening of the Crossing Lemma
- Radial Points in the Plane J anos Pach y Micha Sharir z
- Turan-type results for partial orders and intersection graphs of convex sets
- Ramsey--Type Results for Geometric Graphs. II Gyula K'arolyi \Lambda
- On Regular Vertices of the Union of Planar Convex Objects Esther Ezra
- Crossing Patterns of Semi-algebraic Sets Janos Pach
- Crossing numbers Janos Pach
- Cubic Graphs Have Bounded Slope Parameter Balazs Keszegh1,5
- Folding and turning along geodesics in a convex surface
- Geometric Graphs and Hypergraphs J anos Pach 1
- Planar crossing numbers of graphs embeddable in another surface
- Online Con ict-Free Coloring for Intervals 1 Amos Fiat 2 Haim Kaplan 3 Meital Levy 4 Ji r Matou sek 5 Elchanan Mossel 6
- Planar crossing numbers of graphs embeddable in another surface
- THE NUMBER OF SIMPLICES EMBRACING THE ORIGIN ANOS PACH 1 Courant Institute, NYU and R enyi Institute, Hungarian
- Families of convex sets not representable by points Janos Pach
- Tangencies between families of disjoint regions in the plane Janos Pach
- Long Alternating Paths in Bicolored Point Sets , Janos Pach2,
- A separator theorem for string graphs and its applications Janos Pach
- Conflict-free colorings of graphs and hypergraphs Janos Pach
- Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
- A remark on transversal numbers J anos Pach
- Nearly equal distances and Szemer edi's regularity lemma
- Geometric graph theory J anos Pach
- A Left-First Search Algorithm for Planar Graphs H. de Fraysseix, 1 P. O. de Mendez 1 and J. Pach 2
- On Regular Vertices of the Union of Planar Convex Objects # Esther Ezra
- Three-dimensional grid drawings of graphs J anos Pach ? , Torsten Thiele ?? and G eza T oth ???
- On the Structure of Graphs with Low Obstacle Number Janos Pach1,2, Deniz Sarioz2
- Journal of Combinatorial Theory, Series A 108 (2004) 116 www.elsevier.com/locate/jcta
- Graphs with large obstacle numbers Padmini Mukkamala1, Janos Pach2, and Deniz Sarioz3
- On Grids in Topological Graphs Eyal Ackerman
- Thirteen Problems on Crossing Numbers
- Lower bounds on the obstacle number of graphs Padmini Mukkamala1, Janos Pach2, and Domotor Palvolgyi3
- Which crossing number is it anyway? Janos Pach
- Crossing numbers of imbalanced graphs Janos Pach
- Monochromatic empty triangles in two-colored point sets Janos Pach
- Topological graphs with no large grids J anos Pach 1 , Rom Pinchasi 2 , Micha Sharir 3 , G eza T oth 4
- A Bipartite Analogue of Dilworth's Theorem for Multiple Partial Orders
- Long Alternating Paths in Bicolored Point Sets Jan Kyn cl y J anos Pach z G eza T oth x
- Disjoint edges in topological graphs J anos Pach y G eza T oth z
- Recognizing string graphs is decidable J anos Pach
- Separating convex sets by straight lines J anos Pach 1 and G abor Tardos 2
- Submitted exclusively to the London Mathematical Society doi:10.1112/0000/000000
- On Conway's Thrackle Conjecture L aszl o Lov asz
- Points surrounding the origin Andreas F. Holmsen
- On the boundary complexity of the union of fat triangles Janos Pach
- A RAMSEY-TYPE THEOREM FOR BIPARTITE GRAPHS
- Lenses in Arrangements of Pseudo-circles and Their Applications
- Conflict-free Colorings Janos Pach
- PROBLEMS AND RESULTS ON GEOMETRIC PATTERNS
- On Planar Intersection Graphs with Forbidden Subgraphs Janos Pach
- Drawing cubic graphs with at most five slopes Balazs Keszegh
- SEPARATOR THEOREMS AND TURAN-TYPE RESULTS FOR PLANAR INTERSECTION GRAPHS
- Coloring axis-parallel rectangles Janos Pach
- Convexly independent subsets of the Minkowski sum of planar point sets
- A computational approach to Conway's thrackle conjecture Radoslav Fulek
- String graphs and incomparability graphs Janos Pach
- Overlap properties of geometric expanders Extended abstract
- OVERLAP PROPERTIES OF GEOMETRIC EXPANDERS JACOB FOX, MIKHAIL GROMOV, VINCENT LAFFORGUE, ASSAF NAOR, AND JANOS PACH
- f G d f(d)
- Monotone crossing number Janos Pach
- Erdos-Szekeres-type theorems for monotone paths and convex bodies
- A Bipartite Strengthening of the Crossing Lemma
- Drawing Hamiltonian cycles with no large angles Adrian Dumitrescu
- A computational approach to Conway's thrackle conjecture Radoslav Fulek
- Improving the Crossing Lemma by nding more crossings in sparse graphs
- Embedding Planar Graphs at Fixed Vertex J anos Pach 1? and Rephael Wenger 2??
- Crossing Patterns of Semialgebraic Sets # Noga Alon + Janos Pach # Rom Pinchasi Rados Radoicic Micha Sharir #
- Indecomposable coverings # Janos Pach 1 , Gabor Tardos 2 , and Geza Toth 3
- DIMACS Technical Report 9554 December 1995
- On the diameter of separated point sets with many nearly equal distances
- On Planar Intersection Graphs with Forbidden Subgraphs J anos Pach y Micha Sharir z
- Disjoint Edges in Topological Graphs Janos Pach1
- Coloring Kk-free intersection graphs of geometric objects in the plane
- A Bipartite Analogue of Dilworth's Theorem for Multiple Partial Orders
- Directions in Combinatorial Geometry J anos Pach
- The Union of Congruent Cubes in Three Dimensions J anos Pach y Ido Safruti z Micha Sharir x
- COMMON TANGENTS TO FOUR UNIT BALLS IN R 3 I.G. MACDONALD, J
- Ramsey{Type Results for Geometric Graphs. I Gyula K arolyi
- Turantype results for partial orders and intersection graphs of convex sets
- Representation of planar graphs by segments H. de Fraysseix 1 , P.O. de Mendez 1 and J. Pach 2
- Decomposition of multiple coverings into many parts Janos Pach
- ErdosSzekerestype theorems for segments and noncrossing convex sets
- Crossroads in Flatland J anos Pach 1
- Extremal Problems for Geometric Hypergraphs Tamal K. Dey 1 and J anos Pach 2
- THE MAXIMUM NUMBER OF EMPTY CONGRUENT TRIANGLES
- Intersecting Convex Sets by Rays Radoslav Fulek
- MIDPOINTS OF SEGMENTS INDUCED BY A POINT SET
- On the Number of Directions Determined by a Three-Dimensional Points Set
- SEPARATOR THEOREMS AND TUR ANTYPE RESULTS FOR PLANAR
- Contemporary Mathematics Geometric Incidences
- DEGENERATE CROSSING NUMBERS J anos Pach and G eza T oth y
- Structure Theorems for Systems of Segments J anos Pach 1 and J ozsef Solymosi 2
- QuasiPlanar Graphs Have a Linear Number of Edges \Lambda Pankaj K. Agarwal y Boris Aronov z J'anos Pach x Richard Pollack --
- Remarks on a Ramsey theory for trees Janos Pach
