Prof. dr. J.A. (Jo) Ellis-Monaghan
Faculteit der Natuurwetenschappen, Wiskunde en Informatica
Korteweg-de Vries Instituut
Bezoekadres
- Science Park 107
Postadres
- Postbus 94248
1090 GE Amsterdam
Contactgegevens
-
Publicaties
2022
- Abrams, L., & Ellis-Monaghan, J. A. (2022). New dualities from old: Generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs. Combinatorics Probability and Computing, 31(4), 574-597. https://doi.org/10.1017/S096354832100047X
- Ellingham, M. N., & Ellis-Monaghan, J. A. (2022). A Catalog of Enumeration Formulas for Bouquet and Dipole Embeddings under Symmetries. Symmetry, 14(9), [1793]. https://doi.org/10.3390/sym14091793
- Ellis-Monaghan, J. A., Goodall, A. J., Moffatt, I., Noble, S. D., & Vena, L. (2022). Irreducibility of the Tutte polynomial of an embedded graph. Algebraic Combinatorics, 5(6), 1337-1351. https://doi.org/10.5802/alco.252
2020
- Morse, A., Adkisson, W., Greene, J., Perry, D., Smith, B., Ellis-Monaghan, J., & Pangborn, G. (2020). DNA origami and unknotted A-trails in torus graphs. Journal of Knot Theory and its Ramifications, 29(7), [2050041]. https://doi.org/10.1142/S0218216520500418
2019
- Ellingham, M. N., & Ellis-Monaghan, J. A. (2019). Edge-outer graph embedding and the complexity of the DNA reporter strand problem. Theoretical Computer Science, 785, 117-127. https://doi.org/10.1016/j.tcs.2019.03.019
2015
- Ellis-Monaghan, J. A., McDowell, A., Moffatt, I., & Pangborn, G. (2015). DNA origami and the complexity of Eulerian circuits with turning costs. Natural Computing, 14(3), 491-503. https://doi.org/10.1007/s11047-014-9457-2
Tijdschriftredactie
- Ellis-Monaghan, J. (editor) (2021-2025). Annales de l'Institut Henri Poincaré D (Journal).
Andere
- Ellis-Monaghan, J. (organiser) (20-6-2021 - 26-6-2021). European Congress of Mathematics (organising a conference, workshop, ...). https://www.8ecm.si/
- Ellis-Monaghan, J. (organiser) (2020 - 2025). Dutch Combinatorics Network (organising a conference, workshop, ...).
This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list. -
Nevenwerkzaamheden
- Geen nevenwerkzaamheden
Stroh, F. J. M. (2022). Hamilton cycles and algorithms.