Andreas D. M. Gunawan

According to our database1, Andreas D. M. Gunawan authored at least 15 papers between 2015 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Counting and enumerating galled networks.
Discret. Appl. Math., 2020

2019
Compression of Phylogenetic Networks and Algorithm for the Tree Containment Problem.
J. Comput. Biol., 2019

2018
Solving the tree containment problem in linear time for nearly stable phylogenetic networks.
Discret. Appl. Math., 2018

The compressions of reticulation-visible networks are tree-child.
CoRR, 2018

Fast Methods for Solving the Cluster Containment Problem for Phylogenetic Networks.
CoRR, 2018

S-Cluster++: a fast program for solving the cluster containment problem for phylogenetic networks.
Bioinform., 2018

Solving the Tree Containment Problem for Reticulation-Visible Networks in Linear Time.
Proceedings of the Algorithms for Computational Biology - 5th International Conference, 2018

2017
A decomposition theorem and two algorithms for reticulation-visible networks.
Inf. Comput., 2017

2016
Locating a Phylogenetic Tree in a Reticulation-Visible Network in Quadratic Time.
CoRR, 2016

A program for verification of phylogenetic network models.
Bioinform., 2016

Locating a Tree in a Reticulation-Visible Network in Cubic Time.
Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

2015
Bounding the Size of a Network Defined By Visibility Property.
CoRR, 2015

Stability Implies Computational Tractability: Locating a Tree in a Stable Network is Easy.
CoRR, 2015

Locating a Tree in a Phylogenetic Network in Quadratic Time.
Proceedings of the Research in Computational Molecular Biology, 2015

Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015


  Loading...