An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs. - Marc Tedder; Derek G. Corneil (STACS, 2007)

Simple, linear-time modular decomposition - Marc Tedder; Derek G. Corneil; Michel Habib; Christophe Paul (CoRR, 2007)

Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. - Marc Tedder; Derek G. Corneil; Michel Habib; Christophe Paul (ICALP (1), 2008)

Circle Graph Recognition in Time O(n+m) α(n+m) - Emeric Gioan; Christophe Paul; Marc Tedder; Derek G. Corneil (CoRR, 2011)

Applications of Lexicographic Breadth-first Search to Modular Decomposition, Split Decomposition, and Circle Graphs. - Marc Tedder (2011)

Practical and Efficient Circle Graph Recognition. - Emeric Gioan; Christophe Paul; Marc Tedder; Derek G. Corneil (Algorithmica, 2014)

Practical and Efficient Split Decomposition via Graph-Labelled Trees. - Emeric Gioan; Christophe Paul; Marc Tedder; Derek G. Corneil (Algorithmica, 2014)

Simpler, Linear-Time Transitive Orientation via Lexicographic Breadth-First Search. - Marc Tedder (CoRR, 2015)