EDBT 2026 Demo / reviewers in the wild / expert
Stefan Hertel
dblp:99/1370
· DBLP profile ↗
5ranked-venue papers
4as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5 · 4 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-author
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 › triangulation
planar triangulations |
0.0 | 1 | 1985 | Fast Triangulation of the Plane with Respect to Simple Polygons · Inf. Control. 1985 |
Computational geometry › triangulation
polygon triangulation |
0.0 | 1 | 1985 | Fast Triangulation of the Plane with Respect to Simple Polygons · Inf. Control. 1985 |
Computational geometry
triangulation |
0.0 | 1 | 1985 | Fast Triangulation of the Plane with Respect to Simple Polygons · Inf. Control. 1985 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Fast Triangulation of the Plane with Respect to Simple Polygons
Stefan Hertel, Kurt Mehlhorn |
Inf. Control. | 1 |
| 1984 | Space Sweep Solves Intersection of Convex Polyhedra
Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, Jürg Nievergelt |
Acta Informatica | 1 |
| 1983 | Fast Triangulation of Simple Polygons
Stefan Hertel, Kurt Mehlhorn |
FCT | 1 |
| 1983 | Smoothsort's Behavior on Presorted Sequences
Stefan Hertel |
Inf. Process. Lett. | 1 |
| 1982 | A Probabilistic Algorithm for Vertex Connectivity of Graphs
Michael Becker 0009, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter |
Inf. Process. Lett. | 4 |