Demo Data from EDBT 2026 / reviewers in the wild / expert
Rebeka Raffay
dblp:377/1370
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0005-9633-6207ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 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
2 papers |
Computational geometry · 75% Combinatorics and discrete mathematics · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry › arrangement
arrangement of curves |
1.6 | 2 | 2025 | The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles · SoCG 2025 On the Number of Digons in Arrangements of Pairwise Intersecting Circles · SoCG 2024 |
Computational geometry
combinatorial geometry |
1.6 | 2 | 2025 | The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles · SoCG 2025 On the Number of Digons in Arrangements of Pairwise Intersecting Circles · SoCG 2024 |
Combinatorics and discrete mathematics
extremal combinatorics |
1.6 | 2 | 2025 | The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles · SoCG 2025 On the Number of Digons in Arrangements of Pairwise Intersecting Circles · SoCG 2024 |
Computational geometry › discrete geometry
geometric extremal problems |
1.6 | 2 | 2025 | The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles · SoCG 2025 On the Number of Digons in Arrangements of Pairwise Intersecting Circles · SoCG 2024 |
Methods — techniques the papers use, named apart from their topics
extremal graph theory · 0.8combinatorial geometry · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles
Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay |
SoCG | 5 |
| 2024 | On the Number of Digons in Arrangements of Pairwise Intersecting CirclesabstractA long-standing open conjecture of Branko Grünbaum from 1972 states that any arrangement of n pairwise intersecting pseudocircles in the plane can have at most 2n-2 digons. Agarwal et al. proved this conjecture for arrangements in which there is a common point surrounded by all pseudocircles. Recently, Felsner, Roch and Scheucher showed that Grünbaum’s conjecture is true for arrangements of pseudocircles in which there are three pseudocircles every pair of which creates a digon. In this paper we prove this over 50-year-old conjecture of Grünbaum for any arrangement of pairwise intersecting circles in the plane. Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, Rebeka Raffay |
SoCG | 5 |