Magnus Bordewich

Kristina Wicke

Theor. Comput. Sci., 2022

On the Maximum Agreement Subtree Conjecture for Balanced Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Evaluating Gaussian Grasp Maps for Generative Grasping Models.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conference on Neural Networks, 2022

2021

Autoencoders Without Reconstruction for Textural Anomaly Detection.

[BibT_eX]

[DOI]

Proceedings of the International Joint Conference on Neural Networks, 2021

2020

Improving Robotic Grasping on Monocular Images Via Multi-Task Learning and Positional Loss.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Pattern Recognition, 2020

2019

Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Region Based Anomaly Detection with Real-Time Training and Analysis.

[BibT_eX]

[DOI]

Proceedings of the 18th IEEE International Conference On Machine Learning And Applications, 2019

2018

A universal tree-based network with the minimum number of reticulations.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Constructing Tree-Child Networks from Distance Matrices.

[BibT_eX]

[DOI]

Nihan Tokac

Algorithmica, 2018

2017

Recovering tree-child networks from shortest inter-taxa distance information.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Mixing of the Glauber dynamics for the ferromagnetic Potts model.

[BibT_eX]

[DOI]

Catherine S. Greenhill

Viresh Patel

Random Struct. Algorithms, 2016

An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances.

[BibT_eX]

[DOI]

Nihan Tokac

Discret. Appl. Math., 2016

Reticulation-visible networks.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2016

2015

Defining a Phylogenetic Tree with the Minimum Number of r-State Characters.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

2014

Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width.

[BibT_eX]

[DOI]

Ross J. Kang

Electron. J. Comb., 2014

2013

Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution.

[BibT_eX]

[DOI]

Radu Mihaescu

IEEE ACM Trans. Comput. Biol. Bioinform., 2013

2011

Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width.

[BibT_eX]

[DOI]

Ross J. Kang

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

On the Approximation Complexity Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

2009

Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Approximate Counting and Quantum Computation

[BibT_eX]

[DOI]

CoRR, 2009

Optimizing phylogenetic diversity across two trees.

[BibT_eX]

[DOI]

Andreas Spillner

Appl. Math. Lett., 2009

2008

Nature Reserve Selection Problem: A Tight Approximation Algorithm.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Path coupling using stopping times and counting independent sets and colorings in hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2008

A 3-approximation algorithm for the subtree distance between phylogenies.

[BibT_eX]

[DOI]

Catherine McCartin

J. Discrete Algorithms, 2008

2007

Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2007

Path coupling without contraction.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

Computing the minimum number of hybridization events for a consistent evolutionary history.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

2006

Identifying X-Trees with Few Characters.

[BibT_eX]

[DOI]

Mike A. Steel

Electron. J. Comb., 2006

Stopping Times, Metrics and Approximate Counting.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Metric Construction, Stopping Times and Path Coupling.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Identifying phylogenetic trees.

[BibT_eX]

[DOI]

Katharina T. Huber

Discret. Math., 2005

Path Coupling Using Stopping Times.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

Counting consistent phylogenetic trees is #P-complete.

[BibT_eX]

[DOI]