Kleitman and combinatorics: a celebration
Discrete Mathematics - Kleitman and combinatorics: a celebration
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
Hardness and approximation results for Black Hole Search in arbitrary networks
Theoretical Computer Science
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Graph-Theoretic Concepts in Computer Science
FPT algorithms and kernels for the Directedk- Leaf problem
Journal of Computer and System Sciences
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
Spanning trees with many leaves in graphs without diamonds and blossoms
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Algorithmic meta-theorems for restrictions of treewidth
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
On graphs with few disjoint t-star minors
European Journal of Combinatorics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Max-leaves spanning tree is APX-hard for cubic graphs
Journal of Discrete Algorithms
Kernelization for maximum leaf spanning tree with positive vertex weights
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Kernel bounds for path and cycle problems
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
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
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)
Parameterized algorithms for directed maximum leaf problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
European Journal of Combinatorics
On tractable parameterizations of graph isomorphism
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
A 9k kernel for nonseparating independent set in planar graphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Note: On spanning cycles, paths and trees
Discrete Applied Mathematics
Kernel bounds for path and cycle problems
Theoretical Computer Science
A 9k kernel for nonseparating independent set in planar graphs
Theoretical Computer Science
Hi-index | 0.02 |