| 2008 |
|---|
| 11 | EE | Magnus Bordewich,
Charles Semple:
Nature Reserve Selection Problem: A Tight Approximation Algorithm.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 275-280 (2008) |
| 2007 |
|---|
| 10 | EE | Magnus Bordewich,
Charles Semple:
Computing the minimum number of hybridization events for a consistent evolutionary history.
Discrete Applied Mathematics 155(8): 914-928 (2007) |
| 9 | EE | Magnus Bordewich,
Charles Semple:
Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(3): 458-466 (2007) |
| 8 | EE | Magnus Bordewich,
Martin E. Dyer:
Path coupling without contraction.
J. Discrete Algorithms 5(2): 280-292 (2007) |
| 2006 |
|---|
| 7 | EE | Magnus Bordewich,
Martin E. Dyer,
Marek Karpinski:
Stopping Times, Metrics and Approximate Counting.
ICALP (1) 2006: 108-119 |
| 6 | EE | Magnus Bordewich,
Charles Semple,
Mike Steel:
Identifying X-Trees with Few Characters.
Electr. J. Comb. 13(1): (2006) |
| 2005 |
|---|
| 5 | EE | Magnus Bordewich,
Martin E. Dyer,
Marek Karpinski:
Path Coupling Using Stopping Times.
FCT 2005: 19-31 |
| 4 | EE | Magnus Bordewich,
Katharina T. Huber,
Charles Semple:
Identifying phylogenetic trees.
Discrete Mathematics 300(1-3): 30-43 (2005) |
| 3 | EE | Magnus Bordewich,
Martin E. Dyer,
Marek Karpinski:
Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs
Electronic Colloquium on Computational Complexity (ECCC)(002): (2005) |
| 2 | EE | Magnus Bordewich,
Martin E. Dyer,
Marek Karpinski:
Metric Construction, Stopping Times and Path Coupling.
Electronic Colloquium on Computational Complexity (ECCC)(151): (2005) |
| 2004 |
|---|
| 1 | | Magnus Bordewich:
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs.
Combinatorics, Probability & Computing 13(1): 1-16 (2004) |
