Demo Data from VLDB 2026 / reviewers in the wild / expert
Leo Schreiber
dblp:356/3981
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0002-7131-5969ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 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.
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% | |
| Theoretical computer science
1 paper |
Computational geometry · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › graph visualization
graph drawing |
0.9 | 1 | 2025 | Interweaving Mathematics and Art: Drawing Graphs as Celtic Knots and Links With CelticGraph · IEEE Trans. Vis. Comput. Graph. 2025 |
Computational geometry › graph drawing
planar graph drawing |
0.9 | 1 | 2025 | Interweaving Mathematics and Art: Drawing Graphs as Celtic Knots and Links With CelticGraph · IEEE Trans. Vis. Comput. Graph. 2025 |
Methods — techniques the papers use, named apart from their topics
bézier curves · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Interweaving Mathematics and Art: Drawing Graphs as Celtic Knots and Links With CelticGraphabstractCeltic knots, an ancient art form often linked to Celtic heritage, have been used historically in the decoration of monuments and manuscripts, often symbolizing the notions of eternity and interconnectedness. This paper introduces the framework CelticGraph designed for illustrating graphs in the style of Celtic knots and links. The process of creating these drawings raises interesting combinatorial concepts in the theory of circuits in planar graphs. Further, CelticGraph uses a novel algorithm to represent edges as Bézier curves, aiming to show each link as a smooth curve with limited curvature. We also show that with our production mechanisms we can compute any 4-regular plane graph and thereby any celtic knot or link. The CelticGraph framework for drawing graphs as celtic knots and links is implemented as an add-on of Vanted, a network visualization and analysis tool. Niklas Gröne, Peter Eades, Karsten Klein 0001, Patrick Eades, Leo Schreiber, Ulf Hailer, Hugo A. D. do Nascimento, Falk Schreiber |
IEEE Trans. Vis. Comput. Graph. | 5 |
| 2023 | CelticGraph: Drawing Graphs as Celtic Knots and Links
Peter Eades, Niklas Gröne, Karsten Klein 0001, Patrick Eades, Leo Schreiber, Ulf Hailer, Falk Schreiber |
GD (1) | 5 |