Magnus Bordewich

	2011
20		Magnus Bordewich, Ross J. Kang: Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width. ICALP (1) 2011: 533-544
19		Magnus Bordewich, Ross J. Kang: Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width CoRR abs/1102.3635: (2011)
	2010
18		Magnus Bordewich, Radu Mihaescu: Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. WABI 2010: 250-261
17		Magnus Bordewich: On the Approximation Complexity Hierarchy. WAOA 2010: 37-46
	2009
16		Magnus Bordewich, Charles Semple, Andreas Spillner: Optimizing phylogenetic diversity across two trees. Appl. Math. Lett. 22(5): 638-641 (2009)
15		Magnus Bordewich, Michael H. Freedman, L. Lovász, D. Welsh: Approximate Counting and Quantum Computation CoRR abs/0908.2122: (2009)
14		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. Biology Bioinform. 6(1): 110-117 (2009)
	2008
13		Magnus Bordewich, Charles Semple: Nature Reserve Selection Problem: A Tight Approximation Algorithm. IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 275-280 (2008)
12		Magnus Bordewich, Catherine McCartin, Charles Semple: A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6(3): 458-471 (2008)
11		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)
	2007
10		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		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		Magnus Bordewich, Martin E. Dyer: Path coupling without contraction. J. Discrete Algorithms 5(2): 280-292 (2007)
	2006
7		Magnus Bordewich, Martin E. Dyer, Marek Karpinski: Stopping Times, Metrics and Approximate Counting. ICALP (1) 2006: 108-119
6		Magnus Bordewich, Charles Semple, Mike A. Steel: Identifying X-Trees with Few Characters. Electr. J. Comb. 13(1): (2006)
	2005
5		Magnus Bordewich, Martin E. Dyer, Marek Karpinski: Path Coupling Using Stopping Times. FCT 2005: 19-31
4		Magnus Bordewich, Katharina T. Huber, Charles Semple: Identifying phylogenetic trees. Discrete Mathematics 300(1-3): 30-43 (2005)
3		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		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)

Coauthor Index

1	Martin E. Dyer	[2] [3] [5] [7] [8] [11]
2	Michael H. Freedman	[15]
3	Olivier Gascuel	[14]
4	Katharina T. Huber	[4] [14]
5	Ross J. Kang	[19] [20]
6	Marek Karpinski	[2] [3] [5] [7] [11]
7	L. Lovász	[15]
8	Catherine McCartin	[12]
9	Radu Mihaescu	[18]
10	Vincent Moulton	[14]
11	Charles Semple	[4] [6] [9] [10] [12] [13] [16]
12	Andreas Spillner	[16]
13	Mike A. Steel (Michael Anthony Steel)	[6]
14	D. Welsh	[15]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page