An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On the Connected Domination Number of Random Regular Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
An exact algorithm for the maximum leaf spanning tree problem
Computers and Operations Research
The approximability of the weighted Hamiltonian path completion problem on a tree
Theoretical Computer Science
Approximation hardness of dominating set problems in bounded degree graphs
Information and Computation
Online multicasting in WDM networks with shared light splitter bank
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Spanning trees with many leaves in regular bipartite graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A 5/3-approximation for finding spanning trees with many leaves in cubic graphs
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
An approximation algorithm for the maximum leaf spanning arborescence problem
ACM Transactions on Algorithms (TALG)
Fixed parameter evolutionary algorithms and maximum leaf spanning trees: a matter of mutation
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Multicast routing with minimum energy cost and minimum delay in wireless sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Max-leaves spanning tree is APX-hard for cubic graphs
Journal of Discrete Algorithms
Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
Parameterized algorithms for directed maximum leaf problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Compressed data aggregation: energy-efficient and high-fidelity data collection
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.89 |