FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
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
On finding spanning trees with few leaves
Information Processing Letters
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Graph-Theoretic Concepts in Computer Science
Approximating the Maximum Internal Spanning Tree problem
Theoretical Computer Science
FPT algorithms and kernels for the Directedk- Leaf problem
Journal of Computer and System Sciences
An Amortized Search Tree Analysis for k-Leaf Spanning Tree
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Pricing Strategies for Viral Marketing on Social Networks
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Spanning trees with many leaves in regular bipartite graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Better algorithms and bounds for directed maximum leaf problems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
Journal of Discrete Algorithms
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
SIAM Journal on Discrete Mathematics
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
Improving broadcast efficiency in wireless sensor network time synchronization protocols
Proceedings of the International Workshop on System Level Interconnect Prediction
Parameterized algorithms for directed maximum leaf problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |