| Publication | Date of Publication | Type |
|---|
An \(( \aleph_0, k + 2)\)-theorem for \(k\)-transversals
Israel Journal of Mathematics | 2025-12-11 | Paper |
| Zarankiewicz's problem via \(\varepsilon\)-\(t\)-nets | 2025-11-24 | Paper |
Conflict-free colouring of subsets
Discrete & Computational Geometry | 2024-10-25 | Paper |
A new lower bound on Hadwiger-Debrunner numbers in the plane
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| Zarankiewicz's problem via $\epsilon$-t-nets | 2023-11-22 | Paper |
| scientific article; zbMATH DE number 7760134 (Why is no real title available?) | 2023-11-02 | Paper |
No Krasnosel'skiĭ number for general sets
Israel Journal of Mathematics | 2023-10-23 | Paper |
| An $(\aleph_0,k+2)$-Theorem for $k$-Transversals | 2023-06-03 | Paper |
The \(\varepsilon\)-\(t\)-net problem
Discrete & Computational Geometry | 2022-08-25 | Paper |
On multicolor Ramsey numbers and subset coloring of hypergraphs
SIAM Journal on Discrete Mathematics | 2022-08-18 | Paper |
On the number of hyperedges in the hypergraph of lines and pseudo-discs
The Electronic Journal of Combinatorics | 2022-08-04 | Paper |
| A solution to Ringel's circle problem | 2021-12-09 | Paper |
A new lower bound on Hadwiger-Debrunner numbers in the plane
Israel Journal of Mathematics | 2021-12-01 | Paper |
Conflict-free coloring of string graphs
Discrete & Computational Geometry | 2021-04-29 | Paper |
Blockers for simple Hamiltonian paths in convex geometric graphs of odd order
Discrete & Computational Geometry | 2021-02-10 | Paper |
A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points
Discrete & Computational Geometry | 2020-10-23 | Paper |
Conflict-free coloring of intersection graphs of geometric objects
Discrete & Computational Geometry | 2020-10-23 | Paper |
Blockers for triangulations of a convex polygon and a geometric maker-breaker game
The Electronic Journal of Combinatorics | 2020-10-20 | Paper |
From a \((p,2)\)-theorem to a tight \((p,q)\)-theorem
(available as arXiv preprint) | 2020-08-18 | Paper |
From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem
Discrete & Computational Geometry | 2020-06-16 | Paper |
On the union complexity of families of axis-parallel rectangles with a low packing number
The Electronic Journal of Combinatorics | 2018-11-22 | Paper |
On the union complexity of families of axis-parallel rectangles with a low packing number
The Electronic Journal of Combinatorics | 2018-11-22 | Paper |
Reconstruction of the path graph
Computational Geometry | 2018-10-31 | Paper |
On piercing numbers of families satisfying the \((p,q)_{r}\) property
Computational Geometry | 2018-10-31 | Paper |
Blockers for simple Hamiltonian paths in convex geometric graphs of even order
Discrete & Computational Geometry | 2018-07-26 | Paper |
On max-clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved bounds on the Hadwiger-Debrunner numbers
Israel Journal of Mathematics | 2018-07-03 | Paper |
| Conflict-free coloring of intersection graphs of geometric objects | 2018-03-15 | Paper |
On convex geometric graphs with no \(k+1\) pairwise disjoint edges
Graphs and Combinatorics | 2017-01-13 | Paper |
Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
Discrete & Computational Geometry | 2016-05-12 | Paper |
Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
Characterization of co-blockers for simple perfect matchings in a convex geometric graph
Discrete & Computational Geometry | 2013-09-23 | Paper |
On the smallest sets blocking simple perfect matchings in a convex geometric graph
Israel Journal of Mathematics | 2012-11-19 | Paper |
The $\epsilon$-$t$-Net Problem
(available as arXiv preprint) | N/A | Paper |
Conflict-Free Colouring of Subsets
(available as arXiv preprint) | N/A | Paper |
