No. |
Title |
Author |
Year |
---|

1 |
A Cut Tree Representation for Pendant Pairs |
Lo, On-Hei S. et al. |
2018 |

2 |
Computing Tutte Paths |
Schmid, Andreas et al. |
2018 |

3 |
Computing Vertex-Disjoint Paths in Large Graphs Using MAOs |
Preißer, Johanna E. et al. |
2018 |

4 |
Edge-Orders |
Schlipf, Lena et al. |
2017 |

5 |
Linear-Time Recognition of Map Graphs with Outerplanar Witness |
Mnich, Matthias et al. |
2016 |

6 |
Computing 2-Walks in Polynomial Time |
Schmid, Andreas et al. |
2015 |

7 |
Construction Sequences and Certifying 3-Connectedness |
Schmidt, Jens M. |
2010 |