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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Marc Tedder

dblp:52/4020 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2014
—ORCID · none

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

Theory of computation · 4 · 2 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 · 50% Algorithms and data structures · 50%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › polynomial-time algorithms
linear-time algorithms		 0.112008
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations · ICALP (1) 2008
Graph algorithms and graph theory › graph decomposition
modular decomposition		 0.112008
Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations · ICALP (1) 2008
YearPublicationVenuePosition
2014 Practical and Efficient Circle Graph Recognition
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
 Algorithmica3
2014 Practical and Efficient Split Decomposition via Graph-Labelled Trees
Emeric Gioan, Christophe Paul, Marc Tedder, Derek G. Corneil
 Algorithmica3
2008 Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
Marc Tedder, Derek G. Corneil, Michel Habib, Christophe Paul
 ICALP (1)1
2007 An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs
Marc Tedder, Derek G. Corneil
 STACS1