Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
staff:droschinsky [2019-10-10 12:15] Andre Droschinsky [Research Interests] |
staff:droschinsky [2019-10-10 12:25] (current) Andre Droschinsky [Refereed Conference Proceedings] |
||
|---|---|---|---|
| Line 78: | Line 78: | ||
| * ** On the Time Complexity of Simple Cartesian Genetic Programming ** \\ // Roman Kalkreuth and Andre Droschinsky // \\ Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019), 2019, Vienna (Austria) \\ **Best Poster Nomination** | * ** On the Time Complexity of Simple Cartesian Genetic Programming ** \\ // Roman Kalkreuth and Andre Droschinsky // \\ Proceedings of the 11th International Joint Conference on Computational Intelligence (IJCCI 2019), 2019, Vienna (Austria) \\ **Best Poster Nomination** | ||
| + | |||
| + | * ** [[http://jgaa.info/accepted/2018/480.pdf|A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs]] ** \\ // Nils Kriege, Andre Droschinsky, Petra Mutzel // \\ Journal of Graph Algorithms and Applications, 2018 | ||
| * **[[http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9636|Largest Weight Common Subtree Embeddings with Distance Penalties]]** \\ //Andre Droschinsky, Nils Kriege, Petra Mutzel// \\ International Symposium on Mathematical Foundations of Computer Science (MFCS) 2018, 54:1-54:15. | * **[[http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=9636|Largest Weight Common Subtree Embeddings with Distance Penalties]]** \\ //Andre Droschinsky, Nils Kriege, Petra Mutzel// \\ International Symposium on Mathematical Foundations of Computer Science (MFCS) 2018, 54:1-54:15. | ||