The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Magnus Bordewich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Magnus Bordewich, Martin E. Dyer, Marek Karpinski
    Path Coupling Using Stopping Times. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:19-31 [Conf]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]

  10. Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. [Citation Graph (, )][DBLP]


  11. Optimizing phylogenetic diversity across two trees. [Citation Graph (, )][DBLP]


  12. Identifying X-Trees with Few Characters. [Citation Graph (, )][DBLP]


  13. Approximate Counting and Quantum Computation [Citation Graph (, )][DBLP]


Search in 0.034secs, Finished in 0.035secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002