On graph powers for leaf-labeled trees
Journal of Algorithms
On Graph Powers for Leaf-Labeled Trees
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Computing Phylogenetic Roots with Bounded Degrees and Errors
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Phylogenetic k-Root and Steiner k-Root
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On colorings of squares of outerplanar graphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Computing bounded-degree phylogenetic roots of disconnected graphs
Journal of Algorithms
ACM Transactions on Algorithms (TALG)
Computing phylogenetic roots with bounded degrees and errors is NP-complete
Theoretical Computer Science - Computing and combinatorics
Strictly chordal graphs are leaf powers
Journal of Discrete Algorithms
Structure and linear-time recognition of 4-leaf powers
ACM Transactions on Algorithms (TALG)
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics
Complexity of the Packing Coloring Problem for Trees
Graph-Theoretic Concepts in Computer Science
Computing bounded-degree phylogenetic roots of disconnected graphs
Journal of Algorithms
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Theoretical Computer Science
Polynomial kernels for 3-leaf power graph modification problems
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
Linear-Time algorithms for tree root problems
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Bounded degree closest k-tree power is NP-complete
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
5-th phylogenetic root construction for strictly chordal graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Extending the tractability border for closest leaf powers
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Error compensation in leaf root problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Elegant distance constrained labelings of trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Computing bounded-degree phylogenetic roots of disconnected graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Distance three labelings of trees
Discrete Applied Mathematics
On pairwise compatibility graphs having Dilworth number two
Theoretical Computer Science
Hi-index | 0.01 |