| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Almost Disjoint Triangles in 3-Space
|
Károlyi,
|
|
Inc.
|
28 |
4 |
p. 577-583
|
artikel
|
| 2 |
Almost Disjoint Triangles in 3-Space
|
Károlyi,
|
|
2002
|
28 |
4 |
p. 577-583
|
artikel
|
| 3 |
A Sufficient Condition for the Existence of Large Empty Convex Polygons
|
Valtr,
|
|
Inc.
|
28 |
4 |
p. 671-682
|
artikel
|
| 4 |
A Sufficient Condition for the Existence of Large Empty Convex Polygons
|
Valtr,
|
|
2002
|
28 |
4 |
p. 671-682
|
artikel
|
| 5 |
Combinatorial Geometry Problems in Pattern Recognition
|
Braß,
|
|
Inc.
|
28 |
4 |
p. 495-510
|
artikel
|
| 6 |
Combinatorial Geometry Problems in Pattern Recognition
|
Braß,
|
|
2002
|
28 |
4 |
p. 495-510
|
artikel
|
| 7 |
Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces
|
Aronov,
|
|
Inc.
|
28 |
4 |
p. 475-490
|
artikel
|
| 8 |
Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces
|
Aronov,
|
|
2002
|
28 |
4 |
p. 475-490
|
artikel
|
| 9 |
Gallai—Sylvester Theorem for Pairwise Intersecting Unit Circles
|
Pinchasi,
|
|
Inc.
|
28 |
4 |
p. 607-624
|
artikel
|
| 10 |
Gallai—Sylvester Theorem for Pairwise Intersecting Unit Circles
|
Pinchasi,
|
|
2002
|
28 |
4 |
p. 607-624
|
artikel
|
| 11 |
Guest Editors' Foreword
|
Shahrokhi, Farhad
|
|
Inc.
|
28 |
4 |
p. 447-448
|
artikel
|
| 12 |
Guest Editors’ Foreword
|
Shahrokhi, Farhad
|
|
2002
|
28 |
4 |
p. 447-448
|
artikel
|
| 13 |
Independence Numbers of Planar Contact Graphs
|
Swanepoel,
|
|
Inc.
|
28 |
4 |
p. 649-670
|
artikel
|
| 14 |
Independence Numbers of Planar Contact Graphs
|
Swanepoel,
|
|
2002
|
28 |
4 |
p. 649-670
|
artikel
|
| 15 |
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping
|
Efrat,
|
|
Inc.
|
28 |
4 |
p. 535-569
|
artikel
|
| 16 |
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping
|
Efrat,
|
|
2002
|
28 |
4 |
p. 535-569
|
artikel
|
| 17 |
Recognizing String Graphs Is Decidable
|
Pach,
|
|
Inc.
|
28 |
4 |
p. 593-606
|
artikel
|
| 18 |
Recognizing String Graphs Is Decidable
|
Pach,
|
|
2002
|
28 |
4 |
p. 593-606
|
artikel
|
| 19 |
Restricted Point Configurations with Many Collinear {k}-Tuplets
|
Ismailescu,
|
|
Inc.
|
28 |
4 |
p. 571-575
|
artikel
|
| 20 |
Restricted Point Configurations with Many Collinear {k}-Tuplets
|
Ismailescu,
|
|
2002
|
28 |
4 |
p. 571-575
|
artikel
|
| 21 |
The k Most Frequent Distances in the Plane
|
Solymosi,
|
|
Inc.
|
28 |
4 |
p. 639-648
|
artikel
|
| 22 |
The k Most Frequent Distances in the Plane
|
Solymosi,
|
|
2002
|
28 |
4 |
p. 639-648
|
artikel
|
| 23 |
The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space
|
Blokhuis,
|
|
Inc.
|
28 |
4 |
p. 491-494
|
artikel
|
| 24 |
The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space
|
Blokhuis,
|
|
2002
|
28 |
4 |
p. 491-494
|
artikel
|
| 25 |
The Partitioned Version of the Erdős—Szekeres Theorem
|
Pór,
|
|
Inc.
|
28 |
4 |
p. 625-637
|
artikel
|
| 26 |
The Partitioned Version of the Erdős—Szekeres Theorem
|
Pór,
|
|
2002
|
28 |
4 |
p. 625-637
|
artikel
|
| 27 |
The Unit Distance Problem for Centrally Symmetric Convex Polygons
|
Ábrego,
|
|
Inc.
|
28 |
4 |
p. 467-473
|
artikel
|
| 28 |
The Unit Distance Problem for Centrally Symmetric Convex Polygons
|
Ábrego,
|
|
2002
|
28 |
4 |
p. 467-473
|
artikel
|
| 29 |
Topological Persistence and Simplification
|
Edelsbrunner,
|
|
Inc.
|
28 |
4 |
p. 511-533
|
artikel
|
| 30 |
Topological Persistence and Simplification
|
Edelsbrunner,
|
|
2002
|
28 |
4 |
p. 511-533
|
artikel
|
| 31 |
Untangling a Polygon
|
Pach,
|
|
Inc.
|
28 |
4 |
p. 585-592
|
artikel
|
| 32 |
Untangling a Polygon
|
Pach,
|
|
2002
|
28 |
4 |
p. 585-592
|
artikel
|
| 33 |
Visibility Graphs and Oriented Matroids
|
Abello,
|
|
Inc.
|
28 |
4 |
p. 449-465
|
artikel
|
| 34 |
Visibility Graphs and Oriented Matroids
|
Abello,
|
|
2002
|
28 |
4 |
p. 449-465
|
artikel
|
Tijdschrift beschrijving