13 citations · 14 across the 3 of their papers we have counts for
4 papers
The Complexity of Phylogeny Constraint Satisfaction Problems
Manuel Bodirsky, Peter Jonsson, Trung Van Pham
We systematically study the computational complexity of a broad class of computational problems in phylogenetic reconstruction. The class contains for example the rooted triple con…
The Reducts of the Homogeneous Binary Branching C-relation
Manuel Bodirsky, Peter Jonsson, Trung Van Pham
Let (L;C) be the (up to isomorphism unique) countable homogeneous structure carrying a binary branching C-relation. We study the reducts of (L;C), i.e., the structures with domain…
Orbits of rotor-router operation and stationary distribution of random walks on directed graphs
Trung Van Pham
The rotor-router model is a popular deterministic analogue of random walk. In this paper we prove that all orbits of the rotor-router operation have the same size on a strongly con…
Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of Chip-firing game on directed graphs
Kévin Perrot, Trung Van Pham
In this paper we present further studies of recurrent configurations of Chip-firing games on Eulerian directed graphs (simple digraphs), a class on the way from undirected graphs t…