Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Previous revision | ||
|
staff:kriege [2018-05-12 00:27] |
staff:kriege [2018-05-29 09:50] |
||
|---|---|---|---|
| Line 98: | Line 98: | ||
| * **[[https://arxiv.org/abs/1612.05531|A general purpose algorithm for counting simple cycles and simple paths of any length]]** \\ Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson, ''arXiv:1612.05531''. | * **[[https://arxiv.org/abs/1612.05531|A general purpose algorithm for counting simple cycles and simple paths of any length]]** \\ Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson, ''arXiv:1612.05531''. | ||
| - | === Journal Articles === | + | * **[[https://arxiv.org/abs/1805.10754|A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]]** \\ Nils M. Kriege, Andre Droschinsky, Petra Mutzel, ''arXiv:1805.10754''. |
| - | * **Erratum to: A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics** \\ Nils M. Kriege, Andre Droschinsky, Petra Mutzel \\ Annals of Mathematics and Artificial Intelligence, 2018, under review. | + | |
| + | |||
| + | === Journal Articles === | ||
| * **[[https://doi.org/10.1016/j.ejc.2017.07.012|On Maximum Common Subgraph Problems in Series-Parallel Graphs]]** (Preprint [[http://arxiv.org/abs/1708.02772|arXiv:1708.02772]]) \\ Nils Kriege, Florian Kurpicz, Petra Mutzel \\ European Journal on Combinatorics (EJC), vol. 68, 79-95, 2018. | * **[[https://doi.org/10.1016/j.ejc.2017.07.012|On Maximum Common Subgraph Problems in Series-Parallel Graphs]]** (Preprint [[http://arxiv.org/abs/1708.02772|arXiv:1708.02772]]) \\ Nils Kriege, Florian Kurpicz, Petra Mutzel \\ European Journal on Combinatorics (EJC), vol. 68, 79-95, 2018. | ||