Marc Tedder

According to our database¹, Marc Tedder authored at least 8 papers between 2007 and 2015.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2015

Simpler, Linear-Time Transitive Orientation via Lexicographic Breadth-First Search.

[BibT_eX]

[DOI]

Marc Tedder

CoRR, 2015

2014

Practical and Efficient Split Decomposition via Graph-Labelled Trees.

[BibT_eX]

[DOI]

Algorithmica, 2014

Practical and Efficient Circle Graph Recognition.

[BibT_eX]

[DOI]

Algorithmica, 2014

2011

Applications of Lexicographic Breadth-first Search to Modular Decomposition, Split Decomposition, and Circle Graphs.

[BibT_eX]

[DOI]

Marc Tedder

PhD thesis, 2011

Circle Graph Recognition in Time O(n+m) α(n+m)

[BibT_eX]

[DOI]

CoRR, 2011

2008

Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Simple, linear-time modular decomposition

[BibT_eX]

[DOI]

CoRR, 2007

An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs.

[BibT_eX]

[DOI]

Marc Tedder

Derek G. Corneil

Proceedings of the STACS 2007, 2007

Marc Tedder

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...