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

1 |
Algorithmic Data Science (Invited Talk) |
Mutzel, Petra |
2019 |

2 |
Largest Weight Common Subtree Embeddings with Distance Penalties |
Droschinsky, Andre et al. |
2018 |

3 |
Crossing Number for Graphs with Bounded~Pathwidth |
Biedl, Therese et al. |
2017 |

4 |
A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph |
Kurz, Denis et al. |
2016 |

5 |
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem |
Droschinsky, Andre et al. |
2016 |

6 |
Graph Drawing with Algorithm Engineering Methods (Dagstuhl Seminar 11191) |
Demetrescu, Camil et al. |
2011 |

7 |
10261 Abstracts Collection -- Algorithm Engineering |
Italiano, Giuseppe F. et al. |
2010 |

8 |
10261 Executive Summary -- Algorithm Engineering |
Italiano, Giuseppe F. et al. |
2010 |

9 |
08191 Abstracts Collection -- Graph Drawing with Applications to Bioinformatics and Social Sciences |
Borgatti, Stephen et al. |
2008 |

10 |
08191 Executive Summary -- Graph Drawing with Applications to Bioinformatics and Social Sciences |
Borgatti, Stephen et al. |
2008 |