Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andreas Parra

dblp:25/4262 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 3 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
Graph algorithms and graph theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › graph classes
chordal graph
0.011995
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.011995
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.011995
How to Use the Minimal Separators of a Graph for its Chordal Triangulation · ICALP 1995
YearPublicationVenuePosition
1998 Triangulating Multitolerance Graphs
Andreas Parra
Discret. Appl. Math.1
1997 Characterizations and Algorithmic Applications of Chordal Graph Embeddings
Andreas Parra, Petra Scheffler
Discret. Appl. Math.1
1995 How to Use the Minimal Separators of a Graph for its Chordal Triangulation
Andreas Parra, Petra Scheffler
ICALP1
1993 On a Problem Concerning Tolerance Graphs
Thomas Andreae, Ulf Hennig, Andreas Parra
Discret. Appl. Math.3