Demo Data from EDBT 2026 / reviewers in the wild / expert
Lidor Portal
dblp:427/3964
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Computational geometry · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry
combinatorial geometry |
1.0 | 1 | 2026 | Helly-Type Theorems for Splitting Point Sets · SODA 2026 |
Computational geometry › convex geometry
helly-type theorem |
1.0 | 1 | 2026 | Helly-Type Theorems for Splitting Point Sets · SODA 2026 |
Computational geometry
tukey depth |
0.3 | 1 | 2026 | Helly-Type Theorems for Splitting Point Sets · SODA 2026 |
Methods — techniques the papers use, named apart from their topics
combinatorial geometry · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Helly-Type Theorems for Splitting Point SetsabstractLet \(0 \lt \alpha \le 1/2\). We say that a finite point set \(P\) in \(\mathbb R^d\) is \(\alpha\)-split by a hyperplane \(h\) if each of the closed half-spaces determined by \(h\), contains at least \(\alpha|P|\) of the points of \(P\). We further say \(P\) is \(\alpha\)-split by a \(k\)-dimensional flat \(\tau\) if \(P\) is \(\alpha\)-split by any hyperplane through \(\tau\). In the standard notation (which coincides with Tukey depth for \(k = 0\)), the \(k\)-flat \(\tau\) has depth \(\alpha\) with respect to \(P\). Lidor Portal, Natan Rubin |
SODA | 1 |