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.

5 Publications


2024 | Journal Article | IST-REx-ID: 15163 | OA
Campbell, R., Hörsch, F., & Moore, B. (2024). Decompositions into two linear forests of bounded lengths. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2024.113962
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2023 | Journal Article | IST-REx-ID: 12680 | OA
Ivanov, G., & Köse, S. (2023). Erdős-Ko-Rado and Hilton-Milner theorems for two-forms. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2023.113363
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2019 | Journal Article | IST-REx-ID: 6638 | OA
Silva, A., Arroyo Guevara, A. M., Richter, B., & Lee, O. (2019). Graphs with at most one crossing. Discrete Mathematics. Elsevier. https://doi.org/10.1016/j.disc.2019.06.031
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

1990 | Journal Article | IST-REx-ID: 4065
Edelsbrunner, H., Robison, A., & Shen, X. (1990). Covering convex sets with non-overlapping polygons. Discrete Mathematics. Elsevier. https://doi.org/10.1016/0012-365X(90)90147-A
View | DOI | Download None (ext.)
 

1986 | Journal Article | IST-REx-ID: 4107
Edelsbrunner, H., & Haussler, D. (1986). The complexity of cells in 3-dimensional arrangements. Discrete Mathematics. Elsevier. https://doi.org/10.1016/0012-365X(86)90008-7
View | DOI
 

Filters and Search Terms

issn=0012-365X

Search

Filter Publications