Coloring powers of planar graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of Boolean matrix root computation
Theoretical Computer Science - Special papers from: COCOON 2003
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
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics
The NLC-width and clique-width for powers of graphs of bounded tree-width
Discrete Applied Mathematics
Computing bounded-degree phylogenetic roots of disconnected graphs
Journal of Algorithms
The complexity of Boolean matrix root computation
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
The clique-width of tree-power and leaf-power graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Theoretical Computer Science
A good characterization of squares of strongly chordal split graphs
Information Processing Letters
Extremal graphs for the identifying code problem
European Journal of Combinatorics
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
Strong colorings of hypergraphs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Error compensation in leaf root problems
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Computing bounded-degree phylogenetic roots of disconnected graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Computing square roots of trivially perfect and threshold graphs
Discrete Applied Mathematics
| Hi-index | 0.05 |