#### Filter Results:

- Full text PDF available (178)

#### Publication Year

1968

2017

- This year (4)
- Last 5 years (57)
- Last 10 years (112)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn More

- Hubert de Fraysseix, János Pach, Richard Pollack
- Combinatorica
- 1990

Answering a question of Rosenstiehl and Tarjan, we show that every plane graph with n vertices has a F~ry embedding (i.e., straight-line embedding) on the 2n-4 by n 2 grid and provide an O(n) space, O(n log n) time algorithm to effect this embedding. The grid size is asymptotically optimal and it had been previously unknown whether one can always find a… (More)

- János Pach, Pankaj K. Agarwal
- Wiley-Interscience series in discrete mathematics…
- 1995

- János Pach, Géza Tóth
- Graph Drawing
- 1996

Given a simple graph G, let v(G) and e(G) denote its number of vertices and edges, respectively. We say that G is drawn in the plane if its vertices are represented by distinct points of the plane and its edges are represented by Jordan arcs connecting the corresponding point pairs but not passing through any other vertex. Throughout this paper, we only… (More)

- János Pach, Rephael Wenger
- Graphs and Combinatorics
- 1998

- János Pach, Géza Tóth
- FOCS
- 1998

A drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to each edge a simple continuous arc connecting the corresponding two points. The crossing number of G is the minimum number of crossing points in any drawing of G. We define two new parameters, as follows. The pairwise crossing number (resp. the odd-crossing number)… (More)

- János Pach, Micha Sharir
- Combinatorics, Probability & Computing
- 1998

- Klara Kedem, Ron Livne, János Pach, Micha Sharir
- Discrete & Computational Geometry
- 1986

- Hubert de Fraysseix, János Pach, Richard Pollack
- STOC
- 1988

Answering a question of Rosenstiehl and Tarjan, we show that every plane graph with <italic>n</italic> vertices has a Fáry embedding (i.e., straight-line embedding) on the 2<italic>n</italic> - 4 by <italic>n</italic> - 2 grid and provide an &Ogr;(<italic>n</italic>) space, &Ogr;(<italic>n</italic> log <italic>n</italic>) time algorithm to effect this… (More)

- Vasilis Capoyleas, János Pach
- J. Comb. Theory, Ser. B
- 1992