Publications

  1. Nojgaard, N., Geiß, M., Merkle, D., Stadler, P. F., Wieseke, N., & Hellmuth, M. (2017). Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps. In R. Schwartz & K. Reinert (Eds.), 17th International Workshop on Algorithms in Bioinformatics (WABI 2017) (Vol. 88, pp. 17:1–17:12). Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
  2. Nøjgaard, N., Geiß, M., Merkle, D., Stadler, P. F., Wieseke, N., & Hellmuth, M. (2018). Time-consistent reconciliation maps and forbidden time travel. Algorithms for Molecular Biology, 13(1), 2.
  3. Nøjgaard, N., El-Mabrouk, N., Wieseke, N., Daniel Merkle, & Hellmuth, M. (2018). Partial Homology Relations-Satisfiability in terms of Di-Cographs. In Proceedings of International Computing and Combinatorics Conference (COCOON), LNCS. Springer-Verlag.
  4. Hellmuth, M., Knudsen, A. S., Kotrbčı́k Michal, Merkle, D., & Nøjgaard, N. (2018). Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings. In 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) (pp. 154–168). SIAM.
  5. L. Anderson, J., Hellmuth, M., Merkle, D., Nøjgaard, N., & Peressotti, M. (2020). A Graph-Based Tool to Embed the π-Calculus into a Computational DPO Framework. In CEUR Workshop Proceedings (In Proceedings). SOFSEM.