default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMagnus Bordewich
Person information
- affiliation: Durham University, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j22]Magnus Bordewich
, Simone Linz, Megan Owen, Katherine St. John, Charles Semple, Kristina Wicke:
On the Maximum Agreement Subtree Conjecture for Balanced Trees. SIAM J. Discret. Math. 36(1): 336-354 (2022)- [j21]Magnus Bordewich, Charles Semple, Kristina Wicke:
On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks. Theor. Comput. Sci. 917: 66-80 (2022) - 2018
- [j20]Magnus Bordewich, Charles Semple, Nihan Tokac:
Constructing Tree-Child Networks from Distance Matrices. Algorithmica 80(8): 2240-2259 (2018) - [j19]Magnus Bordewich, Charles Semple:
A universal tree-based network with the minimum number of reticulations. Discret. Appl. Math. 250: 357-362 (2018) - 2016
- [j18]Magnus Bordewich, Charles Semple:
Reticulation-visible networks. Adv. Appl. Math. 78: 114-141 (2016) - [j17]Magnus Bordewich, Nihan Tokac:
An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances. Discret. Appl. Math. 213: 47-59 (2016) - [j16]Magnus Bordewich, Catherine S. Greenhill, Viresh Patel:
Mixing of the Glauber dynamics for the ferromagnetic Potts model. Random Struct. Algorithms 48(1): 21-52 (2016) - 2015
- [j15]Magnus Bordewich, Charles Semple:
Defining a Phylogenetic Tree with the Minimum Number of r-State Characters. SIAM J. Discret. Math. 29(2): 835-853 (2015) - 2014
- [j14]Magnus Bordewich, Ross J. Kang:
Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width. Electron. J. Comb. 21(4): 4 (2014) - 2013
- [j13]Magnus Bordewich, Radu Mihaescu:
Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. IEEE ACM Trans. Comput. Biol. Bioinform. 10(3): 576-583 (2013) - 2009
- [j12]Magnus Bordewich, Charles Semple, Andreas Spillner:
Optimizing phylogenetic diversity across two trees. Appl. Math. Lett. 22(5): 638-641 (2009) - [j11]Magnus Bordewich, Olivier Gascuel, Katharina T. Huber, Vincent Moulton:
Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference. IEEE ACM Trans. Comput. Biol. Bioinform. 6(1): 110-117 (2009) - 2008
- [j10]Magnus Bordewich, Catherine McCartin, Charles Semple:
A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6(3): 458-471 (2008) - [j9]Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Path coupling using stopping times and counting independent sets and colorings in hypergraphs. Random Struct. Algorithms 32(3): 375-399 (2008) - [j8]Magnus Bordewich, Charles Semple:
Nature Reserve Selection Problem: A Tight Approximation Algorithm. IEEE ACM Trans. Comput. Biol. Bioinform. 5(2): 275-280 (2008) - 2007
- [j7]Magnus Bordewich, Charles Semple:
Computing the minimum number of hybridization events for a consistent evolutionary history. Discret. Appl. Math. 155(8): 914-928 (2007) - [j6]Magnus Bordewich, Martin E. Dyer:
Path coupling without contraction. J. Discrete Algorithms 5(2): 280-292 (2007) - [j5]Magnus Bordewich, Charles Semple:
Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable. IEEE ACM Trans. Comput. Biol. Bioinform. 4(3): 458-466 (2007) - 2006
- [j4]Magnus Bordewich, Charles Semple, Mike A. Steel:
Identifying X-Trees with Few Characters. Electron. J. Comb. 13(1) (2006) - 2005
- [j3]Magnus Bordewich, Katharina T. Huber, Charles Semple:
Identifying phylogenetic trees. Discret. Math. 300(1-3): 30-43 (2005) - 2004
- [j2]Magnus Bordewich, Charles Semple, John M. Talbot:
Counting consistent phylogenetic trees is #P-complete. Adv. Appl. Math. 33(2): 416-430 (2004) - [j1]Magnus Bordewich:
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs. Comb. Probab. Comput. 13(1): 1-16 (2004)
Conference and Workshop Papers
- 2022
- [c9]William Prew, Toby P. Breckon, Magnus Bordewich, Ulrik R. Beierholm:
Evaluating Gaussian Grasp Maps for Generative Grasping Models. IJCNN 2022: 1-9 - 2021
- [c8]Philip A. Adey, Samet Akçay, Magnus Bordewich, Toby P. Breckon:
Autoencoders Without Reconstruction for Textural Anomaly Detection. IJCNN 2021: 1-8 - 2020
- [c7]William Prew, Toby P. Breckon, Magnus Bordewich, Ulrik R. Beierholm:
Improving Robotic Grasping on Monocular Images Via Multi-Task Learning and Positional Loss. ICPR 2020: 9843-9850 - 2019
- [c6]Philip A. Adey, Oliver K. Hamilton, Magnus Bordewich, Toby P. Breckon:
Region Based Anomaly Detection with Real-Time Training and Analysis. ICMLA 2019: 495-499 - 2011
- [c5]Magnus Bordewich, Ross J. Kang:
Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width. ICALP (1) 2011: 533-544 - 2010
- [c4]Magnus Bordewich, Radu Mihaescu:
Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. WABI 2010: 250-261 - [c3]Magnus Bordewich:
On the Approximation Complexity Hierarchy. WAOA 2010: 37-46 - 2006
- [c2]Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Stopping Times, Metrics and Approximate Counting. ICALP (1) 2006: 108-119 - 2005
- [c1]Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Path Coupling Using Stopping Times. FCT 2005: 19-31
Informal and Other Publications
- 2022
- [i10]William Prew, Toby P. Breckon, Magnus Bordewich, Ulrik R. Beierholm:
Evaluating Gaussian Grasp Maps for Generative Grasping Models. CoRR abs/2206.00432 (2022) - 2020
- [i9]William Prew, Toby P. Breckon, Magnus Bordewich, Ulrik R. Beierholm:
Improving Robotic Grasping on Monocular Images Via Multi-Task Learning and Positional Loss. CoRR abs/2011.02888 (2020) - 2019
- [i8]Magnus Bordewich, Britta Dorn, Simone Linz, Rolf Niedermeier:
Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443). Dagstuhl Reports 9(10): 134-151 (2019) - 2017
- [i7]Magnus Bordewich, Katharina T. Huber, Vincent Moulton, Charles Semple:
Recovering tree-child networks from shortest inter-taxa distance information. CoRR abs/1711.08866 (2017) - 2015
- [i6]Magnus Bordewich, Charles Semple:
Reticulation-Visible Networks. CoRR abs/1508.05424 (2015) - 2013
- [i5]Magnus Bordewich, Catherine S. Greenhill, Viresh Patel:
Mixing of the Glauber dynamics for the ferromagnetic Potts model. CoRR abs/1305.0776 (2013) - 2011
- [i4]Magnus Bordewich, Ross J. Kang:
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width. CoRR abs/1102.3635 (2011) - 2009
- [i3]Magnus Bordewich, Michael H. Freedman, László Lovász, D. Welsh:
Approximate Counting and Quantum Computation. CoRR abs/0908.2122 (2009) - 2005
- [i2]Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Magnus Bordewich, Martin E. Dyer, Marek Karpinski:
Metric Construction, Stopping Times and Path Coupling. Electron. Colloquium Comput. Complex. TR05 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
