Demo Data from EDBT 2026 / reviewers in the wild / expert
Petra Scheffler
dblp:23/4490
· DBLP profile ↗
5ranked-venue papers
0as first author
0since 2021 · last 1997
0000-0003-4408-806XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 5
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 |
Graph algorithms and graph theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory › graph classes
chordal graph |
0.0 | 1 | 1995 | How to Use the Minimal Separators of a Graph for its Chordal Triangulation · ICALP 1995 |
Graph algorithms and graph theory › graph theory › graph transformation › graph modification
graph triangulation |
0.0 | 1 | 1995 | How to Use the Minimal Separators of a Graph for its Chordal Triangulation · ICALP 1995 |
Graph algorithms and graph theory › graph separators
minimal separator |
0.0 | 1 | 1995 | How to Use the Minimal Separators of a Graph for its Chordal Triangulation · ICALP 1995 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Generalized Coloring for Tree-like Graphs
Klaus Jansen, Petra Scheffler |
Discret. Appl. Math. | 2 |
| 1997 | Characterizations and Algorithmic Applications of Chordal Graph Embeddings
Andreas Parra, Petra Scheffler |
Discret. Appl. Math. | 2 |
| 1995 | How to Use the Minimal Separators of a Graph for its Chordal Triangulation
Andreas Parra, Petra Scheffler |
ICALP | 2 |
| 1993 | Maximum Covering with D Cliques
Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger |
FCT | 2 |
| 1992 | Generalized Coloring for Tree-like Graphs
Klaus Jansen, Petra Scheffler |
WG | 2 |