For best experience please turn on javascript and use a modern browser!
You are using a browser that is no longer supported by Microsoft. Please upgrade your browser. The site may not present itself correctly if you continue browsing.
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
2018
Ellis-Monaghan, J., Jonoska, N., & Pangborn, G. (2018). Tile-Based DNA Nanostructures: Mathematical Design and Problem Encoding. In Algebraic and Combinatorial Computational Biology (pp. 35-60). Elsevier. https://doi.org/10.1016/B978-0-12-814066-6.00002-7
Ferrari, M. M., Cook, A., Houlihan, A., Rouleau, R., Seeman, N. C., Pangborn, G., & Ellis-Monaghan, J. (2018). Design formalism for DNA self-assembly of polyhedral skeletons using rigid tiles. Journal of Mathematical Chemistry, 56(5), 1365-1392. https://doi.org/10.1007/s10910-018-0858-9
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
Journal editor
Ellis-Monaghan, J. (editor) (2021-2025). Annales de l'Institut Henri Poincaré D (Journal).
Others
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, ...).
2022
Stroh, F. J. M. (2022). Hamilton cycles and algorithms. [details]
The UvA website uses cookies and similar technologies to ensure the basic functionality of the site and for statistical and optimisation purposes. It also uses cookies to display content such as YouTube videos and for marketing purposes. This last category consists of tracking cookies: these make it possible for your online behaviour to be tracked. You consent to this by clicking on Accept. Also read our Privacy statement
Necessary
Cookies that are essential for the basic functioning of the website. These cookies are used to enable students and staff to log in to the site, for example.
Necessary & Optimalisation
Cookies that collect information about visitor behaviour anonymously to help make the website work more effectively.
Necessary & Optimalisation & Marketing
Cookies that make it possible to track visitors and show them personalised adverts. These are used by third-party advertisers to gather data about online behaviour. To watch Youtube videos you need to enable this category.