Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

6 Publications


2023 | Published | Journal Article | IST-REx-ID: 13165 | OA
Successive vertex orderings of fully regular graphs
L. Fang, H. Huang, J. Pach, G. Tardos, J. Zuo, Journal of Combinatorial Theory. Series A 199 (2023).
[Published Version] View | Files available | DOI | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 9587 | OA
Non-trivially intersecting multi-part families
M.A. Kwan, B. Sudakov, P. Vieira, Journal of Combinatorial Theory Series A 156 (2018) 44–60.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

1991 | Published | Journal Article | IST-REx-ID: 4056 | OA
A lower bound on the number of unit distances between the vertices of a convex polygon
H. Edelsbrunner, P. Hajnal, Journal of Combinatorial Theory Series A 56 (1991) 312–316.
[Published Version] View | DOI | Download Published Version (ext.)
 

1986 | Published | Journal Article | IST-REx-ID: 4098 | OA
The number of extreme pairs of finite point-sets in Euclidean spaces
H. Edelsbrunner, G. Stöckl, Journal of Combinatorial Theory Series A 43 (1986) 344–349.
View | DOI | Download None (ext.)
 

1986 | Published | Journal Article | IST-REx-ID: 4103 | OA
On the maximal number of edges of many faces in an arrangement
H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986) 159–166.
[Published Version] View | DOI | Download Published Version (ext.)
 

1985 | Published | Journal Article | IST-REx-ID: 4113
On the number of line separations of a finite set in the plane
H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 38 (1985) 15–29.
View | DOI
 

Filters and Search Terms

issn=0097-3165

Search

Filter Publications

Display / Sort

Export / Embed