Pach, János.
Pach, János, 1954-
János Pach
VIAF ID: 47391059 (Personal)
Permalink: http://viaf.org/viaf/47391059
Preferred Forms
- 100 0 _ ââ¡a János Pachâ
- 200 _ | ââ¡a Pachâ ââ¡b Jánosâ ââ¡f 1954-....â
-
-
-
-
- 100 1 0 ââ¡a Pach, Jánosâ
- 100 1 _ ââ¡a Pach, Jánosâ ââ¡d 1954-â
- 100 1 _ ââ¡a Pach, Jánosâ ââ¡d 1954-â
- 100 1 _ ââ¡a Pach, János,â ââ¡d 1954-....â
-
- 100 1 _ ââ¡a Pach, Jánosâ
-
-
- 100 1 _ ââ¡a Pach, Jánosâ
- 100 1 _ ââ¡a Pach, Jánosâ
-
-
-
Â
Â
Â
Â
4xx's: Alternate Name Forms (17)
Works
Title | Sources |
---|---|
Bounded VC-Dimension Implies the Schur-ErdÅs Conjecture | |
Coloring Hasse Diagrams and Disjointness Graphs of Curves | |
Combinatorial geometry | |
Common Tangents and Common Transversals | |
The complexity of a class of infinite graphs | |
Conflict-Free Colourings of Graphs and Hypergraphs | |
Crossing families | |
Cutting a graph into two dissimilar halves | |
Decomposition of Geometric Graphs into Star-Forests | |
Embedding Planar Graphs at Fixed Vertex Locations | |
Fat Triangles Determine Linearly Many Holes | |
From Tarskiâ²s Plank Problem to Simultaneous Approximation | |
GD 2004 | |
Geometry - intuitive, discrete, and convex : a tribute to Laszlo Fejes Toth | |
Graph drawing : 12th international symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004 : revised selected papers | |
Graphs of diameter 2 and linear programming | |
The grid revisited | |
Helly's Theorem with Volumes | |
Homogeneous selections from hyperplanes | |
How hard is half-space range searching? | |
How to draw a planar graph on a grid | |
How to make a graph bipartite | |
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs | |
Isomorphic subgraphs in a graph | |
Là szló Fejes Tóth : Festschrift = mélanges | |
Monochromatic paths in infinite coloured graphs | |
Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon | |
n92064292 | |
Nearly equal distances in the plane | |
New bounds on crossing numbers | |
New trends in discrete and computational geometry | |
The number of crossings in multigraphs with no empty lens | |
On a metric generalization of Ramseyâs theorem | |
On a problem of L. Fejes Tóth | |
On a quasi-Ramsey problem | |
On arrangements of Jordan arcs with three intersections per pair | |
On Conway's Thrackle Conjecture | |
On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles | |
On the Upward Planarity of Mixed Plane Graphs | |
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm | |
Online Conflict-Free Coloring for Intervals | |
Optimal Embedded and Enclosing Isosceles Triangles | |
Overlap properties of geometric expanders | |
PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE | |
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing | |
A Problem of Ulam on Planar Graphs | |
Radius, diameter, and minimum degree | |
Ramsey-type results for semi-algebraic relations | |
A Ramsey-type theorem for bipartite graphs | |
Repeated distances in space | |
Research problems in discrete geometry | |
Risan kikagaku ni okeru mikaiketsu mondaishu. | |
Small sets supporting fary embeddings of planar graphs | |
String graphs and incomparability graphs | |
Tight lower bounds for the size of epsilon-nets | |
Towards a theory of geometric graphs | |
Universal graphs without large bipartite subgraphs | |
An upper bound on the number of planarK-sets | |
Weaving Patterns of Lines and Line Segments in Space | |
Which crossing number is it, anyway? [computational geometry] | |
é¢æ£å¹¾ä½å¦ã«ãããæªè§£æ±ºåé¡é |