The SCEAS System
| |||||||

## Search the dblp DataBase
Magnus Bordewich:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Magnus Bordewich, Martin E. Dyer, Marek Karpinski
**Path Coupling Using Stopping Times.**[Citation Graph (0, 0)][DBLP] FCT, 2005, pp:19-31 [Conf] - Magnus Bordewich, Martin E. Dyer, Marek Karpinski
**Stopping Times, Metrics and Approximate Counting.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:108-119 [Conf] - Magnus Bordewich
**Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2004, v:13, n:1, pp:1-16 [Journal] - Magnus Bordewich, Charles Semple
**Computing the minimum number of hybridization events for a consistent evolutionary history.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:8, pp:914-928 [Journal] - Magnus Bordewich, Katharina T. Huber, Charles Semple
**Identifying phylogenetic trees.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:300, n:1-3, pp:30-43 [Journal] - Magnus Bordewich, Martin E. Dyer, Marek Karpinski
**Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:002, pp:- [Journal] - Magnus Bordewich, Martin E. Dyer, Marek Karpinski
**Metric Construction, Stopping Times and Path Coupling.**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:151, pp:- [Journal] - Magnus Bordewich, Martin E. Dyer
**Path coupling without contraction.**[Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2007, v:5, n:2, pp:280-292 [Journal] - Magnus Bordewich, Charles Semple
**Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable.**[Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Comput. Biology Bioinform., 2007, v:4, n:3, pp:458-466 [Journal] **Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution.**[Citation Graph (, )][DBLP]**Optimizing phylogenetic diversity across two trees.**[Citation Graph (, )][DBLP]**Identifying X-Trees with Few Characters.**[Citation Graph (, )][DBLP]**Approximate Counting and Quantum Computation**[Citation Graph (, )][DBLP]
Search in 0.034secs, Finished in 0.035secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |