| Publication | Date of Publication | Type |
|---|
| Zarankiewicz's problem via $\epsilon$-t-nets | 2023-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059949 | 2023-11-02 | Paper |
| No Krasnosel'skiĭ number for general sets | 2023-10-23 | Paper |
| An $(\aleph_0,k+2)$-Theorem for $k$-Transversals | 2023-06-03 | Paper |
| The \(\varepsilon\)-\(t\)-net problem | 2022-08-25 | Paper |
| On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs | 2022-08-18 | Paper |
| On the number of hyperedges in the hypergraph of lines and pseudo-discs | 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 | 2021-12-01 | Paper |
| Conflict-free coloring of string graphs | 2021-04-29 | Paper |
| Blockers for simple Hamiltonian paths in convex geometric graphs of odd order | 2021-02-10 | Paper |
| A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane | 2021-02-02 | Paper |
| On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points | 2020-10-23 | Paper |
| Conflict-free coloring of intersection graphs of geometric objects | 2020-10-23 | Paper |
| Blockers for triangulations of a convex polygon and a geometric maker-breaker game | 2020-10-20 | Paper |
| From a $(p,2)$-Theorem to a Tight $(p,q)$-Theorem | 2020-08-18 | Paper |
| From a \((p, 2)\)-theorem to a tight \((p, q)\)-theorem | 2020-06-16 | Paper |
| On the union complexity of families of axis-parallel rectangles with a low packing number | 2018-11-22 | Paper |
| Reconstruction of the path graph | 2018-10-31 | Paper |
| On piercing numbers of families satisfying the \((p,q)_{r}\) property | 2018-10-31 | Paper |
| Blockers for simple Hamiltonian paths in convex geometric graphs of even order | 2018-07-26 | Paper |
| On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers | 2018-07-16 | Paper |
| Improved bounds on the Hadwiger-Debrunner numbers | 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 | 2017-01-13 | Paper |
| Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph | 2016-05-12 | Paper |
| Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs | 2013-09-25 | Paper |
| Characterization of co-blockers for simple perfect matchings in a convex geometric graph | 2013-09-23 | Paper |
| On the smallest sets blocking simple perfect matchings in a convex geometric graph | 2012-11-19 | Paper |
| A solution to Ringel's circle problem | 0001-01-03 | Paper |
| The $\epsilon$-$t$-Net Problem | 0001-01-03 | Paper |
| Conflict-Free Colouring of Subsets | 0001-01-03 | Paper |
| An $(\aleph_0,k+2)$-Theorem for $k$-Transversals | 0001-01-03 | Paper |
